Chance Constrained RRT for Probabilistic Robustness to Environmental Uncertainty
Author(s)Luders, Brandon Douglas; Kothari, Mangal; How, Jonathan P.
MetadataShow full item record
For motion planning problems involving many or unbounded forms of uncertainty, it may not be possible to identify a path guaranteed to be feasible, requiring consideration of the trade-off between planner conservatism and the risk of infeasibility. This paper presents a novel real-time planning algorithm, chance constrained rapidly-exploring random trees (CC-RRT), which uses chance constraints to guarantee probabilistic feasibility for linear systems subject to process noise and/or uncertain, possibly dynamic obstacles. By using RRT, the algorithm enjoys the computational benefits of sampling-based algorithms, such as trajectory-wise constraint checking and incorporation of heuristics, while explicitly incorporating uncertainty within the formulation. Under the assumption of Gaussian noise, probabilistic feasibility at each time step can be established through simple simulation of the state conditional mean and the evaluation of linear constraints. Alternatively, a small amount of additional computation can be used to explicitly compute a less conservative probability bound at each time step. Simulation results show that this algorithm can be used for efficient identification and execution of probabilistically safe paths in real time.
url is to conference schedule where talk is listed.
DepartmentMassachusetts Institute of Technology. Department of Aeronautics and Astronautics
Proceedings of the AIAA Guidance, Navigation, and Control Conference
American Institute of Aeronautics and Astronautics
Luders, Brandon J., Mangal Kothariyand and Jonathan P. How. "Chance Constrained RRT for Probabilistic Robustness to Environmental Uncertainty." In Proceedings of the AIAA Guidance, Navigation, and Control Conference, Toronto, Ontario, Canada, 2-5 August 2010.
Author's final manuscript