Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Liu Yajie ; Acad. of Electron. Eng., Naval Univ. of Eng., Wuhan, China ; Wang Hangyu ; Xie Jun

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.

Published in:

Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on  (Volume:3 )

Date of Conference:

11-12 May 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.