A General Framework for Dynamic MAPF using Multi-Shot ASP and Tunnels
Aysu Bogatarkan, Esra Erdem

TL;DR
This paper introduces a flexible framework for solving dynamic multi-agent pathfinding problems in changing environments, using multi-shot answer set programming and a novel tunnel concept to improve planning efficiency and adaptability.
Contribution
It presents a new general definition for D-MAPF, a multi-shot ASP-based solution framework, and a novel tunnel concept to enhance dynamic path planning in real-world scenarios.
Findings
The ASP-based method effectively handles environment changes.
The tunnel concept improves planning efficiency.
Experimental results show competitive computational performance.
Abstract
MAPF problem aims to find plans for multiple agents in an environment within a given time, such that the agents do not collide with each other or obstacles. Motivated by the execution and monitoring of these plans, we study Dynamic MAPF (D-MAPF) problem, which allows changes such as agents entering/leaving the environment or obstacles being removed/moved. Considering the requirements of real-world applications in warehouses with the presence of humans, we introduce 1) a general definition for D-MAPF (applicable to variations of D-MAPF), 2) a new framework to solve D-MAPF (utilizing multi-shot computation, and allowing different methods to solve D-MAPF), and 3) a new ASP-based method to solve D-MAPF (combining advantages of replanning and repairing methods, with a novel concept of tunnels to specify where agents can move). We have illustrated the strengths and weaknesses of this method…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
