计算机工程Issue(11)：143-148,6.DOI:10.3969/j.issn.1000-3428.2014.11.029
一种基于航迹片段的多蚁群协同规划算法
A Multiple Ant Colony Collaborative Planning Algorithm Based on Trajectory Segment
摘要
Abstract
To solve the problem that the traditional ant colony algorithm is slow to converge and easy to conflict in the collaborative trajectory planning, considering the features of network graph consist of trajectory segments, a aircraft collaborative trajectory planning algorithm is proposed based on multi-subgroup ant colony coevolution. It divides the ant colony into subgroups with the same number of the aircrafts. Heterogeneous pheromone is introduced to simulate the competition among subgroups,reference length coevolution is adopted to guide the subgroups generating trajectory satisfying the temporal constraints, and the strategy of lost ants pheromone update is added to accelerate the convergence speed. Experimental results demonstrate that this algorithm can generate collaborative flight trajectorys satisfying the constraints of time and space in complex environments for different planning tasks. Compared with the traditional ant colony algorithm,it can generate better collaborative trajectorys,while the planning speed can be improved by 2~3 times.关键词
协同航迹规划/网络图/多子群/蚁群算法/异质信息素Key words
collaborative trajectory planning/network graph/multi-subgroup/ant colony algorithm/heterogeneous pheromone分类
军事科技引用本文复制引用
刘慧娟,蔡超,孙希霞..一种基于航迹片段的多蚁群协同规划算法[J].计算机工程,2014,(11):143-148,6.基金项目
国家部委基金资助项目。 （）
