融合遗传蚁群算法的区域覆盖卫星星座优化算法

针对特定区域覆盖并密集重访的卫星星座优化设计问题,采用回归轨道和共星下点轨迹星座的设计方案,提出特定区域内重点地区权值排序覆盖并融合遗传蚁群算法优化求解卫星星座轨道参数的方法。分析区域覆盖星座的设计需求,建立回归轨道覆盖区域模型,利用遗传蚁群算法计算出最优轨道根数,使用共星下点轨迹星座求解算法求出所有星座参数。仿真实验结果表明优化设计的星座满足对于区域目标的覆盖时间和重访次数需求,并对重要地点按照权值排序进行了侧重性覆盖和重访,验证了算法的可行性。     

硬件加速的三维雷达作用范围表现

未来数字化战场迫切需要表现复杂环境影响下的三维雷达作用范围,目前研究多限于二维,而三维表现又受限于速度,为此提出一种硬件加速的三维表现方法。在构造环境影响下雷达电磁波损失三维数据场的基础上,利用硬件加速的等值面提取算法建立雷达作用范围的三维模型,并将其表现到战场环境中。在普通微机上针对典型雷达的实验中,克服了二维表现不直观以及三维表现慢的缺点,形象地展示了地形大气等环境影响下三维作用范围,从而为用户提供决策和感官支持。     

Fire truck relocation during major incidents

The effectiveness of a fire department is largely determined by its ability to respond to incidents in a timely manner. To do so, fire departments typically have fire stations spread evenly across the region, and dispatch the closest truck(s) whenever a new incident occurs. However, large gaps in coverage may arise in the case of a major incident that requires many nearby fire trucks over a long period of time, substantially increasing response times for emergencies that occur subsequently. We propose a heuristic for relocating idle trucks during a major incident in order to retain good coverage. This is done by solving a mathematical program that takes into account the location of the available fire trucks and the historic spatial distribution of incidents. This heuristic allows the user to balance the coverage and the number of truck movements. Using extensive simulation experiments we test the heuristic for the operations of the Fire Department of Amsterdam‐Amstelland, and compare it against three other benchmark strategies in a simulation fitted using 10 years of historical data. We demonstrate substantial improvement over the current relocation policy, and show that not relocating during major incidents may lead to a significant decrease in performance.     

解析法区域覆盖卫星星座设计

对典型卫星星座进行了分析。使用解析方法,以卫星载荷的工作高度范围为约束条件,以有效利用卫星覆盖区域为原则,给出设计区域覆盖卫星星座的详细步骤,得出卫星轨道根数和星座轨道参数。利用卫星工具包(STK)生成卫星星座图。     

双基地雷达对隐身目标探测区域的计算

定量分析了隐身目标的双基地雷达散射截面积模型,结合双基地雷达的探测判决条件,运用空间区域划分的方法对隐身目标进行实时信息采集;建立了理想条件下双基地雷达平面上隐身目标的探测模型,计算并给出不同条件下双基地雷达探测范围与基线的仿真关系图;仿真分析的结果对优化双基地雷达的战术配置以及雷达组网应用具有一定的参考价值。     

汇编语言动态分析工具中的程序插装技术

根据8086/8088语言的结构化特点,提出了程序插装的概念及其实现方法,并基于插装研制出一种动态分析工具,从而实现了对程序分支及语句的自动测试功能.     

基于非合作博弈的栅栏信息覆盖虚拟节点组合算法

邻近节点通过协作感知和信息融合组成虚拟节点,能够增加信息覆盖栅栏长度.基于非合作博弈模型,设计了一种完全分布式的虚拟节点组合算法DVSF算法.DVSF算法面向栅栏信息覆盖应用,以尽量增加整个网络的信息覆盖栅栏长度为目标,将合适的邻近节点组合成虚拟节点,提升了整个网络的栅栏信息覆盖性能.仿真实验验证了DVSF算法的有效性...     

多UAV协同区域覆盖侦察方法

针对多UAV对未知区域的协同覆盖侦察问题,提出了将STC算法与在线局部调整策略相结合的区域覆盖侦察方法.通过建立无重叠覆盖区域的闭合路径,最小化了重复侦察区域,缩短了任务执行时间;通过在线局部调整保证了只要有一架UAV不出现故障,侦察任务就可以正常进行.仿真结果表明,该方法能够有效解决多UAV协同区域覆盖侦察问题,方法...     

软件可靠性数学仿真测试平台设计与研制

针对火控软件的特点和要求,研制出面向软件可靠性验证的数学仿真测试平台,并根据典型的火控程序,有效地完成了分析与测试工作.测试系统界面友好,测试结果达到设计要求.     

Sensor placement in active multistatic sonar networks

The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017