2022
DOI: 10.1016/j.jksuci.2020.10.010
|View full text |Cite
|
Sign up to set email alerts
|

Domain knowledge based genetic algorithms for mobile robot path planning having single and multiple targets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
31
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(32 citation statements)
references
References 30 publications
1
31
0
Order By: Relevance
“…Genetic algorithms are stochastic global search optimization methods that simulate the phenomena of replication, crossover, and variation that occur in natural selection and inheritance. Starting from an initial population, the population evolves to increasingly better regions in the search space by random selection, crossover and mutation operations to produce a group of individuals better suited to the environment, and finally converges to a group of individuals best suited to the environment to obtain a quality solution to the problem ( Nazarahari et al, 2019 ; Sarkar et al, 2020 ). For path planning based on genetic algorithm, the individuals suitable for the environment are the suitable moving paths, and the one that best satisfies the conditions is obtained by random selection and crossover variation.…”
Section: Methodsmentioning
confidence: 99%
“…Genetic algorithms are stochastic global search optimization methods that simulate the phenomena of replication, crossover, and variation that occur in natural selection and inheritance. Starting from an initial population, the population evolves to increasingly better regions in the search space by random selection, crossover and mutation operations to produce a group of individuals better suited to the environment, and finally converges to a group of individuals best suited to the environment to obtain a quality solution to the problem ( Nazarahari et al, 2019 ; Sarkar et al, 2020 ). For path planning based on genetic algorithm, the individuals suitable for the environment are the suitable moving paths, and the one that best satisfies the conditions is obtained by random selection and crossover variation.…”
Section: Methodsmentioning
confidence: 99%
“…Heuristic optimization algorithms offer solutions close to nonlinear mathematics and real life problems. In the literature, heuristic optimization algorithms have been applied in many different areas [83][84][85][86][87]. Particle Swarm Optimization (PSO), one of these algorithms, is a heuristic algorithm put forward by Kennedy and Eberhart in 1995 [88].…”
Section: Pso and Bpsomentioning
confidence: 99%
“…Because GA is widely used in path planning [144], the following year's study included many combinations, improvements, and modifications of this algorithm to further improve AGV's navigation ability. For example, Jiang et al [145] proposed an improved adaptive GA combining with simulated annealing in their work for AGV path planning to achieve strong ability to avoid local optima and faster convergence speed.…”
Section: Genetic Algorithmmentioning
confidence: 99%