A General Framework for Dynamic MAPF using Multi-Shot ASP and Tunnels

Aysu Bogatarkan, Esra Erdem
7/28/2025
cs.AI

No confident code implementation found for this paper.

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 by experimental evaluations, from the perspectives of computational performance and quality of solutions.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Transient Multi-Agent Path Finding for Lifelong Navigation in Dense Environments

82% match2024

Multi-Agent Target Assignment and Path Finding for Intelligent Warehouse: A Cooperative Multi-Agent Deep Reinforcement Learning Perspective

82% match2024

Loosely Synchronized Rule-Based Planning for Multi-Agent Path Finding with Asynchronous Actions

80% match1 repo82024

CREST: Constraint-Release Execution for Multi-Robot Warehouse Shelf Rearrangement

80% match1 repo22026

Caching-Augmented Lifelong Multi-Agent Path Finding

79% match1 repo62024

Symbolic Planning and Multi-Agent Path Finding in Extremely Dense Environments with Unassigned Agents

79% match2025

Cite this paper

@article{bogatarkan2025general,
  title  = {A General Framework for Dynamic MAPF using Multi-Shot ASP and Tunnels},
  author = {Aysu Bogatarkan and Esra Erdem},
  year   = {2025},
  eprint = {2507.20703},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.20703v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.20703.svg)](https://codeofpaper.com/paper/2507.20703)

Discussion