Abstract
Abstract: This paper extends the well known efficient RRT* algorithm to handle special environmental structures, such as narrow passages. By applying the watershed algorithm, inspired by image processing, a segmentation component is added to solve the given problem. Therefore the traditional watershed segmentation competes against the newly developed center marker watershed algorithm and the results of different experiments, combining both segmentation methods with the Rapidly Exploring Random Tree* (RRT*) algorithm to the Segmented Rapidly Exploring Random Tree* (SRRT*), are compared for several critical environments. It is shown, the whole trajectory planning process benefits from the segmentation and the SRRT*, using the new center marker watershed, outer performs the traditional RRT* method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.