6 citations · 18 across the 5 of their papers we have counts for
6 papers
Finding Near-optimal Solutions in Multi-robot Path Planning
Michal Čáp, Peter Novák, Alexander Kleiner
We deal with the problem of planning collision-free trajectories for robots operating in a shared space. Given the start and destination position for each of the robots, the task i…
Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots
Michal Čáp, Peter Novák, Alexander Kleiner +1
An important capability of autonomous multi-robot systems is to prevent collision among the individual robots. One approach to this problem is to plan conflict-free trajectories an…
On the cost-complexity of multi-context systems
Peter Novák, Cees Witteveen
Multi-context systems provide a powerful framework for modelling information-aggregation systems featuring heterogeneous reasoning components. Their execution can, however, incur n…
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…
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…
Decentralized Multi-agent Plan Repair in Dynamic Environments
Antonín Komenda, Peter Novák, Michal Pěchouček
Achieving joint objectives by teams of cooperative planning agents requires significant coordination and communication efforts. For a single-agent system facing a plan failure in a…