Graph-based multi-robot path finding and planning
H Ma - Current Robotics Reports, 2022 - Springer
Abstract Purpose of Review Planning collision-free paths for multiple robots is important for
real-world multi-robot systems and has been studied as an optimization problem on graphs …
real-world multi-robot systems and has been studied as an optimization problem on graphs …
[PDF][PDF] A systematic literature review of multi-agent pathfinding for maze research
Multi-agent Pathfinding, also known as MAPF, is an Artificial Intelligence problem-solving.
The aim is to direct each agent to find its path to reach its target, both individually and in …
The aim is to direct each agent to find its path to reach its target, both individually and in …
[HTML][HTML] Priority inheritance with backtracking for iterative multi-agent path finding
Abstract In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph
must reach their own respective destinations without inter-agent collisions. In practical MAPF …
must reach their own respective destinations without inter-agent collisions. In practical MAPF …
On the computational complexity of multi-agent pathfinding on directed graphs
B Nebel - Proceedings of the International Conference on …, 2020 - aaai.org
The determination of the computational complexity of multi-agent pathfinding on directed
graphs has been an open problem for many years. For undirected graphs, solvability can be …
graphs has been an open problem for many years. For undirected graphs, solvability can be …
Implicitly coordinated multi-agent path finding under destination uncertainty: Success guarantees and computational complexity
In multi-agent path finding (MAPF), it is usually assumed that planning is performed centrally
and that the destinations of the agents are common knowledge. We will drop both …
and that the destinations of the agents are common knowledge. We will drop both …
Conflict-based increasing cost search
Two popular optimal search-based solvers for the multi-agent pathfinding (MAPF) problem,
Conflict-Based Search (CBS) and Increasing Cost Tree Search (ICTS), have been extended …
Conflict-Based Search (CBS) and Increasing Cost Tree Search (ICTS), have been extended …
Multi-agent path finding on strongly connected digraphs
On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) consists in finding
paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known …
paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known …
An algorithm with improved complexity for pebble motion/multi-agent path finding on trees
The pebble motion on trees (PMT) problem consists in finding a feasible sequence of moves
that repositions a set of pebbles to assigned target vertices. This problem has been widely …
that repositions a set of pebbles to assigned target vertices. This problem has been widely …
Generalized and sub-optimal bipartite constraints for conflict-based search
The main idea of conflict-based search (CBS), a popular, state-of-the-art algorithm for multi-
agent pathfinding is to resolve conflicts between agents by systematically adding constraints …
agent pathfinding is to resolve conflicts between agents by systematically adding constraints …
Offline time-independent multi-agent path planning
This paper studies a novel planning problem for multiple agents that cannot share holding
resources, named OTIMAPP (Offline Time-Independent Multi-Agent Path Planning). Given a …
resources, named OTIMAPP (Offline Time-Independent Multi-Agent Path Planning). Given a …