Computing Pareto Optimal Coordinations on Roadmaps

We consider the coordination of multiple robots in a common environment, each robot having its own (distinct) roadmap. Our primary contribution is a classification of and exact algorithm for computing vector-valued (or Pareto) optima for collision-free coordination. We indicate the utility of new geometric techniques from CAT(0) geometry and give an argument that curvature bounds are the key distinguishing feature between systems for which the classification is finite and for those in which it is not.

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

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

[3]  Junming Xu,et al.  Theory and Application of Graphs , 2003, Network Theory and Applications.

[4]  Seth Hutchinson,et al.  Coordinating the motions of multiple robots with specified trajectories , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

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

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

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

[8]  Rufus Isaacs,et al.  Differential Games , 1965 .

[9]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[10]  A. O. Houcine.  On hyperbolic groups , 2006 .

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

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

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

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

[15]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

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

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

[18]  Srinivas Akella,et al.  Coordinating Multiple Robots with Kinodynamic Constraints Along Specified Paths , 2005, Int. J. Robotics Res..

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

[20]  M. Bridson,et al.  Metric Spaces of Non-Positive Curvature , 1999 .

[21]  Joseph S. B. Mitchell,et al.  New results on shortest paths in three dimensions , 2004, SCG '04.

[22]  R. Ho.  Algebraic Topology , 2022 .

[23]  Sampath Kannan,et al.  Randomized pursuit-evasion with limited visibility , 2004, SODA '04.

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

[25]  Harri Ehtamo,et al.  Differential Games — Developments in Modelling and Computation , 1991 .

[26]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

[27]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[28]  Jean-Daniel Boissonnat,et al.  Algorithmic Foundations of Robotics V, Selected Contributions of the Fifth International Workshop on the Algorithmic Foundations of Robotics, WAFR 2002, Nice, France, December 15-17, 2002 , 2004, WAFR.

[29]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[30]  Robert Ghrist,et al.  State Complexes for Metamorphic Robots , 2004, Int. J. Robotics Res..

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

[32]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

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

[34]  Steven M. LaValle,et al.  Nonpositive Curvature and Pareto Optimal Coordination of Robots , 2006, SIAM J. Control. Optim..

[35]  Leonidas J. Guibas,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.

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

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

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

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

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

[41]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

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

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

[44]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

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

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