欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
对几种图形模型航迹规划的基本原理和方法进行了介绍,并进行了仿真验证。针对图形模型航迹规划中可行点选取的随意性,提出利用遗传算法寻找初始可飞区域内的可行点,将可行点连接起来就组成了初始可行航迹,此时便可用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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：