Asynchronous decentralized prioritized planning for coordination in multi-robot system

In this paper, the multi-robot motion coordination planning problem is addressed. Although a centralized prioritized planning strategy can be used to solve the problem, we rather consider a decentralized variant, which is a more suitable for a robotic system of cooperating unmanned aerial vehicles (UAVs) due to communication limitations, privacy concerns, and a better exploitation of computational resources distributed among the individual robots. However, the existing decentralized prioritized planning algorithm contains synchronization points that all the agents must be able to pass synchronously, which is impractical and inefficient for a real-world deployment of the robotic systems. Therefore, we introduce a new asynchronous decentralized prioritized planning algorithm and show that the method can converge faster than both the synchronous decentralized and centralized algorithms. Further, we demonstrate the applicability of the proposed method as a coordination mechanism within a complex mission planning for a real robotic system consisting of several autonomous UAVs.

[1]  Tomás Lozano-Pérez,et al.  On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

[2]  Kristi A. Morgansen,et al.  Distributed reactive collision avoidance , 2012, Autonomous Robots.

[3]  E. J.,et al.  ON THE COMPLEXITY OF MOTION PLANNING FOR MULTIPLE INDEPENDENT OBJECTS ; PSPACE HARDNESS OF THE " WAREHOUSEMAN ' S PROBLEM " . * * ) , 2022 .

[4]  Michal Pechoucek,et al.  Mixed-reality testbeds for incremental development of HART applications , 2012, IEEE Intelligent Systems.

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

[6]  Prasanna Velagapudi,et al.  Decentralized prioritized planning in large multirobot teams , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Mirella Lapata,et al.  Proceedings of the National Conference on Artificial Intelligence , 2011 .

[8]  Maxim Likhachev,et al.  D*lite , 2002, AAAI/IAAI.

[9]  Trevor Scott Standley.  Finding Optimal Solutions to Cooperative Pathfinding Problems , 2010, AAAI.

[10]  Jun Ota,et al.  Multirobot motion coordination in space and time , 1998, Robotics Auton. Syst..

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

[12]  Peter Novák,et al.  Towards Incremental Development of Human-Agent-Robot Applications using Mixed-Reality Testbeds , 2012 .

[13]  Dinesh Manocha,et al.  Reciprocal n-Body Collision Avoidance , 2011, ISRR.

[14]  David Silver,et al.  Cooperative Pathfinding , 2005, AIIDE.

[15]  Friedemann Mattern,et al.  Algorithms for distributed termination detection , 1987, Distributed Computing.

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

[17]  Milan Rollo,et al.  Deployment of multi-agent algorithms for tactical operations on UAV hardware , 2013, AAMAS.

[18]  Richard E. Korf,et al.  Complete Algorithms for Cooperative Pathfinding Problems , 2011, IJCAI.

[19]  Mark H. Overmars,et al.  Kinodynamic motion planning on roadmaps in dynamic environments , 2007, 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[21]  Michal Pechoucek,et al.  Asynchronous Decentralized Algorithm for Space-Time Cooperative Pathfinding , 2012, ArXiv.

[22]  Maxim Likhachev,et al.  Anytime Safe Interval Path Planning for dynamic environments , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.