A review of graph-based multi-agent pathfinding solvers: From classical to beyond classical
Multi-agent pathfinding (MAPF) is a well-studied abstract model for navigation in a multi-
robot system, where every robot finds the path to its goal position without any collision. Due …
robot system, where every robot finds the path to its goal position without any collision. Due …
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 …
MAPF-LNS2: Fast repairing for multi-agent path finding via large neighborhood search
Abstract Multi-Agent Path Finding (MAPF) is the problem of planning collision-free paths for
multiple agents in a shared environment. In this paper, we propose a novel algorithm MAPF …
multiple agents in a shared environment. In this paper, we propose a novel algorithm MAPF …
Anytime multi-agent path finding via large neighborhood search
Abstract Multi-Agent Path Finding (MAPF) is the challenging problem of computing collision-
free paths for multiple agents. Algorithms for solving MAPF can be categorized on a …
free paths for multiple agents. Algorithms for solving MAPF can be categorized on a …
Pairwise symmetry reasoning for multi-agent path finding search
Abstract Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …
Lacam: Search-based algorithm for quick multi-agent pathfinding
K Okumura - Proceedings of the AAAI Conference on Artificial …, 2023 - ojs.aaai.org
We propose a novel complete algorithm for multi-agent pathfinding (MAPF) called lazy
constraints addition search for MAPF (LaCAM). MAPF is a problem of finding collision-free …
constraints addition search for MAPF (LaCAM). MAPF is a problem of finding collision-free …
[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 …
Intersection coordination with priority-based search for autonomous vehicles
The development of connected and autonomous vehicles opens an opportunity to manage
intersections without signals. One promising approach is to use a central autonomous …
intersections without signals. One promising approach is to use a central autonomous …
Anytime multi-agent path finding via machine learning-guided large neighborhood search
Abstract Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free
paths for a team of agents in a common environment. MAPF is NP-hard to solve optimally …
paths for a team of agents in a common environment. MAPF is NP-hard to solve optimally …
Lexicographic dual-objective path finding in multi-agent systems
Z Zhao, S Li, S Liu, MC Zhou, X Li… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Path finding in multi-agent systems aims to identify collision-free and cost-optimized paths
for all agents with distinct start and goal positions. It poses challenging optimization …
for all agents with distinct start and goal positions. It poses challenging optimization …