Virtual Stretched String
Agniva Sengupta, Ranjit Ray, Sankar Nath Shome · 2013
This paper describes an algorithm for path planning among polygonal obstacles that is safe and optimal in the 2D plane. The algorithm is a computational geometry based path planner but unlike existing path planners, the proposed approach works by simulating the physical property of an inextensible, frictionless string. The string has been modeled with certain constraints which lead to the determination of the shortest safe path between origin and goal points. This paper deals with the details of the proposed mechanism. The proposed technique has been successfully simulated and tested with suitable experiments.