Voronoi diagram in optimal path planning
Authors:
- 1 July 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 38-47
Abstract
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.Keywords
This publication has 12 references indexed in Scilit:
- Geometric algorithms for clearance based optimal path computation2007
- The visibility--voronoi complex and its applications2005
- A voronoi diagram‐visibility graph‐potential field compound algorithm for robot path planningJournal of Robotic Systems, 2004
- COLLISION DETECTION OPTIMIZATION IN A MULTI-PARTICLE SYSTEMInternational Journal of Computational Geometry & Applications, 2003
- Delete and insert operations in Voronoi/Delaunay methods and applicationsComputers & Geosciences, 2003
- Global path planning using artificial potential fields2003
- Potential field methods and their inherent limitations for mobile robot navigation2002
- Crust and anti-crust1999
- A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environmentIEEE Transactions on Robotics and Automation, 1997
- Randomized incremental construction of Delaunay and Voronoi diagramsAlgorithmica, 1992