Abstract
Rapidly-exploring Random Trees (RRTs) are successful in single-query motion planning problems. The standard version of RRT grows a tree from a start location and stops once it reached the goal configuration. RRT-Connect is the bidirectional version of RRT, which grows two trees simultaneously. These two trees try to establish a connection to stop searching. RRT-Connect finds solutions faster than RRT. Following that, an asymptotically optimal version of RRT-Connect called RRT*-Connect has been introduced. It not only rewires both trees while they are growing, but also it keeps searching the state space for better solutions than the current one. However, it is inefficient and inconsistent to search all over the state space in order to find better solutions than the current one concerning its single-query nature. The better way is to look through states that can provide a better solution. In this paper, we propose Informed RRT*-Connect, which is the informed version of RRT*-Connect that uses direct sampling after the first solution found. Unlike RRT*-Connect, the proposed method checks only the states that can potentially provide better solutions than the current solution. The proposed method benefited from the properties of RRT*-Connect and informed sampling, which offers low-cost solutions with fewer iterations in comparison to RRT*-Connect. Different simulations in OMPL have been carried out to show the significance of Informed RRT*-Connect in comparison with RRT*, Informed RRT*, and RRT*-Connect.
Highlights
Motion planning problems have various applications such as Self-driving cars, Unmanned Aerial Vehicles (UAVs), medical surgery, computational biology, graphics animation and virtual prototyping [1]–[7]
It is due to the fact that when the distance between xstart and xgoal is relatively big and the subset almost covers all over the configuration space so that Informed Rapidly-exploring Random Trees (RRTs)*-Connect search area is not limited to a small portion of the configuration space
Informed RRT*-Connect is acting like RRT*-Connect in these kinds of scenarios
Summary
Motion planning problems have various applications such as Self-driving cars, Unmanned Aerial Vehicles (UAVs), medical surgery, computational biology, graphics animation and virtual prototyping [1]–[7]. R. Mashayekhi et al.: Informed RRT*-Connect: Asymptotically Optimal Single-Query Path Planning Method faster than RRT, especially when the goal location is challenging to reach regarding the presence of tight passages that the planner has to pass through them to find solutions. We introduce a single-query bidirectional planning method for optimal motion planning problems called Informed RRT*-Connect. Like other asymptotically optimal versions of RRTs, Informed RRT*Connect and RRT*-Connect keep exploring the state space to return near-optimal solutions after the first solution found. They are acting differently after a first solution is found.
Sign-in/Register to view highlights & summary 
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call