图形模型在航迹规划中的应用  

Research on Application of Diagram Model to Path Planning

作　　者：刘振[1] 史建国[1] 高晓光[2] 

机构地区：[1]海军航空工程学院,山东烟台264001 [2]西北工业大学电子信息学院,西安710072

出　　处：《火力与指挥控制》2010年第11期20-22,共3页Fire Control & Command Control

基　　金：国家自然科学基金重大研究计划(90205019)

摘　　要：对几种图形模型航迹规划的基本原理和方法进行了介绍,并进行了仿真验证。针对图形模型航迹规划中可行点选取的随意性,提出利用遗传算法寻找初始可飞区域内的可行点,将可行点连接起来就组成了初始可行航迹,此时便可用dijkstra算法进行航迹规划。由于标准传统遗传算法航迹规划的不足,提出运用实数编码的贝叶斯优化算法进行航迹规划,通过仿真验证了算法的有效性。After the introduction of several kinds of basic principle and methods of path planning,then we precede the simulation to validate the algorithm. In order to avoid the randomicity of the feasible point,we put forward the genetic algorithms to construct the initial feasible point,and connect these points to from the initial path,dijkstra algorithm can be used to path planning. Using genetic algorithms to path planning simply has many drawbacks,so we can use the bayesian optimization algorithms to path planning,but it has a long time to converge In order to speed the time of convergence,real-coded bayesian optimization algorithm is introduced and the final simulation validate the correctness of the algorithm.

关 键 词：航迹规划 贝叶斯优化 VORONOI图 DIJKSTRA算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]