Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)
DOI: 10.1109/cec.2004.1331052
|View full text |Cite
|
Sign up to set email alerts
|

Autonomous local path planning for a mobile robot using a genetic algorithm

Abstract: Abstract-This paper presents results of our work in development of a genetic algorithm based path-planning algorithm for local obstacle avoidance (local feasible path) of a mobile robot in a given search space. The method tries to find not only a valid path but also an optimal one. The objectives are to minimize the length of the path and the number of turns. The proposed pathplanning method allows a free movement of the robot in any direction so that the path-planner can handle complicated search spaces.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
72
0
2

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 137 publications
(74 citation statements)
references
References 18 publications
0
72
0
2
Order By: Relevance
“…Genetic approaches include work on the image as a data base of the problem by implementing several tools of Genetic Algorithm GA for image processing [23][24] [25][28].…”
Section: ) Genetic Approachesmentioning
confidence: 99%
“…Genetic approaches include work on the image as a data base of the problem by implementing several tools of Genetic Algorithm GA for image processing [23][24] [25][28].…”
Section: ) Genetic Approachesmentioning
confidence: 99%
“…The path planning methods are mainly classified into two methods, global planning method and local planning method (Sedighi et al, 2004). For the global planning method, the unmanned ground vehicle requires prior knowledge about the environment and assumes that the terrain is static.…”
Section: Introductionmentioning
confidence: 99%
“…Path planning can be classified in two categories, global and local path planning. The global type path planning is made for a static and completely known environment while the local path planning is required if the environment is dynamic (Sedighi et al, 2004). In this example, global path planning was performed.…”
Section: Path Planning Problem For Mobile Robotsmentioning
confidence: 99%