Asynchronous Decentralized Algorithm for Space-Time Cooperative Pathfinding

10/25/2012
by   Michal Čáp, et al.
0

Cooperative pathfinding is a multi-agent path planning problem where a group of vehicles searches for a corresponding set of non-conflicting space-time trajectories. Many of the practical methods for centralized solving of cooperative pathfinding problems are based on the prioritized planning strategy. However, in some domains (e.g., multi-robot teams of unmanned aerial vehicles, autonomous underwater vehicles, or unmanned ground vehicles) a decentralized approach may be more desirable than a centralized one due to communication limitations imposed by the domain and/or privacy concerns. In this paper we present an asynchronous decentralized variant of prioritized planning ADPP and its interruptible version IADPP. The algorithm exploits the inherent parallelism of distributed systems and allows for a speed up of the computation process. Unlike the synchronized planning approaches, the algorithm allows an agent to react to updates about other agents' paths immediately and invoke its local spatio-temporal path planner to find the best trajectory, as response to the other agents' choices. We provide a proof of correctness of the algorithms and experimentally evaluate them on synthetic domains.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2013

Multi-agent RRT*: Sampling-based Cooperative Pathfinding (Extended Abstract)

Cooperative pathfinding is a problem of finding a set of non-conflicting...
research
09/08/2014

Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots

An important capability of autonomous multi-robot systems is to prevent ...
research
05/23/2021

Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance

We introduce the Cooperative Multi-Agent Path Finding (Co-MAPF) problem,...
research
07/20/2017

Applying MAPP Algorithm for Cooperative Path Finding in Urban Environments

The paper considers the problem of planning a set of non-conflict trajec...
research
09/14/2023

Asynchronous Spatial Allocation Protocol for Trajectory Planning of Heterogeneous Multi-Agent Systems

To plan the trajectories of a large and heterogeneous swarm, sequential ...
research
03/07/2023

Solving Vehicle Routing Problem for unmanned heterogeneous vehicle systems using Asynchronous Multi-Agent Architecture (A-teams)

Fast moving but power hungry unmanned aerial vehicles (UAVs) can recharg...
research
06/17/2019

Heterogeneous Robot Teams for Informative Sampling

In this paper we present a cooperative multi-robot strategy to adaptivel...

Please sign up or login with your details

Forgot password? Click here to reset