Pareto Optimal Coordination on Roadmaps

Given a collection of robots sharing a common environment, assume that each possesses an individual roadmap for its C-space and a cost function for attaining a goal. Vector-valued (or Pareto) optima for collision-free coordination are by no means unique: in fact, continua of optimal coordinations are possible. However, for cylindrical obstacles (those defined by pairwise interactions), we prove a finite bound on the number of optimal coordinations. For such systems, we present an exact subquadratic algorithm for reducing a coordination scheme to its Pareto optimal representative.

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

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

[3]  J. Schwartz,et al.  On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .

[4]  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.

[5]  Hirotaka Nakayama,et al.  Theory of Multiobjective Optimization , 1985 .

[6]  Myung Jin Chung,et al.  Collision avoidance of two general robot manipulators by minimum delay time , 1994, IEEE Trans. Syst. Man Cybern..

[7]  J. Canny,et al.  Lower Bounds for Shortest Path and Related Problems , 1987 .

[8]  Jason M. O'Kane,et al.  Exact Pareto-optimal coordination of two translating polygonal robots on an acyclic roadmap , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[9]  Thierry Siméon,et al.  Path coordination for multiple mobile robots: a resolution-complete algorithm , 2002, IEEE Trans. Robotics Autom..

[10]  Jihong Lee,et al.  A minimum-time trajectory planning method for two robots , 1992, IEEE Trans. Robotics Autom..

[11]  Jean-Claude Latombe,et al.  Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..

[12]  Steven M. LaValle,et al.  Path selection and coordination for multiple robots via Nash equilibria , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[13]  Graham A. Niblo,et al.  The geometry of cube complexes and the complexity of their fundamental groups , 1998 .

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

[15]  Leonidas J. Guibas,et al.  Ray Shooting in Polygons Using Geodesic Triangulations , 1991, ICALP.

[16]  Penny Probert Smith,et al.  Coping with uncertainty in control and planning for a mobile robot , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[17]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[18]  Yoshiaki Shirai,et al.  Planning of vision and motion for a mobile robot using a probabilistic model of uncertainty , 1991, Proceedings IROS '91:IEEE/RSJ International Workshop on Intelligent Robots and Systems '91.

[19]  M. D. Ardema,et al.  Dynamic game applied to coordination control of two arm robotic system , 1991 .

[20]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[21]  Kang G. Shin,et al.  A variational dynamic programming approach to robot-path planning with a distance-safety criterion , 1988, IEEE J. Robotics Autom..

[22]  Lynne E. Parker.  Cooperative motion control for multi-target observation , 1997, Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97.

[23]  Tomás Lozano-Pérez,et al.  Deadlock-free and collision-free coordination of two robot manipulators , 1989, Proceedings, 1989 International Conference on Robotics and Automation.