Any-com collision checking: Sharing certificates in decentralized multi-robot teams

We present an any-com algorithm that enables a decentralized team of robots to share the work of collision checking while each robot independently calculates its own motion plan. In our method “safety-certificates” (i.e., bounds on the collision-free subspace around each collision-checked point [1]), are shared among the team so that all robots can benefit from their encoded knowledge. Future points drawn from within a certificate are guaranteed to be safe; therefore, sharing certificates among team members reduces collision checking for all robots. Experiments demonstrate that our algorithm scales well vs. both team size and vs. communication quality.

[1]  Nancy M. Amato,et al.  Using motion planning to study protein folding pathways , 2001, J. Comput. Biol..

[2]  Panagiotis Tsiotras,et al.  Use of relaxation methods in sampling-based algorithms for optimal motion planning , 2013, 2013 IEEE International Conference on Robotics and Automation.

[3]  Emilio Frazzoli,et al.  Efficient Collision Checking in Sampling-Based Motion Planning , 2012, WAFR.

[4]  Nikolaus Correll,et al.  Any-Com Multi-robot Path-Planning: Maximizing Collaboration for Variable Bandwidth , 2010, DARS.

[5]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[6]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[7]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[8]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[9]  Nikolaus Correll,et al.  Any-Com Multi-robot Path-Planning with Dynamic Teams: Multi-robot Coordination under Communication Constraints , 2010, ISER.

[10]  Emilio Frazzoli,et al.  Fast Collision Checking: From Single Robots to Multi-Robot Teams , 2013, ArXiv.

[11]  Dinesh Manocha,et al.  GPU-based parallel collision detection for fast motion planning , 2012, Int. J. Robotics Res..

[12]  Nikolaus Correll,et al.  Any-com multi-robot path planning , 2011 .

[13]  Dinesh Manocha,et al.  FCL: A general purpose library for collision and proximity queries , 2012, 2012 IEEE International Conference on Robotics and Automation.

[14]  Thierry Siméon,et al.  A path planning approach for computing large-amplitude motions of flexible molecules , 2005, ISMB.

[15]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[16]  Dinesh Manocha,et al.  Collision and Proximity Queries , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[17]  Jean-Claude Latombe,et al.  Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts , 1999, Int. J. Robotics Res..

[18]  Carme Torras,et al.  3D collision detection: a survey , 2001, Comput. Graph..