By Topic

Voronoi diagram in optimal path planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Priyadarshi Bhattacharya ; University of Calgary, Canada ; Marina L. Gavrilova

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.

Published in:

Voronoi Diagrams in Science and Engineering, 2007. ISVD '07. 4th International Symposium on

Date of Conference:

9-11 July 2007