activity
20122023
most citedFinding Coordinated Paths for Multiple Holonomic Agents in 2-d Polygonal Environment

8 citations · 38 across the 11 of their papers we have counts for

collaborators
Showing cs.ROShow all

6 papers · 1 filter

cs.RO2016★ 1 cited

A Survey of Motion Planning and Control Techniques for Self-driving Urban Vehicles

Brian Paden, Michal Cap, Sze Zheng Yong +2

Self-driving vehicles are a maturing technology with the potential to reshape mobility by enhancing the safety, accessibility, efficiency, and convenience of automotive transportat…

cs.RO2016

Provably Safe and Deadlock-Free Execution of Multi-Robot Plans under Delaying Disturbances

Michal Čáp, Jean Gregoire, Emilio Frazzoli

One of the standing challenges in multi-robot systems is the ability to reliably coordinate motions of multiple robots in environments where the robots are subject to disturbances.…

cs.RO2015★ 1 cited

Complete Decentralized Method for On-Line Multi-Robot Trajectory Planning in Valid Infrastructures

Michal Čáp, Jiří Vokřínek, Alexander Kleiner

We consider a system consisting of multiple mobile robots in which the user can at any time issue relocation tasks ordering one of the robots to move from its current location to a…

cs.RO2014★ 3 cited

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…

cs.RO2014

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…

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…