Decentralised Approach for Multi Agent Path Finding

by   Shyni Thomas, et al.

Multi Agent Path Finding (MAPF) requires identification of conflict free paths for agents which could be point-sized or with dimensions. In this paper, we propose an approach for MAPF for spatially-extended agents. These find application in real world problems like Convoy Movement Problem, Train Scheduling etc. Our proposed approach, Decentralised Multi Agent Path Finding (DeMAPF), handles MAPF as a sequence of pathplanning and allocation problems which are solved by two sets of agents Travellers and Routers respectively, over multiple iterations. The approach being decentralised allows an agent to solve the problem pertinent to itself, without being aware of other agents in the same set. This allows the agents to be executed on independent machines, thereby leading to scalability to handle large sized problems. We prove, by comparison with other distributed approaches, that the approach leads to a faster convergence to a conflict-free solution, which may be suboptimal, with lesser memory requirement.


page 1

page 2

page 3

page 4


Multi Agent Path Finding with Awareness for Spatially Extended Agents

Path finding problems involve identification of a plan for conflict free...

MS*: A New Exact Algorithm for Multi-agent Simultaneous Multi-goal Sequencing and Path Finding

In multi-agent applications such as surveillance and logistics, fleets o...

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

Symmetry Breaking for k-Robust Multi-Agent Path Finding

During Multi-Agent Path Finding (MAPF) problems, agents can be delayed b...

DMAPF: A Decentralized and Distributed Solver for Multi-Agent Path Finding Problem with Obstacles

Multi-Agent Path Finding (MAPF) is a problem of finding a sequence of mo...

Train Unit Shunting and Servicing: a Real-Life Application of Multi-Agent Path Finding

In between transportation services, trains are parked and maintained at ...

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