摘要
Path planning is one of the most important problems in the design of a mobile robot.A novel approach called generalized Voronoi diagrams(GVD)may deal with this matter.First,a method was introduced to normalize the obstacles and present efficient techniques for generating GVDs.Then a best path searching algorithm was presented.Examples implemented were given to indicate the availability of the mentioned algorithms.The approaches in this paper can also be used in applications including visualization,spatial data manipulation,etc.
Path planning is one of the most important problems in the design of a mobile robot. A novel approach called generalized Voronoi diagrams （GVD） may deal with this matter. First, a method was introduced to normalize the obstacles and present efficient techniques for generating GVDs. Then a best path searching algorithm was presented. Examples implemented were given to indicate the availability of the mentioned algorithms. The approaches in this paper can also be used in applications including visualization, spatial data manipulation, etc.
出处
《重庆邮电大学学报（自然科学版）》
北大核心
2009年第2期173-177,共5页
Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
基金
supported by Beijing Natural Science Foundation (contact no.4062010)
