Probabilistically Safe Avoidance of Dynamic Obstacles with Uncertain Motion Patterns
Name
CCRRTwithRRGP2011.pdf
Size
1.63 MB
Format
Adobe PDF
Checksum (MD5)
001b9af1161e39916291065167904bf0
Author(s)
Luders, Brandon D.
Aoude, Georges S.
Joseph, Joshua M.
Roy, Nicholas
How, Jonathan P.
Date Issued
July 4, 2011
Series/Report no.
;ACL11-02
Abstract
This paper presents a real-time path planning algorithm which can guarantee
probabilistic feasibility for autonomous robots subject to process noise and an
uncertain environment, including dynamic obstacles with uncertain motion
patterns. The key contribution of the work is the
integration of a novel method for modeling dynamic obstacles with uncertain future
trajectories. The method, denoted as RR-GP, uses a learned motion pattern model
of the dynamic obstacles to make long-term predictions of their future paths. This is done by combining the
flexibility of Gaussian processes (GP) with the efficiency of RRT-Reach,
a sampling-based reachability computation method which ensures dynamic
feasibility. This prediction model is then utilized within chance-constrained rapidly-exploring random
trees (CC-RRT), which uses chance constraints to explicitly achieve probabilistic
constraint satisfaction while maintaining the computational
benefits of sampling-based algorithms. With RR-GP embedded in the CC-RRT framework, theoretical guarantees
can be demonstrated for linear systems subject to Gaussian uncertainty,
though the extension to nonlinear systems is also considered. Simulation results
show that the resulting approach can be used in real-time to efficiently and
accurately execute safe paths.
Subjects
probabilistic path planning
intention prediction
gaussian processes
uncertainty in predictability
collision avoidance
dynamic obstacles
probabilistic constraint satisfaction
sampling-based reachability
Terms of Use
Attribution-NonCommercial-NoDerivs 3.0 United States
Persistent DSpace Link
