Flexible and Explainable Solutions for Multi-Agent Path Finding Problems

The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other, and subject to some constraints on the lengths of paths. The real-world applications of MAPF require flexibility (e.g., solving variations of MAPF) as well as explainability. In this study, both of these challenges are addressed and some flexible and explainable solutions for MAPF and its variants are introduced.

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

[2]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[3]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

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

[5]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[6]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[8]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[9]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

[10]  Jae-Yeong Lee,et al.  A coarse-to-fine approach for fast path finding for mobile robots , 2009, 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[11]  Esra Erdem,et al.  Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming , 2020, Theory and Practice of Logic Programming.

[12]  Miroslaw Truszczynski,et al.  Answer Set Programming: An Introduction to the Special Issue , 2016, AI Mag..

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

[14]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[15]  Esra Erdem,et al.  A Declarative Method for Dynamic Multi-Agent Path Finding , 2019, GCAI.

[16]  J. McCarthy.  ELABORATION TOLERANCE , 1997 .

[17]  Manfred K. Warmuth,et al.  Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable , 1986, AAAI.

[18]  Esra Erdem,et al.  Multi-modal Multi-agent Path Finding with Optimal Resource Utilization , 2020 .