Author : Basavanna M 1
Date of Publication :7th May 2016
Abstract: Determination of a collision free path for a mobile robot between start and goal points through obstacles in a workspace is important to the design of an autonomous robot path planning. One way to make sure the robot’s path is the best path for the given environment is by making use of various path planning algorithms. In this paper we use a genetic algorithm approach to solve the path planning problem. The obstacle free path is chosen such that the robot avoids all the obstacles in its path and finds the shortest path. Then the Processing Time and Path Length for the given workspace is obtained. The results obtained for genetic algorithm are compared with the results obtained for the same workspace using other two algorithms such as A – Star and Bidirectional RRT Algorithm.
Reference :
-
- Nasser sadati and javidtaheri, “genetic algorithm in robot path planning problem in crisp and fuzzified environments”, intelligent systems laboratory electrical engineering department sharif university of technology.
- Zhanying zhang1 and ziping zhao2, “a multiple mobile robots path planning algorithm based on a-star and dijkstra algorithm”, 1,2 college of computer and information engineering, tianjin normal university, tianjin 300387, china .
- Georges s. Aoude, jonathan p. How and ian m. Garcia, “two-stage path planning approach for designing multiple spacecraft reconfiguration maneuvers”.
- N. Sariff and n. Buniyamin, “an overview of autonomous mobile robot path planning algorithms”, 4th student conference on research and development (scored 2006), june 20061-4244-0527-0/06/$20.00 © 2006 ieee.
- O.khatib, “real time obstacle avoidance for manipulators and mobile robots,” in international journal of robotics research, 5(10):90-98, spring 1986. [6] Christophniederberger,ejanradovie, and markus gross, “generic path planning for real time application,” in proceedings of the computer graphics international (cgi 04), 2004, pp 1-8.