Sampling based rewiring approaches to solve real-time path planning problems for a holonomic robot under the presence of dynamic obstacles
This algorithm is probabilistically complete and asymptotically optimal algorithm like its predecessor RRT. The algorithm has the ability to deal with dynamic obstacles, the planner changes the path if any obstacle appears in the visibility radius of the robot.
The original paper in which this algorithm was introduced can be found here.