Multi Agent Path Finding with Awareness for Spatially Extended Agents

by   Shyni Thomas, et al.

Path finding problems involve identification of a plan for conflict free movement of agents over a common road network. Most approaches to this problem handle the agents as point objects, wherein the size of the agent is significantly smaller than the road on which it travels. In this paper, we consider spatially extended agents which have a size comparable to the length of the road on which they travel. An optimal multi agent path finding approach for spatially-extended agents was proposed in the eXtended Conflict Based Search (XCBS) algorithm. As XCBS resolves only a pair of conflicts at a time, it results in deeper search trees in case of cascading or multiple (more than two agent) conflicts at a given location. This issue is addressed in eXtended Conflict Based Search with Awareness (XCBS-A) in which an agent uses awareness of other agents' plans to make its own plan. In this paper, we explore XCBS-A in greater detail, we theoretically prove its completeness and empirically demonstrate its performance with other algorithms in terms of variances in road characteristics, agent characteristics and plan characteristics. We demonstrate the distributive nature of the algorithm by evaluating its performance when distributed over multiple machines. XCBS-A generates a huge search space impacting its efficiency in terms of memory; to address this we propose an approach for memory-efficiency and empirically demonstrate the performance of the algorithm. The nature of XCBS-A is such that it may lead to suboptimal solutions, hence the final contribution of this paper is an enhanced approach, XCBS-Local Awareness (XCBS-LA) which we prove will be optimal and complete.


page 2

page 14


Decentralised Approach for Multi Agent Path Finding

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

STT-CBS: A Conflict-Based Search Algorithm for Multi-Agent Path Finding with Stochastic Travel Times

We address the Multi-Agent Path Finding problem on a graph for agents as...

Optimal Target Assignment and Path Finding for Teams of Agents

We study the TAPF (combined target-assignment and path-finding) problem ...

CBS-Budget (CBSB): A Complete and Bounded Suboptimal Search for Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) is the problem of finding a collection o...

Justifying and Improving Meta-Agent Conflict-Based Search

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

Subdimensional Expansion Using Attention-Based Learning For Multi-Agent Path Finding

Multi-Agent Path Finding (MAPF) finds conflict-free paths for multiple a...

MAMS-A*: Multi-Agent Multi-Scale A*

We present a multi-scale forward search algorithm for distributed agents...

Please sign up or login with your details

Forgot password? Click here to reset