6 citations · 12 across the 3 of their papers we have counts for
3 papers
cs.DS2022
Fast One-to-Many Multicriteria Shortest Path Search
Temirlan Kurbanov, Marek Cuchý, Jiří Vokřínek
This paper introduces a novel algorithm combination designed for fast one-to-many multicriteria shortest path search. A preprocessing algorithm excludes irrelevant vertices by buil…
cs.RO2013★ 6 cited
Multi-agent RRT*: Sampling-based Cooperative Pathfinding (Extended Abstract)
Michal Čáp, Peter Novák, Jiří Vokřínek +1
Cooperative pathfinding is a problem of finding a set of non-conflicting trajectories for a number of mobile agents. Its applications include planning for teams of mobile robots, s…
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…