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 …
Lifelong multi-agent path finding in large-scale warehouses
Abstract Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their
goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where …
goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where …
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 …
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 …
Multi-robot path deconfliction through prioritization by path prospects
W Wu, S Bhattacharya, A Prorok - 2020 IEEE international …, 2020 - ieeexplore.ieee.org
This work deals with the problem of planning conflict-free paths for mobile robots in cluttered
environments. Since centralized, coupled planning algorithms are computationally …
environments. Since centralized, coupled planning algorithms are computationally …
Learning team-based navigation: a review of deep reinforcement learning techniques for multi-agent pathfinding
Multi-agent pathfinding (MAPF) is a critical field in many large-scale robotic applications,
often being the fundamental step in multi-agent systems. The increasing complexity of MAPF …
often being the fundamental step in multi-agent systems. The increasing complexity of MAPF …
Improving lacam for scalable eventually optimal multi-agent pathfinding
K Okumura - arXiv preprint arXiv:2305.03632, 2023 - arxiv.org
This study extends the recently-developed LaCAM algorithm for multi-agent pathfinding
(MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor …
(MAPF). LaCAM is a sub-optimal search-based algorithm that uses lazy successor …
Ddm: Fast near-optimal multi-robot path planning using diversified-path and optimal sub-problem solution database heuristics
We propose a novel centralized and decoupled algorithm, DDM, for solving multi-robot path
planning problems in grid graphs, targeting on-demand and automated warehouse-like …
planning problems in grid graphs, targeting on-demand and automated warehouse-like …
Double-deck multi-agent pickup and delivery: Multi-robot rearrangement in large-scale warehouses
B Li, H Ma - IEEE Robotics and Automation Letters, 2023 - ieeexplore.ieee.org
We introduce a new problem formulation, Double-Deck Multi-Agent Pickup and Delivery (DD-
MAPD), which models the multi-robot shelf rearrangement problem in automated …
MAPD), which models the multi-robot shelf rearrangement problem in automated …