Abstract— The Rapidly-exploring Random Tree (RRT) algorithm has found widespread use in the field of robot motion planning because it provides a single-shot, probabilistically c...
Matthew Zucker, James J. Kuffner, Michael S. Brani...
Recent research has demonstrated that useful POMDP solutions do not require consideration of the entire belief space. We extend this idea with the notion of temporal abstraction. ...
Abstract— We present the Constrained Bi-directional RapidlyExploring Random Tree (CBiRRT) algorithm for planning paths in configuration spaces with multiple constraints. This al...
Dmitry Berenson, Siddhartha S. Srinivasa, Dave Fer...
— 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...
Whenever people move through their environments they do not move randomly. Instead, they usually follow specific trajectories or motion patterns corresponding to their intentions....
Grzegorz Cielniak, Maren Bennewitz, Wolfram Burgar...