2008 IEEE/RSJ International Conference on Intelligent Robots and Systems 2008
DOI: 10.1109/iros.2008.4651075
|View full text |Cite
|
Sign up to set email alerts
|

Motion planning for urban driving using RRT

Abstract: Abstract-This paper provides a detailed analysis of the motion planning subsystem for the MIT DARPA Urban Challenge vehicle. The approach is based on the Rapidly-exploring Random Trees (RRT) algorithm. The purpose of this paper is to present the numerous extensions made to the standard RRT algorithm that enable the on-line use of RRT on robotic vehicles with complex, unstable dynamics and significant drift, while preserving safety in the face of uncertainty and limited sensing. The paper includes numerous simu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
111
0
4

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 198 publications
(115 citation statements)
references
References 13 publications
(17 reference statements)
0
111
0
4
Order By: Relevance
“…Recently, we observe fast development of sampling-based motion planners building upon the concept of RRT (Rapidly Random exploring Trees) [11,15,17,20,23,30] and other closely related probabilistic approaches such as [13]. Their controller-driven variants are usually obtained by integration of a specific extend procedure into the planner.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…Recently, we observe fast development of sampling-based motion planners building upon the concept of RRT (Rapidly Random exploring Trees) [11,15,17,20,23,30] and other closely related probabilistic approaches such as [13]. Their controller-driven variants are usually obtained by integration of a specific extend procedure into the planner.…”
Section: Related Workmentioning
confidence: 99%
“…Remark 2 Note that differential constraint (23) imposed by unicycle kinematics is represented in continuous time and robot configuration domains, as opposed to discretized state transition equations assumed in various methods available in the literature. Constraints (23) and (25) necessitate constraint satisfaction checking in continuous time and robot configuration domains, which is possible thanks to the application of the VFO feedback control law and utilization of its properties developed in Section 4.…”
Section: Formulation Of Problem 1 As a General Optimization Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…This section reviews the real-time closed-loop RRT (CL-RRT) algorithm, proposed by Frazzoli 5 and later extended, [11][12][13] which this paper builds upon. The fundamental operation in the standard RRT algorithm 14 is the incremental growth of a tree of dynamically feasible trajectories, rooted at the system's current state, through simulations of the system's prediction model.…”
Section: A Closed-loop Rrt For Accurate State Predictionmentioning
confidence: 99%
“…Other techniques such as rapidly-exploring random trees (RRTs) [7] have been effectively used to generate search spaces around the mobile robot to navigate cluttered, difficult environments and generate sophisticated maneuvers including uturns. [9] presents a reactive path following controller for a unicycle type mobile robot built with a Deformable Virtual Zone to navigate paths without the need for global path replanning.…”
Section: Related Workmentioning
confidence: 99%