1 citations · 1 across the 7 of their papers we have counts for
3 papers · 1 filter
Solving Multiagent Path Finding on Highly Centralized Networks
Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan +3
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 destin…
Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures
Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan +2
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 mean…
Exact Algorithms and Lowerbounds for Multiagent Pathfinding: Power of Treelike Topology
Foivos Fioravantes, Dušan Knop, Jan Matyáš Křišťan +2
In the Multiagent Path Finding problem (MAPF for short), we focus on efficiently finding non-colliding paths for a set of agents on a given graph , where each agent seeks a…