Optimal Path Planning using RRT* based Approaches: A Survey and Future Directions

By Iram Noreen, Amna Khan, Zulfiqar Habib. 2016

307 citations recorded by the source corpus.

Optimal path planning refers to find the collision free, shortest, and smooth route between start and goal positions. This task is essential in many robotic applications such as autonomous car, surveillance operations, agricultural robots, planetary and space exploration missions. Rapidly-exploring Random Tree Star (RRT*) is a renowned sampling based planning approach. It has gained immense popularity due to its support for high dimensional complex problems. A significant body of research has addressed the problem of optimal path planning for mobile robots using RRT* based approaches. However, no updated survey on RRT* based approaches is available. Considering the rapid pace of development in this field, this paper presents a comprehensive review of RRT* based path planning approaches. Current issues relevant to noticeable advancements in the field are investigated and whole discussion is concluded with challenges and future research directions.

Subfields: Aerospace Engineering, Computer Vision and Pattern Recognition, Control and Systems Engineering

View Paper: https://www.semanticscholar.org/paper/9c352fec7a86c875eec17fc054106414b6914b7d

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

In Computer Vision and Pattern Recognition

In Control and Systems Engineering

Citations in the corpus

Success Weighted by Completion Time: A Dynamics-Aware Evaluation Criteria for Embodied Navigation (2021, background): “For such a task, creating a new graph using RRT* [10] that considers the agent’s dynamics is often the preferred approach [15], [19].”
Path Planning for Autonomous Mobile Robots: A Review (2021, background): “[14] (2016) No No Only mentions No Yes Only mentions No No”