DeepAI AI Chat
Log In Sign Up

A Novel Knowledge-Based Genetic Algorithm for Robot Path Planning in Complex Environments

09/03/2022
by   Yanrong Hu, et al.
0

In this paper, a novel knowledge-based genetic algorithm for path planning of a mobile robot in unstructured complex environments is proposed, where five problem-specific operators are developed for efficient robot path planning. The proposed genetic algorithm incorporates the domain knowledge of robot path planning into its specialized operators, some of which also combine a local search technique. A unique and simple representation of the robot path is proposed and a simple but effective path evaluation method is developed, where the collisions can be accurately detected and the quality of a robot path is well reflected. The proposed algorithm is capable of finding a near-optimal robot path in both static and dynamic complex environments. The effectiveness and efficiency of the proposed algorithm are demonstrated by simulation studies. The irreplaceable role of the specialized genetic operators in the proposed genetic algorithm for solving the robot path planning problem is demonstrated through a comparison study.

READ FULL TEXT

page 1

page 4

page 5

page 7

page 8

page 9

page 10

page 11

05/22/2015

A Pareto Front-Based Multiobjective Path Planning Algorithm

Path planning is one of the most vital elements of mobile robotics. With...
03/02/2020

Design and Implementation of A Novel Precision Irrigation Robot Based on An Intelligent Path Planning Algorithm

The agricultural irrigation system is closely related to agricultural pr...
08/17/2015

Reasoning in complex environments with the SelectScript declarative language

SelectScript is an extendable, adaptable, and declarative domain-specifi...
09/10/2020

Path planning model of mobile robots in the context of crowds

Robot path planning model based on RNN and visual quality evaluation in ...
08/07/2021

Multi-Robot Path Planning in Complex Environments via Graph Embedding

We propose an approach to solve multi-agent path planning (MPP) problems...