I. Introduction
Motion planning is of great importance in various fields, such as robotics, virtual environments, maintenance planning, and computer-aided design. Although a number of exact and complete methods have been proposed for the robot motion planning problem (see [16] for an overview), these are seldomly used because they are only applicable to the simplest instances of the planning problem. For more complicated problems, where the robot has many degrees of freedom, these methods are computationally infeasible. Therefore, the focus has shifted toward probabilistic and heuristic methods, sacrificing completeness for speed and applicability.