Abstract
Rapidly exploring Random Tree (RRT) algorithm for path planning has some shortcomings, such as a slow resolution for nearest node, polyline path, and so on. A Fibonacci initial trimming and Geometry trimming for the path of a Diagonal distance and Angle RRT (FG-DA-RRT) is proposed to plan the path for Unmanned Surface Vessels (USV). FG-DA-RRT has two characteristics, one is that the diagonal distance with the angle value is instead of the traditional Euclidean distance to calculate the nearest neighbors, which improves the speed of the neighboring nodes. The other is, a smooth path for FG-DA-RRT is modified by Fibonacci search method and geometric principle. Finally, FG-DA-RRT is applied to plan the path for USV in simulations. Simulation results indicate FG-DA-RRT has a super performance than RRT and RRT-Connect.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
