Cooperative Pathfinding based on high-scalability Multi-agent RRT*

11/16/2019
by   Jinmingwu Jiang, et al.
0

Problems that claim several agents to find no-conflicts paths from their start locations to their destinations are named as cooperative pathfinding problems. This problem can be efficiently solved by the Multi-agent RRT*(MA-RRT*) algorithm, which offers better scalability than some traditional algorithms, such as Optimal Anytime(OA), in sparse environments. However, MA-RRT* cannot effectively find solutions in relatively dense environments, cause some random samples in the free space cannot be explored by the rapidly random tree, which hinders the application of MA-RRT* in a more complicated real-world. This paper proposes an improved version of MA-RRT *, called Multi-agent RRT* Potential Field (MA-RRT*PF), an anytime algorithm that can efficiently guide the rapidly random tree to the free space in relatively dense environments. It works by incorporating a potential field to the GREEDY function to enhance the ability to avoid the obstacles. The results show that MA-RRT*PF performs much better than MA-RRT* in relatively dense environments in terms of scalability while still maintaining the solution quality.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2019

Cooperative Pathfinding based on memory-efficient Multi-agent RRT*

In cooperative pathfinding problems, no-conflicts paths that bring sever...
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
05/25/2022

Deadlock-Free Method for Multi-Agent Pickup and Delivery Problem Using Priority Inheritance with Temporary Priority

This paper proposes a control method for the multi-agent pickup and deli...
research
06/10/2019

Automatic Algorithm Selection In Multi-agent Pathfinding

In a multi-agent pathfinding (MAPF) problem, agents need to navigate fro...
research
01/24/2022

CTRMs: Learning to Construct Cooperative Timed Roadmaps for Multi-agent Path Planning in Continuous Spaces

Multi-agent path planning (MAPP) in continuous spaces is a challenging p...
research
08/17/2020

Multi-Agent Coverage in Urban Environments

We study multi-agent coverage algorithms for autonomous monitoring and p...
research
02/20/2023

An application-oriented scheduler

We consider a multi-agent system where agents compete for the access to ...

Please sign up or login with your details

Forgot password? Click here to reset