I INTRODUCTION
Sampling-based methods, such as Probabilistic Roadmap Method (PRM)[1] and Rapidly exploring Random Trees (RRT)[2], contributes a lot in robotics path planning. How-ever, sampling-based methods show their weakness in some special regions, such as narrow passages and obstacles' boundaries, due to their small volumes. In recent twenty years, plenty of variants of PRM and RRT [3], [4], [5], [6] have been proposed to deal with these difficult region problems and have achieved great success even in high-dimension configuration space (C-Space). Nevertheless, there are still challenging problems in changing environments, because difficult regions change their shapes when obstacles move.