Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming

by   Basem Atiq, et al.

We study a dynamic version of multi-agent path finding problem (called D-MAPF) where existing agents may leave and new agents may join the team at different times. We introduce a new method to solve D-MAPF based on conflict-resolution. The idea is, when a set of new agents joins the team and there are conflicts, instead of replanning for the whole team, to replan only for a minimal subset of agents whose plans conflict with each other. We utilize answer set programming as part of our method for planning, replanning and identifying minimal set of conflicts.


page 1

page 2

page 3

page 4


Conflict-Based Search for Connected Multi-Agent Path Finding

We study a variant of the multi-agent path finding problem (MAPF) in whi...

Decentralised Approach for Multi Agent Path Finding

Multi Agent Path Finding (MAPF) requires identification of conflict free...

Justifying and Improving Meta-Agent Conflict-Based Search

The Meta-Agent Conflict-Based Search (MA-CBS) is a recently proposed alg...

Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming

The multi-agent path finding (MAPF) problem is a combinatorial search pr...

Searching with Consistent Prioritization for Multi-Agent Path Finding

We study prioritized planning for Multi-Agent Path Finding (MAPF). Exist...

Multi-Agent Neural Rewriter for Vehicle Routing with Limited Disclosure of Costs

We interpret solving the multi-vehicle routing problem as a team Markov ...

A Conflict-Based Path-Generation Heuristic for Evacuation Planning

Evacuation planning and scheduling is a critical aspect of disaster mana...