| 基于稀疏A*算法的三维航迹并行规划算法 |
| |
| 引用本文： | 周成平,陈前洋,秦筱楲. 基于稀疏A*算法的三维航迹并行规划算法[J]. 华中科技大学学报(自然科学版), 2005, 33(5): 42-45 |
| |
| 作者姓名： | 周成平 陈前洋 秦筱楲 |
| |
| 作者单位： | 华中科技大学,图像识别与人工智能研究所,湖北,武汉,430074;中国航天科工集团,三院研发中心,北京,100074 |
| |
| 摘 要： | 提出三维稀疏A*算法的规划时间组成，并分析该算法的时间复杂度和并行性，随后给出并行任务划分的不同策略．判断OPEN表中是否存在与新节点相同节点的准则修改为：只比较OPEN表中代价比新节点代价小的节点，新准则可以有效地减少对共享式OPEN，CLOSED表的瓶颈效应．提出的三维航迹并行规划算法在并行机群环境中实现，实验结果表明时间效果改善明显．
|
| 关 键 词： | 稀疏A*算法 航迹规划 并行算法 |
| 文章编号： | 1671-4512(2005)05-0042-04 |
| 修稿时间： | 2004-09-03 |
Parallel algorithm of 3D route planning based on the sparse A* algorithm |
| |
| Zhou Chengping,Chen Qianyang,Qin Xiaowei. Parallel algorithm of 3D route planning based on the sparse A* algorithm[J]. JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE, 2005, 33(5): 42-45 |
| |
| Authors: | Zhou Chengping Chen Qianyang Qin Xiaowei |
| |
| Affiliation: | Zhou Chengping Chen Qianyang Qin XiaoweiZhou Chengping Assoc. Prof., Institute. for Pattern Recognition & AI,Huazhong Univ. of Sci. & Tech.,Wuhan 430074,China. |
| |
| Abstract: | The composing of planning tine of 3D sparse A algorithm (3D SAS) was put forward, the time complexity and parallelism of this algorithm were analysed, and several strategies of task allocation proved. Whether there is the same node with the new node in the OPEN list may be determined by selecting nodes whose cost are less than the new node. The new principle can reduce the influence of the bottleneck of shared OPEN and CLOSED lists. The paralleled algorithm is realized in the cluster environment. The experiment results show that the algorithm may remarkably cut down the planning time. |
| |
| Keywords: | sparse A~* search route planning parallel algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
