Prohlížení Publikační činnost ČVUT dle autora "Opler M."
-
Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology
Autor: Fioravantes F.; Knop D.; Křišťan J.; Melissinos N.; Opler M.
(AAAI Press, 2024)In the Multiagent Path Finding (MAPF for short) problem, we focus on efficiently finding non-colliding paths for a set of k agents on a given graph G, where each agent seeks a path from its source vertex to a target. An ...