2017
DOI: 10.2316/journal.206.2017.4.206-4998
|View full text |Cite
|
Sign up to set email alerts
|

A Memetic Algorithm With Variable Length Chromosome for Robot Path Planning Under Dynamic Environments

Abstract: There are some shortcomings of the traditional methods for robot path planning, such as the local minimum problem and the low convergence speed in the genetic algorithm (GA)-based methods.In this paper, an improved memetic algorithm is proposed for robot path planning. In the global search process of the proposed memetic algorithm, a GA with variable length chromosome based on improved two-point crossover and bacterial mutation is used to avoid the local optimum problem. And a search method which combines a ne… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…The feasible region of many problems is uncertain in real life. Many scholars [23][24][25][26][27][28][29] have improved the NSGA-III-VLC according to the characteristics of the problem. In the formulation of the equipment usage plan considering rotation, because the quantity of rotation will affect the rotation cost and risk, the length of the chromosome also affects the decision-making.…”
Section: Principle Of I-nsga-iii-vlc Methodsmentioning
confidence: 99%
“…The feasible region of many problems is uncertain in real life. Many scholars [23][24][25][26][27][28][29] have improved the NSGA-III-VLC according to the characteristics of the problem. In the formulation of the equipment usage plan considering rotation, because the quantity of rotation will affect the rotation cost and risk, the length of the chromosome also affects the decision-making.…”
Section: Principle Of I-nsga-iii-vlc Methodsmentioning
confidence: 99%
“…At the theoretical level, some methods used in the robotic field can be applied in self-driving cars for the similarity between them, including path planning, environmental sensing, autonomous navigation and control, etc. [23,24]. Various artificial intelligence algorithms have been used in self-driving cars, such as fuzzy logic, neural network, and so on.…”
Section: Driving Pathmentioning
confidence: 99%
“…The completeness is one of the advantages of these traditional methods in addition to that increasing the problem size increases the execution time. On the other hand, soft computing methods have many examples like particle swarm optimization algorithm [31,40,41] which is ten times faster than the Fuzzy logic [42][43][44], Genetic algorithm [45][46][47] which is used to avoid the local minima and the high execution time problems, Memetic algorithm [48], neural networks [49][50][51] and Ant colony [52,53]. Although the solutions of the soft computing methods suffer from the unpredictability, the uncertainty and near-optimal path instead of exact solutions, these methods can be used in environments that higher artificial intelligence is needed and not enough information and noisy information is provided.…”
mentioning
confidence: 99%