By Topic

Path Planning for Aircraft Based on MAKLINK Graph Theory and Multi Colony Ant 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

3 Author(s)
Yanling Hao ; Coll. of Autom., Harbin Eng. Univ., Harbin, China ; Zhifeng Shen ; Yuxin Zhao

The task of path planning for aircraft has received considerable attention in the research literature. The problem involves computing a collision-free path between a start point and a target point in environment of known obstacles. In this paper, we investigate an obstacle avoidance path planning problem using the MAKLINK graph theory and multi ant colony system, in which several colonies of ants cooperate in finding optimal solution by exchanging good information. The result of computer simulation experiment shows that the proposed method is effective and can be used in the path planning of aircraft.

Published in:

Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on  (Volume:2 )

Date of Conference:

24-26 April 2009