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 …
A Comprehensive Review on Leveraging Machine Learning for Multi-Agent Path Finding
JM Alkazzi, K Okumura - IEEE Access, 2024 - ieeexplore.ieee.org
This review paper provides an in-depth analysis of the latest advancements in applying
Machine Learning (ML) to solve the Multi-Agent Path Finding (MAPF) problem. The MAPF …
Machine Learning (ML) to solve the Multi-Agent Path Finding (MAPF) problem. The MAPF …
On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles
M Gozon, J Yu - Proceedings of the AAAI Conference on Artificial …, 2024 - ojs.aaai.org
In the 15-puzzle game, 15 labeled square tiles are reconfigured on a 4× 4 board through an
escort, wherein each (time) step, a single tile neighboring it may slide into it, leaving the …
escort, wherein each (time) step, a single tile neighboring it may slide into it, leaving the …
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity
We study a fundamental NP-hard motion coordination problem for multi-robot/multi-agent
systems: We are given a graph $ G $ and set of agents, where each agent has a given …
systems: We are given a graph $ G $ and set of agents, where each agent has a given …
Multi-robot motion planning for unit discs with revolving areas
We study the problem of motion planning for a collection of n labeled unit disc robots in a
polygonal environment. We assume that the robots have revolving areas around their start …
polygonal environment. We assume that the robots have revolving areas around their start …
The parameterized complexity of coordinated motion planning
In Coordinated Motion Planning (CMP), we are given a rectangular-grid on which $ k $
robots occupy $ k $ distinct starting gridpoints and need to reach $ k $ distinct destination …
robots occupy $ k $ distinct starting gridpoints and need to reach $ k $ distinct destination …
The small solution hypothesis for MAPF on strongly connected directed graphs is true
B Nebel - Proceedings of the International Conference on …, 2023 - ojs.aaai.org
The determination of the computational complexity of multi-agent pathfinding on directed
graphs (diMAPF) has been an open research problem for many years. While diMAPF has …
graphs (diMAPF) has been an open research problem for many years. While diMAPF has …
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
T Geft - Proceedings of the International Symposium on …, 2023 - ojs.aaai.org
Abstract Multi-Agent Path Finding (MAPF) is a fundamental motion coordination problem
arising in multi-agent systems with a wide range of applications. The problem's intractability …
arising in multi-agent systems with a wide range of applications. The problem's intractability …
Efficiently reconfiguring a connected swarm of labeled robots
When considering motion planning for a swarm of n labeled robots, we need to rearrange a
given start configuration into a desired target configuration via a sequence of parallel …
given start configuration into a desired target configuration via a sequence of parallel …
Parameterized Complexity of Efficient Sortation
A crucial challenge arising in the design of large-scale logistical networks is to optimize
parcel sortation for routing. We study this problem under the recent graph-theoretic …
parcel sortation for routing. We study this problem under the recent graph-theoretic …