Path Planning for Aircraft Based on MAKLINK Graph Theory and Multi Colony Ant Algorithm

被引：6

作者：

Hao, Yanling ^{[1
]}

Shen, Zhifeng ^{[1
]}

Zhao, Yuxin ^{[1
]}

机构：

[1] Harbin Engn Univ, Coll Automat, Harbin 150001, Peoples R China

来源：

INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 2, PROCEEDINGS | 2009年

关键词：

D O I：

10.1109/CSO.2009.315

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：232 / 235

页数：4

共 6 条

[1] GRID MODELING OF ROBOT CELLS - A MEMORY-EFFICIENT APPROACH [J].

BOSCHIAN, V ;

PRUSKI, A .

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 1993, 8 (02) :201-223

[2] New potential functions for mobile robot path planning [J].

Ge, SS ;

Cui, YJ .

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2000, 16 (05) :615-620

[3] A FORMAL BASIS FOR HEURISTIC DETERMINATION OF MINIMUM COST PATHS [J].

HART, PE ;

NILSSON, NJ ;

RAPHAEL, B .

IEEE TRANSACTIONS ON SYSTEMS SCIENCE AND CYBERNETICS, 1968, SSC4 (02) :100-+

[4]

Li Lei, 2002, Robot, V24, P475

[5]

MARTIN M, 15 IPDPS 2000 WORKSH, P645

[6] Ant colony system algorithm for real-time globally optimal path planning of mobile robots [J].

School of Information Science and Engineering, Central South University, Changsha 410083, China ;

不详 ;

不详 .

Zidonghua Xuebao, 2007, 3 (279-285) :279-285

← 1 →