一种新的穿越战场监控区域最优化路径算法  

A NOVEL ALGORITHM OF OPTIMISED PATH ACROSS BATTLEFIELD MONITORING REGION

作　　者：李前进[1] 王希武[1] 林克成[1] 王寅龙[1] 李志祥[1] 

机构地区：[1]军械工程学院计算机工程系河,北石家庄050003

出　　处：《计算机应用与软件》2012年第6期264-266,共3页Computer Applications and Software

摘　　要：现代战场密布用来监控敌对目标活动的传感器,由于电子探测设备的限制,只能探测敌方布置的部分监控传感器,因此如何穿越监控区域就成为了一个很重要的问题。结合实际提出动态Voronoi图的概念,只需知道部分传感器分布情况利用动态Voronoi图建立穿越模型,并把此模型映射为网络节点图,通过限制搜索区域,限定搜索方向,引入优化策略,提出一种新的快速Dijk-stra搜索算法,寻找出一条最优路径。经仿真验证了算法的有效性。In modern battlefield,densely deployed sensors are used to monitor the actions of hostile targets.Since the limitation of the electronic detection devices,only part of the monitoring sensors disposed by the enemy can be detected,therefore how to pass through the monitoring region becomes an important issue.In our article,we present the concept of dynamic Voronoi graphics according to practical situations.By knowing just a part of the sensors can we build up a crossing model using dynamic Voronoi graphics,and map the model to as a network node graph.By limiting the search area and qualifying the search direction,plus introducing the optimisation strategy,we propose a new fast Dijkstra algorithm to look for the optimised path.Extensive experiments have confirmed the validity of the new algorithm.

关 键 词：暴露 动态Voronoi图 DIJKSTRA算法 优化路径 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]