Aiming at the problems of high randomness, many redundant nodes and low efficiency when the map is complex, an improved RRT dual tree algorithm is proposed. Firstly, the algorithm adopts the method of bi-directional growth and adding the target bias factor to the starting point expansion tree to shorten the running time of the algorithm and reduce the probability of exploring the invalid space; secondly, it simplifies the path by greedy thought, removes the redundant nodes, and smoothes the corner by quadratic B-spline curve; finally, through the comparison of simulation experiments. The algorithm has higher search efficiency and better results ,the algorithm has shorter path and higher smoothness, which verifies the accuracy and feasibility of the algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.