ICRA 2011 Paper Abstract


Paper TuA1-InteracInterac.43

Bry, Adam (Massachusetts Institute of Technology), Roy, Nicholas (Massachusetts Institute of Technology)

Rapidly-Exploring Random Belief Trees for Motion Planning under Uncertainty

Scheduled for presentation during the Poster Sessions "Interactive Session I: Robotic Technology" (TuA1-InteracInterac), Tuesday, May 10, 2011, 08:20−09:35, Hall

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on March 30, 2020

Keywords Motion and Path Planning, Reactive and Sensor-Based Planning, Robust/Adaptive Control of Robotic Systems


In this paper we address the problem of motion planning in the presence of state uncertainty, also known as planning in belief space. The work is motivated by planning domains involving nontrivial dynamics, spatially varying measurement properties, and obstacle constraints. To make the problem tractable, we restrict the motion plan to a nominal trajectory stabilized with a linear estimator and controller. This allows us to predict distributions over future states given a candidate nominal trajectory. Using these distributions to ensure a bounded probability of collision, the algorithm incrementally constructs a graph of trajectories through state space, while efficiently searching over candidate paths through the graph at each iteration. This process results in a search tree in belief space that provably converges to the optimal path. We analyze the algorithm theoretically and also provide simulation results demonstrating its utility for balancing information gathering to reduce uncertainty and finding low cost paths.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2020 PaperCept, Inc.
Page generated 2020-03-30  00:11:32 PST  Terms of use