Cellular automata-based collision-free robot path planning

This paper presents a new parallel algorithm for collision-free path planning of a diamond-shaped robot among arbitrarily-shaped obstacles and its implementation in VLSI. The proposed algorithm is based on the computational geometry concept known as the "Voronoi diagram", which is constructed through the time evolution of Cellular Automata, after an initial phase during which the boundaries of obstacles are identified and coded with respect to their orientation.

[1]  Derick Wood,et al.  Voronoi Diagrams Based on General Metrics in the Plane , 1988, STACS.

[2]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[3]  Yunhui Liu,et al.  A practical algorithm for planning collision-free coordinated motion of multiple mobile robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[4]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[6]  Thomas P. Yunck,et al.  A Technique to Identify Nearest Neighbors , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  S. Wolfram,et al.  Two-dimensional cellular automata , 1985 .

[8]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[9]  Micha Sharir,et al.  Motion planning in the presence of moving obstacles , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[10]  Nageswara S. V. Rao,et al.  The visit problem: visibility graph-based solution , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[11]  Howard C. Card,et al.  Group Properties of Cellular Automata and VLSI Applications , 1986, IEEE Transactions on Computers.