4 accepted papers
Sampling-based motion planners rely on incre-mental densification to discover progressively shorter paths. After computing feasible path \xi\xi between start x_{s}x_{s} and goal x_{t}x_{t}, the Informed Set (IS) prunes the configuration space \mathcal{X}\mathcal{X} by conservatively eliminating poin…
Collision checking is a computational bottleneck in motion planning, requiring lazy algorithms that explicitly reason about when to perform this computation. Optimism in the face of collision uncertainty minimizes the number of checks before finding the shortest path. However, this may take a prohib…
Addressing uncertainty is critical for autonomous systems to robustly adapt to the real world. We formulate the problem of model uncertainty as a continuous Bayes-Adaptive Markov Decision Process (BAMDP), where an agent maintains a posterior distribution over latent model parameters given a history…
We consider the problem of leveraging prior experience to generate roadmaps in sampling-based motion planning. A desirable roadmap is one that is sparse, allowing for fast search, with nodes spread out at key locations such that a low- cost feasible path exists. An increasingly popular approach is t…