Motion Planning for Multiple Mobile R

Abslrucl - A new motion planning framework is presented that enables multiple mobile robots with limited ranges of sensing and communication to maneuver and achieve goals safely in dynamic environments. To combine the respective advantages of centralized and de-centralized planning, this framework is based on the concept of centralized planning within dynamic robot networks. As the robots move in their environment, localized robot groups form networks, within which world models and robot goals can be shared. Whenever a network is formed, new information then becomes available to all robots in this network. With this new information, each robot uses a fast, centralized planner to compute new coordinated trajectories on the fly. Planning over several robot networks is decentralized and distributed. Both simulated and real-robot experiments have validated the approach.

[1]  Jun'ichi Takeno,et al.  Coordinating Mobile Robots By Applying Traffic Rules , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[3]  Rajeev Motwani,et al.  Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..

[4]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1998, IEEE Trans. Robotics Autom..

[5]  Günther Schmidt,et al.  Conflict-free motion of multiple mobile robots based on decentralized motion planning and negotiation , 1997, Proceedings of International Conference on Robotics and Automation.

[6]  Mark H. Overmars,et al.  Coordinated motion planning for multiple car-like robots using probabilistic roadmaps , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[7]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .

[8]  Vladimir J. Lumelsky,et al.  Decentralized Motion Planning for Multiple Mobile Robots: The Cocktail Party Model , 1997, Auton. Robots.

[9]  Jean-Claude Latombe,et al.  Using a PRM planner to compare centralized and decoupled planning for multi-robot systems , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[10]  Jun Ota,et al.  Motion Planning of Multiple Mobile Robots , 1992 .

[11]  Mark H. Overmars,et al.  Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems , 1998, Int. J. Robotics Res..

[12]  Jean-Claude Latombe,et al.  Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..

[13]  Raja Chatila,et al.  Stochastic multisensory data fusion for mobile robot location and environment modeling , 1989 .

[14]  Yi Guo,et al.  A distributed and optimal motion planning approach for multiple mobile robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[15]  John F. Canny,et al.  A motion planner for multiple mobile robots , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[16]  Jean-Claude Latombe,et al.  Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.

[17]  Jean-Claude Latombe,et al.  On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination , 2002, Int. J. Robotics Res..

[18]  Stephen M. Rock,et al.  Dynamic Networks for Motion Planning in Multi-Robot Space Systems , 2003 .

[19]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 2005, Algorithmica.

[20]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[21]  Rachid Alami,et al.  Multi-robot cooperation through incremental plan-merging , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[22]  Stephen M. Rock,et al.  Randomized Motion Planning for Groups of Nonholonomic Robots , 2001 .