We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
Hamid Reza Chitsaz, Steven M. LaValle, Jason M. O'...
— We introduce a hierarchical variant of the probabilistic roadmap method for motion planning. By recursively refining an initially sparse sampling in neighborhoods of the C-obs...
Abstract— We address the problem of vision-based multiperson tracking in busy pedestrian zones using a stereo rig mounted on a mobile platform. Specifically, we are interested i...
Andreas Ess, Bastian Leibe, Konrad Schindler, Luc ...
— A novel criterion is introduced for assessing the diversity of a collection of paths or trajectories. The main idea is the notion of survivability, which measures the likelihoo...