A fully distributed motion coordination strategy for multi-robot systems with local information

This paper investigates the online motion coordination problem for a group of mobile robots moving in a shared workspace. Based on the realistic assumptions that each robot is subject to both velocity and input constraints and can have only local view and local information, a fully distributed multi-robot motion coordination strategy is proposed. Building on top of a cell decomposition, a conflict detection algorithm is presented first. Then, a rule is proposed to assign dynamically a planning order to each pair of neighboring robots, which is deadlock-free. Finally, a two-step motion planning process that combines fixed-path planning and trajectory planning is designed. The effectiveness of the resulting solution is verified by a simulation example.

[1]  G. Swaminathan.  Robot Motion Planning , 2006 .

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

[3]  Christel Baier,et al.  Principles of model checking , 2008 .

[4]  Mark H. Overmars,et al.  Prioritized motion planning for multiple robots , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[6]  Wei Zhan,et al.  Speed profile planning in dynamic environments via temporal optimization , 2017, 2017 IEEE Intelligent Vehicles Symposium (IV).

[7]  Antonio Bicchi,et al.  Decentralized Cooperative Policy for Conflict Resolution in Multivehicle Systems , 2007, IEEE Transactions on Robotics.

[8]  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).

[9]  Mo Chen,et al.  Robust Sequential Trajectory Planning Under Disturbances and Adversarial Intruder , 2019, IEEE Transactions on Control Systems Technology.

[10]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[11]  Wolfram Burgard,et al.  Finding and Optimizing Solvable Priority Schemes for Decoupled Path Planning Techniques for Teams of Mobile Robots , 2002, PuK.

[12]  Jindong Tan,et al.  Distributed multi-robot coordination in area exploration , 2006, Robotics Auton. Syst..

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

[14]  Alonzo Kelly,et al.  Receding Horizon Model-Predictive Control for Mobile Robot Navigation of Intricate Paths , 2009, FSR.

[15]  Subhrajit Bhattacharya,et al.  Search-Based Path Planning with Homotopy Class Constraints in 3D , 2010, AAAI.

[16]  Aaron D. Ames,et al.  Safety Barrier Certificates for Collisions-Free Multirobot Systems , 2017, IEEE Transactions on Robotics.

[17]  George A. Bekey,et al.  AUTONOMOUS ROBOTS, From Biological Inspiration to Implementation and Control, by G.A. Bekey, MIT Press, 2005, xv + 577 pp., index, ISBN 0-262-02578-7, 25 pages of references (Hb. £35.95) , 2005, Robotica.

[18]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[19]  Thomas Bak,et al.  Planning : A Timed Automata Approach , 2004 .

[20]  Pieter Abbeel,et al.  Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization , 2013, Robotics: Science and Systems.

[21]  Anthony Stentz,et al.  Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[22]  Antonio Sala,et al.  Reactive Sliding-Mode Algorithm for Collision Avoidance in Robotic Systems , 2013, IEEE Transactions on Control Systems Technology.

[23]  Omar J. Faqir,et al.  ICLOCS2: Solve your optimal control problems with less pain , 2018 .