A motion planner for multiple mobile robots

An algorithm is described for planning the motions of several mobile robots which share the same workspace. Each robot is capable of independent translational motion in two dimensions, and the workspace contains polygonal obstacles. The algorithm computes a path for each robot which avoids all obstacles in the workspace as well as the other robots. It is guaranteed to find a solution if one exists. The algorithm takes a cell decomposition approach, where the decomposition used is based on the idea of a product operation defined on the cells in a decomposition of a two-dimensional free space. This algorithm is being implemented for the case of two robots as part of ongoing research into useful algorithms for task-level programming of the RobotWorld system.<<ETX>>

[1]  Sue Whitesides,et al.  Computational Geometry and Motion Planning , 1985 .

[2]  Micha Sharir,et al.  Coordinated motion planning for two independent robots , 1991, SCG '88.

[3]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[4]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[5]  Victor Scheinman.  Robotworld: a multiple robot vision guided assembly system , 1988 .

[6]  Stephen J. Buckley,et al.  Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

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

[8]  Jean-Claude Latombe,et al.  Robot motion planning with many degrees of freedom and dynamic constraints , 1991 .

[9]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[10]  Micha Sharir,et al.  Algorithmic motion planning in robotics , 1991, Computer.

[11]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

[12]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[13]  Micha Sharir,et al.  Retraction: A new approach to motion-planning , 1983, STOC.