SRRT~* - a probabilistic optimal trajectory planner for problematic area structures

摘要

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.