Voronoi diagram in optimal path planning

Authors:
Priyadarshi Bhattacharya;Marina L. Gavrilova
Affiliations:
University of Calgary, Canada;University of Calgary, Canada
Venue:
ISVD '07 Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering
Year:
2007

Citing 0
Cited 10

A spatial awareness framework for enhancing game agent behaviour

Sandbox '08 Proceedings of the 2008 ACM SIGGRAPH symposium on Video games
Simulated annealing based algorithm for smooth robot path planning with different kinematic constraints

Proceedings of the 2010 ACM Symposium on Applied Computing
Shortest path queries in a simple polygon for 3D virtual museum

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
A geometric approach to clearance based path optimization

ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Collision-free curvature-bounded smooth path planning using composite Bezier curve based on Voronoi diagram

CIRA'09 Proceedings of the 8th IEEE international conference on Computational intelligence in robotics and automation
Intelligent flight task algorithm for unmanned aerial vehicle

Expert Systems with Applications: An International Journal
Multi-robot visual coverage path planning: geometrical metamorphosis of the workspace through raster graphics based approaches

ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
Progress toward multi-robot reconnaissance and the MAGIC 2010 competition

Journal of Field Robotics
An online robot trajectory planning and programming support system for industrial use

Robotics and Computer-Integrated Manufacturing
Path planning with obstacle avoidance based on visibility binary tree algorithm

Robotics and Autonomous Systems

Quantified Score

Hi-index	0.00

Visualization

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.