Asset Details
Do you wish to reserve the book?
Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning
Do you wish to request the book?
Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Improved RRT-Connect Algorithm Based on Triangular Inequality for Robot Path Planning
2021
Overview
This paper proposed a triangular inequality-based rewiring method for the rapidly exploring random tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.
Publisher
MDPI,MDPI AG
Subject
We currently cannot retrieve any items related to this title. Kindly check back at a later time.