Search Results for author:
Found 1 papers, 0 papers with code
Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming
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.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
