loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)
Voronoi diagram in optimal path planning
University of Glamorgan, Pontypridd, Wales
July 09-July 11
ISBN: 0-7695-2869-4
Priyadarshi Bhattacharya, University of Calgary, Canada
Marina L. Gavrilova, University of Calgary, Canada
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.
Index Terms:
Voronoi diagram, dynamic update, optimal path, visibility graph, GIS
Citation:
Priyadarshi Bhattacharya, Marina L. Gavrilova, "Voronoi diagram in optimal path planning," isvd, pp.38-47, 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.