Iterative Refinement for Real-Time Multi-Robot Path Planning

We study the iterative refinement of path planning for multiple robots, known as multi-agent pathfinding (MAPF). Given a graph, agents, their initial locations, and destinations, a solution of MAPF is a set of paths without collisions. Iterative refinement for MAPF is desirable for three reasons: 1) optimization is intractable, 2) sub-optimal solutions can be obtained instantly, and 3) it is anytime planning, desired in online scenarios where time for deliberation is limited. Despite the high demand, this is under-explored in MAPF because finding good neighborhoods has been unclear so far. Our proposal uses a sub-optimal MAPF solver to obtain an initial solution quickly, then iterates the two procedures: 1) select a subset of agents, 2) use an optimal MAPF solver to refine paths of selected agents while keeping other paths unchanged. Since the optimal solvers are used on small instances of the problem, this scheme yields efficient-enough solutions rapidly while providing high scalability. We also present reasonable candidates on how to select a subset of agents. Evaluations in various scenarios show that the proposal is promising; the convergence is fast, scalable, and with reasonable quality.

[1]  Keisuke Otaki,et al.  Multi-Agent Path Finding with Priority for Cooperative Automated Valet Parking , 2019, 2019 IEEE Intelligent Transportation Systems Conference (ITSC).

[2]  Keisuke Okumura,et al.  winPIBT: Expanded Prioritized Algorithm for Iterative Multi-agent Path Finding , 2019, ArXiv.

[3]  Corina S. Pasareanu,et al.  Planning, Scheduling and Monitoring for Airport Surface Operations , 2016, AAAI Workshop: Planning for Hybrid Systems.

[4]  Hong Xu,et al.  Multi-Agent Path Finding with Kinematic Constraints , 2016, ICAPS.

[5]  Sven Koenig,et al.  Anytime Focal Search with Applications , 2018, IJCAI.

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

[7]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

[8]  Adi Botea,et al.  MAPP: a Scalable Multi-Agent Path Planning Algorithm with Tractability and Completeness Guarantees , 2011, J. Artif. Intell. Res..

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

[10]  Joydeep Biswas,et al.  X*: Anytime Multi-Agent Path Finding for Sparse Domains using Window-Based Iterative Repairs , 2018, Artif. Intell..

[11]  Sven Koenig,et al.  Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding , 2018, ICAPS.

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

[13]  Nicola Basilico,et al.  Intractability of Time-Optimal Multirobot Path Planning on 2D Grid Graphs with Holes , 2017, IEEE Robotics and Automation Letters.

[14]  Nathan R. Sturtevant,et al.  Conflict-based search for optimal multi-agent pathfinding , 2012, Artif. Intell..

[15]  Roni Stern,et al.  Multi-Agent Pathfinding as a Combinatorial Auction , 2015, AAAI.

[16]  Kostas E. Bekris,et al.  Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees , 2011, IJCAI.

[17]  Robert K. Brayton,et al.  Algorithms for discrete function manipulation , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[18]  Pavel Surynek,et al.  A novel approach to path planning for multiple robots in bi-connected graphs , 2009, 2009 IEEE International Conference on Robotics and Automation.

[19]  Roni Stern,et al.  Multi-Agent Path Finding - An Overview , 2019, RAAI Summer School.

[20]  Cees Witteveen,et al.  Push and rotate: cooperative multi-agent path planning , 2013, AAMAS.

[21]  Pierre Le Bodic,et al.  New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding , 2020, ICAPS.

[22]  Peter J. Stuckey,et al.  Symmetry-Breaking Constraints for Grid-Based Multi-Agent Path Finding , 2019, SOCS.

[23]  Han Zhang,et al.  Multi-Agent Path Finding with Mutex Propagation , 2020, ICAPS.

[24]  Pavel Surynek,et al.  Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[25]  Roman Barták,et al.  Online Multi-Agent Pathfinding , 2019, AAAI.

[26]  Keisuke Okumura,et al.  Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding , 2019, IJCAI.

[27]  Wheeler Ruml,et al.  EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding , 2020, AAAI.

[28]  Nathan R. Sturtevant,et al.  Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges , 2021, SOCS.

[29]  Jingjin Yu,et al.  DDM: Fast Near-Optimal Multi-Robot Path Planning Using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics , 2019, IEEE Robotics and Automation Letters.

[30]  Roni Stern,et al.  The Increasing Cost Tree Search for Optimal Multi-Agent Pathfinding , 2011, IJCAI.

[31]  Nathan R. Sturtevant,et al.  Benchmarks for Grid-Based Pathfinding , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[32]  Roni Stern,et al.  Suboptimal Variants of the Conflict-Based Search Algorithm for the Multi-Agent Pathfinding Problem , 2014, SOCS.

[33]  Peter J. Stuckey,et al.  Searching with Consistent Prioritization for Multi-Agent Path Finding , 2018, AAAI.

[34]  Peter J. Stuckey,et al.  Branch-and-Cut-and-Price for Multi-Agent Pathfinding , 2019, IJCAI.

[35]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[36]  Steven M. LaValle,et al.  Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs , 2013, AAAI.

[37]  Judea Pearl,et al.  Studies in Semi-Admissible Heuristics , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[38]  Raffaello D'Andrea,et al.  Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses , 2007, AI Mag..

[39]  Ariel Felner,et al.  Improved Heuristics for Multi-Agent Pathfinding with Conflict-Based Search∗ , 2019 .

[40]  Roman Barták,et al.  Shortening Plans by Local Re-planning , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[41]  Peter Stone,et al.  A Multiagent Approach to Autonomous Intersection Management , 2008, J. Artif. Intell. Res..

[42]  David Tolpin,et al.  ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding , 2015, SOCS.

[43]  Sven Koenig,et al.  Multi-Agent Path Finding with Payload Transfers and the Package-Exchange Robot-Routing Problem , 2016, AAAI.

[44]  Roni Stern,et al.  Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks , 2019, SOCS.

[45]  Sven Koenig,et al.  Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks , 2017, AAMAS.

[46]  Howie Choset,et al.  Subdimensional expansion for multirobot path planning , 2015, Artif. Intell..

[47]  Michal Cáp,et al.  Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots , 2014, IEEE Transactions on Automation Science and Engineering.