Utilizing Subsection Arc Algorithm to Optimize the Path for a Complex Mobile Entity in a Strait Environment

Aiming at path planning for the complex mobile entity in a strait environment, based on hull searching algorithm, a set of folding linear path candidates were found out, in order to enhance the success rate of path planned, the folding linear paths were transformed to the arcs by utilizing subsectio...

Full description

Saved in:
Bibliographic Details
Published in2010 International Conference on Intelligent Computation Technology and Automation Vol. 3; pp. 1122 - 1124
Main Authors Liu Yajie, Wang Hangyu, Xie Jun
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2010
Subjects
Online AccessGet full text
ISBN9781424472796
1424472792
DOI10.1109/ICICTA.2010.109

Cover

More Information
Summary:Aiming at path planning for the complex mobile entity in a strait environment, based on hull searching algorithm, a set of folding linear path candidates were found out, in order to enhance the success rate of path planned, the folding linear paths were transformed to the arcs by utilizing subsection arc algorithm. After the motion trace of the mobile entity was given, the security of the path is easily judged by the collision detection. The path optimized algorithm is simple, effective for the complex mobile entity in a strait environment.
ISBN:9781424472796
1424472792
DOI:10.1109/ICICTA.2010.109