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 …
Multi-agent pathfinding: Definitions, variants, and benchmarks
The multi-agent pathfinding problem (MAPF) is the fundamental problem of planning paths
for multiple agents, where the key constraint is that the agents will be able to follow these …
for multiple agents, where the key constraint is that the agents will be able to follow these …
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 …
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 …
Multi-UAV autonomous path planning in reconnaissance missions considering incomplete information: A reinforcement learning method
Y Chen, Q Dong, X Shang, Z Wu, J Wang - Drones, 2022 - mdpi.com
Unmanned aerial vehicles (UAVs) are important in reconnaissance missions because of
their flexibility and convenience. Vitally, UAVs are capable of autonomous navigation, which …
their flexibility and convenience. Vitally, UAVs are capable of autonomous navigation, which …
A multi-label A* algorithm for multi-agent pathfinding
F Grenouilleau, WJ Van Hoeve, JN Hooker - Proceedings of the …, 2019 - aaai.org
Given a set of agents, the multi-agent pathfinding problem consists in determining, for each
agent, a path from its start location to its assigned goal while avoiding collisions with other …
agent, a path from its start location to its assigned goal while avoiding collisions with other …
Multi-robot path planning with due times
We formulate the problem of multi-robot path planning with due times (MRPP-DT), which is a
variant of the classical path planning problem with task due times explicitly considered. The …
variant of the classical path planning problem with task due times explicitly considered. The …
Flatland competition 2020: MAPF and MARL for efficient train coordination on a grid world
The Flatland competition aimed at finding novel approaches to solve the vehicle re-
scheduling problem (VRSP). The VRSP is concerned with scheduling trips in traffic networks …
scheduling problem (VRSP). The VRSP is concerned with scheduling trips in traffic networks …
Multi-agent path finding with priority for cooperative automated valet parking
Shortage of parking lots has been a serious problem due to the rapid population growth in
urban areas. Cooperative Automated Valet Parking (Co-AVP) is a promising approach to …
urban areas. Cooperative Automated Valet Parking (Co-AVP) is a promising approach to …
Answer set planning: a survey
Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans,
that is, solutions to planning problems, that transform a given state of the world to another …
that is, solutions to planning problems, that transform a given state of the world to another …