Path planning using genetic algorithms for mini-robotic tasks

We present a genetic algorithm-based method to optimize trajectory planning for mini-robotic tasks. Codifying a number of motion primitive parameters into computational chromosomes does this. Each trajectory is composed of a fixed number N of straight segments. We search with a genetic algorithm the length and direction parameters of the N path segments that let us to arrive a target position from the current robot position. We show design choices of the genetic operators (selection, mutation and fitness function) used in our genetic algorithm implementation. We present simulations of our method and experimentation on a mini-robotic platform is implemented.

[1]  Zbigniew Michalewicz,et al.  Adaptive evolutionary planner/navigator for mobile robots , 1997, IEEE Trans. Evol. Comput..

[2]  Bernd Reusch Computational Intelligence, Theory and Applications , 1997 .

[3]  El-Ghazali Talbi,et al.  Using Genetic Algorithms for Robot Motion Planning , 1991, Geometric Reasoning for Perception and Action.

[4]  M. Gerke,et al.  Genetic path planning for mobile robots , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[5]  Peter Wide,et al.  Implementation of a genetic algorithm for routing an autonomous robot , 1997, Robotica.

[6]  Hideki Hashimoto,et al.  Position estimation for mobile robot using sensor fusion , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.