I. Introduction
In recent years, probabilistic roadmap (PRM) planning has emerged as one of the most successful approaches for path planning of robots with many degrees of freedom (dofs) [1], [6], [7], [10], [12], [16], [18], [19] A classic multi-query PRM planner [16] samples points uniformly at random in a robot's configuration space, and connects these points with simple collision-free paths to construct a roadmap graph that approximates the connectivity of a robot's configuration space. The planner then answers path-planning queries by searching the roadmap for a path between query configurations. Due to their efficiency and simplicity, PRM planners have found applications in many areas, such as robotics, computer-aided design, computer graphics, and computational biology (see, e.g., [2], [4], [8], [17]).