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

Path planner for unmanned aerial vehicles based on modified PSO algorithm

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

4 Author(s)
Zhu Hongguo ; Nat. Key Lab. of Integrated Inf. Syst. Technol., Chinese Acad. of Sci., Beijing ; Zheng Changwen ; Hu Xiaohui ; Li Xiang

Most path planning algorithms existed have disadvantages in space representation, constraints handling or computation efficiency. Combining particle swarm optimization with path planning problem for unmanned aerial vehicles (UAVs), a new path planner for aerial vehicles based on modified PSO algorithm is presented. Path planning problem is modeled as a 5-element array. Incorporating constraints into fitness evaluation reduces search space while a modified PSO algorithm is introduced to improve global optimization performance. Experiment results demonstrate that the proposed method is able to solve path planning problem effectively and provide a feasible path in a short time.

Published in:

Information and Automation, 2008. ICIA 2008. International Conference on

Date of Conference:

20-23 June 2008

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.