本文介紹了在戰(zhàn)時(shí)情況下，能使特種軍用車輛順利、安全、高效通過城市，進(jìn)入到某一作戰(zhàn)區(qū)域三種最優(yōu)路徑算法并進(jìn)行了比較。得出在確定的前提下，A*算法和限定區(qū)域算法的運(yùn)算時(shí)間比Dijkstra 算法的運(yùn)算時(shí)間短的結(jié)論?？赏ㄟ^對此方案的學(xué)習(xí)研究，進(jìn)一步提高我部隊(duì)的作戰(zhàn)效率。
關(guān)鍵字：特種軍用車輛，門限，邏輯位置，最短路徑算法
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