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 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.
the complex mobile entity path planning subsection arc algorithm collision detection
Liu Yajie Wang Hangyu Xie Jun
Academy of Electronic Engineering, Naval University of Engineering, Wuhan 430033, China
国际会议
长沙
英文
3484-3486
2010-05-11(万方平台首次上网日期,不代表论文的发表时间)