2007
DOI: 10.1109/mim.2007.4428579
|View full text |Cite
|
Sign up to set email alerts
|

Genetic algorithms for autonomous robot navigation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
38
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 102 publications
(38 citation statements)
references
References 9 publications
0
38
0
Order By: Relevance
“…Based on the (10), modified signal for the head joint y out,head in the headnavigated locomotion is calculated from the output of the first CPG (y out,1 ) and the second CPG (y out,2 ). The final computational model is given in (12). Similarly, amplitude coefficient A head is calculated from the crossing point of y out,1 , y out,virtual , and…”
Section: B Head-navigated Locomotionmentioning
confidence: 99%
See 1 more Smart Citation
“…Based on the (10), modified signal for the head joint y out,head in the headnavigated locomotion is calculated from the output of the first CPG (y out,1 ) and the second CPG (y out,2 ). The final computational model is given in (12). Similarly, amplitude coefficient A head is calculated from the crossing point of y out,1 , y out,virtual , and…”
Section: B Head-navigated Locomotionmentioning
confidence: 99%
“…Matsuo and Ishii [11] also applied the AMM to change the direction of a neurally controlled snake robot. Ye [12] summarized the methods for the turn motion of the snake robot. However, only qualitative results for the implementation of turn motion are available in previous studies.…”
Section: Introductionmentioning
confidence: 99%
“…In order to generate a trajectory from the initial to the desired location in obstacle avoidance conditions, the robot must also possess perception, reasoning, and recognition characteristics, as well as the ability to learn and approximate any function with an appropriate generalization performance. For decades, various types of navigation methods have been developed to deal with the motion planning problem of mobile robots, such as the artificial potential field method [2,3], genetic algorithm (GA) method [4][5][6], particle swarm optimization (PSO) [7,8], and so on. However, these methods suffer from some inherent drawbacks.…”
Section: Introductionmentioning
confidence: 99%
“…collision-free route). As shown in [20], the path planning problem of a mobile robot is a NP-hard optimization one that can only be solved by heuristic algorithms such as evolutionary computation techniques. Among various algorithms capable of handling NP-hard problems, the genetic algorithm (GA) has proven to be the simple yet effective one that has been frequently used in industry especially in mobile robotics [20].…”
Section: Introductionmentioning
confidence: 99%