Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
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…
cs.CC2025
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…