DocumentCode
2990429
Title
Global Path Planning Method Based on Geometry Algorithm in a Strait Environment
Author
Liu, Yajie ; Wang, Hangyu ; Xie, Jun
Author_Institution
Acad. of Electron. Eng., Naval Univ. of Eng., Wuhan, China
fYear
2010
fDate
25-27 June 2010
Firstpage
1066
Lastpage
1069
Abstract
A global path planning method for complex mobile entity based on geometry algorithm in a strait environment was researched. Aiming at the complex mobile entity, the obstacles and the mobile entity were expressed as different polygons. Based on geometry algorithm, a set of folding linear path candidates were found out firstly. In order to enhance the success rate of path planning, the folding linear path candidates are transformed to the arcs by data interpolation algorithm. The topological relations between motion trace of the mobile entity and the obstacles were used to validate the security of the paths. Simulation results show that the method is simple, effective and high efficient for the complex mobile entity in a strait environment.
Keywords
computational geometry; interpolation; mobile robots; path planning; complex mobile entity; data interpolation algorithm; geometry algorithm; global path planning method; strait environment; Algorithm design and analysis; Geometry; Interpolation; Mobile communication; Path planning; Security; Simulation; geometry algorithm; global path planning; interpolation algorithm; the mobile entity;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Control Engineering (ICECE), 2010 International Conference on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-6880-5
Type
conf
DOI
10.1109/iCECE.2010.270
Filename
5630397
Link To Document