1 Introduction
In robot path planning, Probabilistic Roadmap Method has extensively been used as an effective sampling method [1]–[5]. Classic PRM [6] first randomly configures sampled points in the working space of the robot to describe its possible locomotion in it. Starting from the initial point, a neighbor point is reached by a searching method, such as k-nearest neighborhood method, and connected to the roadmap as well as its affiliated configurations until a roadmap of enough density is reached. A free path of no collision from the initial position to the goal position can consequently be acquired.