Skip to Main Content
In this paper, we provide an algorithm based on Voronoi diagram to compute an optimal path between source and destination in the presence of simple disjoint polygonal obstacles. We evaluate the quality of the path based on clearance from obstacles, overall length and smoothness. We provide a detailed description of the algorithm for Voronoi diagram maintenance and dynamic updates. Experimental results demonstrate superior performance of the method in relation to other path planning algorithms.
Date of Conference: 9-11 July 2007