基于威胁建模的多航迹规划算法  

Multiple Route Planning Algorithm Based on Threat Modeling

作　　者：杨海燕[1] 张帅文 韩城[2] YANG Hai-yan;ZHANG Shuai-wen;HAN Cheng(School of Air Traffic Control and Navigation,Air Force Engineering University,Xi’an 710051,China;School of Graduate,Air Force Engineering University,Xi’an 710051,China)

机构地区：[1]空军工程大学空管领航学院,西安710051 [2]空军工程大学研究生院,西安710051

出　　处：《火力与指挥控制》2018年第10期83-88,共6页Fire Control & Command Control

基　　金：国家自然科学基金资助项目(61472441)

摘　　要：针对飞行器多航迹规划问题,首先为飞行器进行威胁建模,以此构建航迹规划的基本代价函数,使用引入排挤策略的K-均值聚类方法,将航迹依照其空间分布划分成多个相异种群,有效地保持了解的多样性,使航迹在空间离散度高,与粒子群算法相结合提高了求解效率,实现了算法的自适应。仿真结果表明,该算法能够为飞行器快速规划出多条航迹,克服了人工规划的主观性,满足实际作战中预航迹规划的需求。For the problem of aerial vehicle’s multiple route planning,firstly,the basic cost functions of route planning are formalized by modeling threat of aerial vehicles.Then,exclusion mechanism is introduced into K-means clustering,which is used to classify the routes owing to their distribution in space.Thus,the diversity of solutions is preserved and the routes’spatial dispersion is high.Finally,particle swarm optimization is used to improve the efficiency of solving,which makes the algorithm adaptable.The simulation results show that the proposed algorithm can realize multiple route planning for aerial vehicles rapidly,overcome subjectivity of artificial planning and satisfy the requirement of pre-route-planning in real combat.

关 键 词：多航迹规划 排挤机制 K-均值聚类 粒子群算法 威胁建模 

分 类 号：TJ85[兵器科学与技术—武器系统与运用工程] V249[航空宇航科学与技术—飞行器设计]