Practicality-Based Probabilistic Roadmaps Method
Jing Yang, Patrick W. Dymond, Michael R. M. Jenkin · 2011
Probabilistic roadmap methods (PRMs) are a commonly used approach to path planning problems in a high-dimensional search space. Although PRMs can often find a solution to solving the path finding problem the solutions are often not practical in that they can cause the device to flail around or to pass very close to obstacles in the environment. This paper presents a variant of PRMs that addresses the practicality problem of the paths found by the planner. A simple and general sample adjustment method is developed, which adjusts the randomly generated nodes that make up the PRM within their local neighborhood to satisfy soft constraints required by the problem. The resulting roadmap can then be used to generate more practical paths. The approach is general and can be adapted to path planning problems with different practical requirements.