现代军事试验靶场残骸搜寻最短路径问题研究  

Reserch of the Shortest Path to Search for Remains in Target Ground for Mordern Military Experiments

作　　者：任世强[1] 张曙光[1] 刘英[1] 

机构地区：[1]武汉大学计算机学院,武汉430072

出　　处：《计算机工程》2005年第18期228-230,共3页Computer Engineering

摘　　要：根据现代军事试验靶场不存在实际的路及不确定障碍物多的特点,设计了一种不包括障碍物内部点的强连通图GC,并以GC为基础给出了一种跨越障碍物搜寻目标残骸的最短路径算法。通过实例分析得出结论,该算法很好地避开了沙丘、山包、灌木丛等障碍物,确定了一条搜索路径,改变了过去那种大范围搜索目标残骸的低效方法,提高了搜索效率。This paper designs a strong connection graph GC in which nodes are not contained in the interior of any obstacle,based on the fact that no specified path exits and there are lots of unpredictable obstacles in the target ground for modern military experiments.Furthermore,an algorithm for the construction of the shortest path used to bypass the obstacles and search for the target remains in the ground is presented.By applying the algorithm to the practice,obstacles such as sand dunes,mounds,bushes and so on, are avoided successfully and the traditional way of searching for remains in a large range is changed into the new efficient one based on the shortest path.

关 键 词：最短路径 障碍物 迂回 强连通图 残骸 

分 类 号：TP319[自动化与计算机技术—计算机软件与理论]