I. Introduction
Sampling-based motion planners routinely solve complex, high-dimensional planning problems. This may seem surprising, considering that the general motion planning problem [1] is PSPACE-hard [2]. However, the configuration spaces of many practical problems contain considerable structure that may help in solving a planning problem. In addition, not all parts of configuration space have to be explored to solve a particular motion planning problem. Today's sampling-based planners leverage these properties of practical motion planning problems to achieve computational efficiency.