本文介绍了在战时情况下，能使特种军用车辆顺利、安全、高效通过城市，进入到某一作战区域三种最优路径算法并进行了比较。得出在确定的前提下，A*算法和限定区域算法的运算时间比Dijkstra 算法的运算时间短的结论。可通过对此方案的学习研究，进一步提高我部队的作战效率。关键字：特种军用车辆，门限，逻辑位置，最短路径算法Abstract: This paper introduces three optimal path algorithms which ensure special type military vehicles passthrough cities and get to another battle field successfully, safely and efficiently when wars break out and makes acomparison among these algorithms. The conclusion that under some particular preconditions the running times of the A* algorithm and the restricted algorithm are shorter than that of Dijkstra algorithm was drawn. By studyingof these algorithms, the battle efficiency of our army can be enhanced.Key Words: special type military vehicles, threshold, logical position, shortest path algorithm
猜您喜欢
推荐内容
开源项目推荐 更多
热门活动
热门器件
用户搜过
随便看看
热门下载
热门文章
热门标签
京公网安备 11010802033920号
Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved
评论