Applying MAPP Algorithm for Cooperative Path Finding in Urban Environments

07/20/2017
by   Anton Andreychuk, et al.
0

The paper considers the problem of planning a set of non-conflict trajectories for the coalition of intelligent agents (mobile robots). Two divergent approaches, e.g. centralized and decentralized, are surveyed and analyzed. Decentralized planner - MAPP is described and applied to the task of finding trajectories for dozens UAVs performing nap-of-the-earth flight in urban environments. Results of the experimental studies provide an opportunity to claim that MAPP is a highly efficient planner for solving considered types of tasks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2020

MADER: Trajectory Planner in Multi-Agent and Dynamic Environments

This paper presents MADER, a 3D decentralized and asynchronous trajector...
research
07/01/2022

Conflict-based Search for Multi-Robot Motion Planning with Kinodynamic Constraints

Multi-robot motion planning (MRMP) is the fundamental problem of finding...
research
10/25/2012

Asynchronous Decentralized Algorithm for Space-Time Cooperative Pathfinding

Cooperative pathfinding is a multi-agent path planning problem where a g...
research
08/06/2019

Multi-Robot Path Deconfliction through Prioritization by Path Prospects

This work deals with the problem of planning conflict-free paths for mob...
research
12/13/2021

Multi-agent Soft Actor-Critic Based Hybrid Motion Planner for Mobile Robots

In this paper, a novel hybrid multi-robot motion planner that can be app...
research
02/14/2021

Urban Metric Maps for Small Unmanned Aircraft Systems Motion Planning

Low-altitude urban flight planning for small Unmanned Aircraft Systems (...
research
09/19/2022

D2CoPlan: A Differentiable Decentralized Planner for Multi-Robot Coverage

Centralized approaches for multi-robot coverage planning problems suffer...

Please sign up or login with your details

Forgot password? Click here to reset