A Competitive Analysis of Online Multi-Agent Path Finding

We study online Multi-Agent Path Finding (MAPF), where new agents are constantly revealed over time and all agents must find collision-free paths to their given goal locations. We generalize existing complexity results of (offline) MAPF to online MAPF. We classify online MAPF algorithms into different categories based on (1) controllability (the set of agents that they can plan paths for at each time) and (2) rationality (the quality of paths they plan) and study the relationships between them. We perform a competitive analysis for each category of online MAPF algorithms with respect to commonlyused objective functions. We show that a naive algorithm that routes newly-revealed agents one at a time in sequence achieves a competitive ratio that is asymptotically bounded from both below and above by the number of agents with respect to flowtime and makespan. We then show a counterintuitive result that, if rerouting of previously-revealed agents is not allowed, any rational online MAPF algorithms, including ones that plan optimal paths for all newly-revealed agents, have the same asymptotic competitive ratio as the naive algorithm, even on 2D 4-neighbor grids. We also derive constant lower bounds on the competitive ratio of any rational online MAPF algorithms that allow rerouting. The results thus provide theoretical insights into the effectiveness of using MAPF algorithms in an online setting for the first time.

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

[2]  Peter J. Stuckey,et al.  New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding , 2020, ICAPS.

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

[4]  Pavel Surynek,et al.  An Optimization Variant of Multi-Robot Path Planning Is Intractable , 2010, AAAI.

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

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

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

[8]  Sven Koenig,et al.  Multi-Agent Path Finding with Deadlines: Preliminary Results , 2018, IJCAI.

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

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

[11]  Marc Cavazza,et al.  Decentralized Multi-Agent Path Finding for UAV Traffic Management , 2019, IEEE Transactions on Intelligent Transportation Systems.

[12]  Roni Stern,et al.  Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems , 2020, AAMAS.

[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]  Peter J. Stuckey,et al.  Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation , 2019, ICAPS.

[15]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[16]  Peter J. Stuckey,et al.  Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge , 2021, ICAPS.

[17]  Sven Koenig,et al.  AI buzzwords explained: multi-agent path finding (MAPF) , 2017, SIGAI.

[18]  T. K. Satish Kumar,et al.  Idle Time Optimization for Target Assignment and Path Finding in Sortation Centers , 2019, AAAI.

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

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

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

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

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

[24]  Roni Stern,et al.  Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective , 2016, ECAI.

[25]  Sven Koenig,et al.  Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments , 2017, AIIDE.

[26]  Jingjin Yu,et al.  Intractability of Optimal Multirobot Path Planning on Planar Graphs , 2015, IEEE Robotics and Automation Letters.

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

[28]  Peter Schüller,et al.  A General Formal Framework for Pathfinding Problems with Multiple Agents , 2013, AAAI.

[29]  Craig A. Tovey,et al.  A simplified NP-complete satisfiability problem , 1984, Discret. Appl. Math..

[30]  Maxim Likhachev,et al.  SIPP: Safe interval path planning for dynamic environments , 2011, 2011 IEEE International Conference on Robotics and Automation.

[31]  Chaitanya Swamy,et al.  Minimizing Latency in Online Ride and Delivery Services , 2018, WWW.

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

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

[34]  Sven Koenig,et al.  Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery , 2018, AAAI.

[35]  Steven M. LaValle,et al.  Planning optimal paths for multiple robots on graphs , 2012, 2013 IEEE International Conference on Robotics and Automation.

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

[37]  Peter J. Stuckey,et al.  Disjoint splitting for conflict-based search for Multi-Agent Path Finding , 2019 .

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