8 citations · 38 across the 11 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2014★ 8 cited
Finding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal Environment
Pavel Janovský, Michal Čáp, Jiří Vokřínek
Avoiding collisions is one of the vital tasks for systems of autonomous mobile agents. We focus on the problem of finding continuous coordinated paths for multiple mobile disc agen…
cs.AI2012★ 6 cited
Asynchronous Decentralized Algorithm for Space-Time Cooperative Pathfinding
Michal Čáp, Peter Novák, Jiří Vokřínek +1
Cooperative pathfinding is a multi-agent path planning problem where a group of vehicles searches for a corresponding set of non-conflicting space-time trajectories. Many of the pr…