A Mobile Robot Path Planning Using Genetic Algorithm in Static Environment
In this study we present our initial idea for using genetic algorithms to help a controllable mobile robot to find an optimal path between a starting and ending point in a grid environment. The mobile robot has to find the optimal path which reduces the number of steps to be taken between the starting point and the target ending point. GAs can overcome many problems encountered by traditional search techniques such as the gradient based methods. The proposed controlling algorithm allows four-neighbor movements, so that path-planning can adapt with complicated search spaces with low complexities. The results are promising.
Copyright: © 2008 Ismail AL-Taharwa, Alaa Sheta and Mohammed Al-Weshah. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 7,681 Views
- 6,335 Downloads
- 195 Citations
- Path planning
- genetic algorithms