Planning multi-paths using speciation in genetic algorithms

A path planning algorithm is developed based on a minimal representation size cluster genetic algorithm (MRSC GA). The algorithm utilizes evolutionary computation techniques for planning paths for mobile robots, piano-movers problems and N-link manipulators. MRSC GA is used for generating multi-paths to provide alternative solutions to the path planning problem. The generation of alternative solutions is especially important for planning paths in dynamic environments. A novel iterative multi-resolution path representation is used as a basis for the GA coding. The effectiveness of the algorithm is demonstrated on a number of 2D path planning problems.

[1]  Zbigniew Michalewicz,et al.  Evolutionary navigator for a mobile robot , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[2]  Takanori Shibata,et al.  Intelligent motion planning by genetic algorithm with fuzzy critic , 1993, Proceedings of 8th IEEE International Symposium on Intelligent Control.

[3]  El-Ghazali Talbi,et al.  The "Ariadne's clew" algorithm: global planning with local methods , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[4]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[5]  Ronald C. Arkin,et al.  Using Genetic Algorithms to Learn Reactive Control Parameters for Autonomous Robotic Navigation , 1994, Adapt. Behav..

[6]  Andrei N. Kolmogorov,et al.  Logical basis for information theory and probability theory , 1968, IEEE Trans. Inf. Theory.

[7]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[8]  Kalyanmoy Deb,et al.  An Investigation of Niche and Species Formation in Genetic Function Optimization , 1989, ICGA.

[9]  Ray J. Solomonoff,et al.  A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[10]  Arthur C. Sanderson,et al.  Attributed image matching using a minimum representation size criterion , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[11]  Arthur C. Sanderson,et al.  Evolutionary Speciation Using Minimal Representation Size Clustering , 1995, Evolutionary Programming.