带集结区的协同航迹规划方法研究  

Cooperative Route Planning Method with Rendezvous

作　　者：陈昭[1] 王长青[2] 周其忠[2] 傅阳光[1] 周成平[1] 

机构地区：[1]华中科技大学图像识别与人工智能研究所多谱信息处理技术国家级重点实验室,武汉430074 [2]北京机电工程研究所,北京100074

出　　处：《系统仿真学报》2013年第2期256-259,264,共5页Journal of System Simulation

摘　　要：通过调控飞行器在各个航迹段的速度,提出了一种基于进化算法的带集结区的多飞行器协同航迹规划方法。该方法通过将协同时间误差引入进化算法的代价函数中,使得规划出来的航迹能够满足集结区的时间和空间约束,同时使得协同到达目标点时间误差尽可能小。仿真实验结果表明该方法能够达到很好的效果。Through adjusting the vehicle＇s velocity of each section of the flight route, a multi-vehicle cooperative route planning method with rendezvous based on evolutionary algorithm was proposed. This method introduced cooperative time error of multi-vehicle into the cost function of evolutionary algorithm, which made route satisfying rendezvous ＇s restricts of time and space, and at the same time made the cooperative time error of reaching target reducing as small as possible. The results of simulation experiments show that this method can make good effect.

关 键 词：集结区 进化算法 速度调控 协同航迹规划 

分 类 号：V448.22[航空宇航科学与技术—飞行器设计]