Practical path planning among movable obstacles

Path planning among movable obstacles is a practical problem that is in need of a solution. An efficient heuristic algorithm is presented that uses a generate-and-test paradigm: a good candidate path is hypothesized by a global planner and subsequently verified by a local planner. In the process of formalizing the problem, a technique for modeling object interactions through contact is presented. The algorithm has been tested on a variety of examples, and was able to generate solutions within 10 s on a 17-MIPS Sun Sparc workstation.<
>