| 一种多约束条件下路径规划算法研究 |
| |
| 引用本文： | 李汉轩,李志华,吕春生. 一种多约束条件下路径规划算法研究[J]. 电子设计工程, 2012, 20(10): 31-33 |
| |
| 作者姓名： | 李汉轩 李志华 吕春生 |
| |
| 作者单位： | 1. 河海大学控制理论与控制工程系,江苏南京,211100
2. 91656部队质量控制室,上海,200136 |
| |
| 摘 要： | 针对目前导航系统中重要的多约束条件下路径规划功能,结合A＊算法和蚁群算法提出一种新的不确定算法,该算法首先将多约束条件进行融合使其适合蚁群转移,并在基本蚁群算法基础上采用了A＊算法的评估指标,为蚁群转移时提供最优预测收敛点。通过实验证明该算法可以大幅度降低时间消耗,并且全局收敛性强,计算结果稳定。
|
| 关 键 词： | 路径规划 最优路径 A＊算法 蚁群算法 评估值 |
An algorithm for the path-planning with multiple constraints |
| |
| LI Han-xuan,LI Zhi-hua,LV Chun-sheng. An algorithm for the path-planning with multiple constraints[J]. Electronic Design Engineering, 2012, 20(10): 31-33 |
| |
| Authors: | LI Han-xuan LI Zhi-hua LV Chun-sheng |
| |
| Affiliation: | 1.Control Theory and Control Engineering,Hohai University,Nanjing 211100,China; 2.Quality Control Room,Troops 91656,Shanghai 200136,China) |
| |
| Abstract: | In view of the important path planning function under multi-constraint conditions in current navigation systems,a new uncertainty algorithm is proposed which is the connection of A* algorithm and ant Colony algorithm.To adapt transfer of ant Colony algorithm,firstly,multiple constraints is integrated.Then,I took use of the concept of evaluation indicators in A* algorithm to get the optimal forecast convergence point for ant colony transfer.Basing on above operation,the results show that the algorithn has,strong global convergence,and substantially reduced time consumption. |
| |
| Keywords: | path-planning optimal path A-Star Ant Colony Optimization evaluation value |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
