Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic
By Jonathan D. Gammell, Siddhartha S. Srinivasa, T. Barfoot. 2014
1,105 citations recorded by the source corpus.
Rapidly-exploring random trees (RRTs) are popular in motion planning because they find solutions efficiently to single-query problems. Optimal RRTs (RRT*s) extend RRTs to the problem of finding the optimal solution, but in doing so asymptotically find the optimal path from the initial state to every state in the planning domain. This behaviour is not only inefficient but also inconsistent with their single-query nature.
Subfields: Aerospace Engineering, Computer Vision and Pattern Recognition, Industrial and Manufacturing Engineering, Algorithms & Complexity, Robotics & Control
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Aerospace Engineering
- Dhruv Batra
- Vladlen Koltun
- Jitendra Malik
- Manolis Savva
- Angel X. Chang
- Devendra Singh Chaplot
- Alfonso J. García-Cerezo
- Carlos Jesús Pérez-del-Pulgar
In Computer Vision and Pattern Recognition
- Luc Van Gool
- Jitendra Malik
- Abhinav Kumar Gupta
- Trevor Darrell
- Dacheng Tao
- Kristen Grauman
- Dhruv Batra
- Xiaogang Wang
In Industrial and Manufacturing Engineering
- Alfonso J. García-Cerezo
- Carlos Jesús Pérez-del-Pulgar
- J. Sánchez-Ibáñez
- Amna Khan
- Zulfiqar Habib
- Iram Noreen
- Jitendra Malik
- Vladlen Koltun
In Algorithms & Complexity
- Amna Khan
- Zulfiqar Habib
- Iram Noreen
- Alfonso J. García-Cerezo
- Carlos Jesús Pérez-del-Pulgar
- J. Sánchez-Ibáñez
- Jitendra Malik
- Vladlen Koltun
In Robotics & Control
- Dhruv Batra
- Manolis Savva
- Vladlen Koltun
- Devendra Singh Chaplot
- Jitendra Malik
- Alfonso J. García-Cerezo
- Carlos Jesús Pérez-del-Pulgar
- J. Sánchez-Ibáñez
Citations in the corpus
- Habitat 2.0: Training Home Assistants to Rearrange their Habitat (2021, background): “For instance, work in the area of motion planning has made several advancements with new sampling techniques [94, 95] and optimization based methods [86, 87, 89, 96], but largely operated on the assumption of a reliable perception stack.”
- Optimal Path Planning using RRT* based Approaches: A Survey and Future Directions (2016, methodology): “[34], 2014 Informed RRT* Proposed direct sampling technique based on ellipsoidal informed subset, which showed improved convergence than RRT*.”
- Posterior Sampling for Anytime Motion Planning on Graphs with Expensive-to-Evaluate Edges (2020, background): “Incremental densification techniques, on the other hand, offer provable speed-ups by restricting new samples to a region that can only improve the current solution [22–24].”
- Motion Planning Networks (2018, background): “, InformedRRT* [5] and BIT* [6] over the two above-mentioned test cases.”
- Path Planning for Autonomous Mobile Robots: A Review (2021, methodology): “An improved version called Informed RRT* improved upon the performance of RRT* by delimiting an ellipse enclosing the start and goal positions when a feasible path is found [191].”
- Motion Planning Networks: Bridging the Gap Between Learning-Based and Classical Motion Planners (2019, background): “proposed the informed-RRT* (IRRT*) [2] and BIT* [3].”
- Research Advances and Challenges of Autonomous and Connected Ground Vehicles (2019, background): “[398] proposes informed RRT ∗ for path planning to improve the convergence rate and final solution quality of RRT ∗ .”
- Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs (2014, background): “Problem Definition 1 (Optimal Planning): Let X ⊆ Rn be the state space of the planning problem, Xobs ⊂ X be the states in collision with obstacles, and Xfree = X \Xobs be the resulting set of permissible states.”
- Neural RRT*: Learning-Based Optimal Path Planning (2020, methodology): “The details can be found in [17].”