Solving Multiagent Path Finding on Highly Centralized Networks
The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set
of agents should follow inside a given network in order to reach their desired destinations as …
of agents should follow inside a given network in order to reach their desired destinations as …
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
We study the parameterized complexity of a generalization of the coordinated motion
planning problem on graphs, where the goal is to route a specified subset of a given set of …
planning problem on graphs, where the goal is to route a specified subset of a given set of …
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
Consider the scenario where multiple agents have to move in an optimal way through a
network, each one towards their ending position while avoiding collisions. By optimal, we …
network, each one towards their ending position while avoiding collisions. By optimal, we …