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 …
Eecbs: A bounded-suboptimal search for multi-agent path finding
Abstract Multi-Agent Path Finding (MAPF), ie, finding collision-free paths for multiple robots,
is important for many applications where small runtimes are necessary, including the kind of …
is important for many applications where small runtimes are necessary, including the kind of …
PRIMAL: Pathfinding Via Reinforcement and Imitation Multi-Agent Learning - Lifelong
Multi-agent path finding (MAPF) is an indispensable component of large-scale robot
deployments in numerous domains ranging from airport management to warehouse …
deployments in numerous domains ranging from airport management to warehouse …
Multi-agent pathfinding with continuous time
Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that each agent reaches its goal and the agents do not collide. In recent years, variants …
such that each agent reaches its goal and the agents do not collide. In recent years, variants …
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 …
Scalable rail planning and replanning: Winning the 2020 flatland challenge
Abstract Multi-Agent Path Finding (MAPF) is the combinatorial problem of finding collision-
free paths for multiple agents on a graph. This paper describes MAPF-based software for …
free paths for multiple agents on a graph. This paper describes MAPF-based software for …
Intelligent planning for large-scale multi-agent systems
H Ma - AI Magazine, 2022 - ojs.aaai.org
This article summarizes the New Faculty Highlights talk with the same title at AAAI 2021.
Intelligent agents such as different types of robots will soon become an integral part of our …
Intelligent agents such as different types of robots will soon become an integral part of our …
SCRIMP: Scalable communication for reinforcement-and imitation-learning-based multi-agent pathfinding
Y Wang, B Xiang, S Huang… - 2023 IEEE/RSJ …, 2023 - ieeexplore.ieee.org
Trading off performance guarantees in favor of scalability, the Multi-Agent Path Finding
(MAPF) community has recently started to embrace Multi-Agent Reinforcement Learning …
(MAPF) community has recently started to embrace Multi-Agent Reinforcement Learning …