Voronoi diagram in optimal path planning

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Priyadarshi Bhattacharya Articles by Marina L. Gavrilova

4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007)

University of Glamorgan, Pontypridd, Wales

July 09-July 11

ISBN: 0-7695-2869-4

	ASCII Text	x
	Priyadarshi Bhattacharya, Marina L. Gavrilova, "Voronoi diagram in optimal path planning," International Symposium on Voronoi Diagrams in Science and Engineering, pp. 38-47, 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007), 2007.

	BibTex	x
	@article{ 10.1109/ISVD.2007.43, author = {Priyadarshi Bhattacharya and Marina L. Gavrilova}, title = {Voronoi diagram in optimal path planning}, journal ={International Symposium on Voronoi Diagrams in Science and Engineering}, volume = {0}, year = {2007}, isbn = {0-7695-2869-4}, pages = {38-47}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISVD.2007.43}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - International Symposium on Voronoi Diagrams in Science and Engineering TI - Voronoi diagram in optimal path planning SN - 0-7695-2869-4 SP38 EP47 A1 - Priyadarshi Bhattacharya, A1 - Marina L. Gavrilova, PY - 2007 KW - Voronoi diagram KW - dynamic update KW - optimal path KW - visibility graph KW - GIS VL - 0 JA - International Symposium on Voronoi Diagrams in Science and Engineering ER -

Priyadarshi Bhattacharya, University of Calgary, Canada

Marina L. Gavrilova, University of Calgary, Canada

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISVD.2007.43

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.