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

Basem Atiq
Basem Atiq

international conference on lightning protection, pp. 223-229, 2020.

Cited by: 0|Views4

Abstract:

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 fo...More

Code:

Data:

Your rating :
0

 

Tags
Comments