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

by   Jiang Jinmingwu, et al.

In cooperative pathfinding problems, no-conflicts paths that bring several agents from their start location to their destination need to be planned. This problem can be efficiently solved by Multi-agent RRT*(MA-RRT*) algorithm, which offers better scalability than the classical algorithm such as Optimal Anytime(OA) in sparse environments. However, the implementation of this algorithm is limited because the memory the algorithm required grows indefinitely as the paths get optimized. This paper proposes an improved version of the Multi-agent RRT*(MA-RRT*) algorithm, called Multi-agent RRT* Fixed Node(MA-RRT*FN), which limits the memory of the MA-RRT*. The results show that the MA-RRT*FN performs as well as the MA-RRT* while the memory required is fixed.


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

Problems that claim several agents to find no-conflicts paths from their...

Automatic Algorithm Selection In Multi-agent Pathfinding

In a multi-agent pathfinding (MAPF) problem, agents need to navigate fro...

Q-learning optimization in a multi-agents system for image segmentation

To know which operators to apply and in which order, as well as attribut...

Stability of defection, optimisation of strategies and the limits of memory in the Prisoner's Dilemma

Memory-one strategies are a set of Iterated Prisoner's Dilemma strategie...

Inferring Player Location in Sports Matches: Multi-Agent Spatial Imputation from Limited Observations

Understanding agent behaviour in Multi-Agent Systems (MAS) is an importa...

A Deep Q-Network for the Beer Game with Partial Information

The beer game is a decentralized, multi-agent, cooperative problem that ...

Multi-Agent Continuous Transportation with Online Balanced Partitioning

We introduce the concept of continuous transportation task to the contex...

Please sign up or login with your details

Forgot password? Click here to reset