Path planning in distorted configuration space
Chao Chen · Robotica · 2016
SUMMARY An effective algorithm for path planning is introduced based on a novel concept, the distorted configuration space (DC-space), where all obstacles deform into dimensionless geometric objects. Path planning in this space can be conducted by simply connecting the starting position and ending position with a straight line. This linear path in the DC-space is then mapped back into a feasible in the original C-space. The advantage of this approach is that no trial-and-error or iteration is needed while a feasible path can be found directly if it exists. An algorithm with general formulas is derived. Examples in 2D and 3D are provided to validate this concept and algorithm.