多架无人机协同作战的路径规划

提出了一种协调多架无人机的编队同时到达目标的航路规划方法.首先根据敌方防御区域内雷达、导弹等威胁阵地的具体分布情况,采用划分Voronoi多边形的方法制定初始航路,然后通过叠加定长线段到初始航路上对初始航路进行离散化,最后采用动态链类比法调整航路并对航路进行光顺优化处理,使航路安全可飞.并用数字仿真技术对该方法进行了验证,结果表明该方法是可行的.     

天基预警系统资源调度方法

对面向导弹预警任务的天基预警系统中的低轨卫星资源调度问题进行了研究.对预警任务的特性进行分析,提出了一种预警任务规划与分解方法以减少任务对资源占用时间的需求;在此基础上建立了该问题的约束满足CSP调度模型;针对该模型变量多、解空间规模庞大的特点以及对求解算法时效性的要求,设计了一种基于局部解空间跳出机制的改进型遗传算法MGA.仿真表明该模型与算法在给定时间内能够得到满意的调度方案.     

装甲装备战斗毁伤模拟策略研究

战损规律数据是装备寿命周期各项BDAR工作的重要依据,结合物理试验数据进行战斗毁伤模拟是获取战损数据的重要途径,随着新技术手段的不断出现为探索毁伤模拟方法提供了新的契机.为此归纳总结了装甲装备战斗毁伤模拟的问题特征,综述了国内外的研究现状并剖析了现行方法对问题的解决程度,在此基础上提出了引入复杂系统的研究方法,基于三维元胞自动机和Agent技术建立了模型的仿真框架,说明了依据该方法进行问题研究的有效性和前瞻性.     

Clustered coverage orienteering problem of unmanned surface vehicles for water sampling

This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites.     

Optimal source placement for point coverage in active multistatic sonar networks

The allocation of underwater sensors for tracking, localization, and surveillance purposes is a fundamental problem in anti-submarine warfare. Inexpensive passive receivers have been heavily utilized in recent years; however, modern submarines are increasingly quiet and difficult to detect with receivers alone. Recently, the idea of deploying noncollocated sources and receivers has emerged as a promising alternative to purely passive sensor fields and to traditional sonar fields composed of collocated sources and receivers. Such a multistatic sonar network carries a number of advantages, but it also brings increased system complexity resulting from its unusual coverage patterns. In this work, we study the problem of optimally positioning active multistatic sonar sources for a point coverage application where all receivers and points of interest are fixed and stationary. Using a definite range sensor model, we formulate exact methods and approximation algorithms for this problem and compare these algorithms via computational experiments. We also examine the performance of these algorithms on a discrete approximation of a continuous area coverage problem and find that they offer a significant improvement over two types of random sensor deployment.     

Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

Noncooperative cost spanning tree games with budget restrictions

We extend the noncooperative game associated with the cost spanning tree problem introduced by Bergantiños and Lorenzo (Math Method Oper Res 59(2004), 393–403) to situations where agents have budget restrictions. We study the Nash equilibria, subgame perfect Nash equilibria, and strong Nash equilibria of this game. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008     

一种用于SEAD任务的改进型Voronoi图

根据雷达所在位置构造Delaunay三角形,取它的外心作为Voronoi图的顶点,构造常规Voronoi图,使用随机搜索算法可以为无人战斗机规划安全路径。由于战场环境威胁各异,使用常规Voronoi图不再能表征真实的SEAD任务,增大了无人战斗机的威胁,本文提出了一种新的Voronoi图的改进方法,以提高无人战斗机在执行SEAD任务时的生存概率。首先,根据可能出现的各种情况进行了分析,提出了改进型Voronoi图的构图原则。然后,提出了在不同威胁体下,基于"Delaunay多边形"构造改进型Voronoi图的方法。最后,进行了仿真。仿真算例的结果验证此方法可以明显地提高无人战斗机的生存概率。     

公安派出所消防监督工作现状及问题分析

结合公安派出所消防监督工作现状,深入分析了当前在落实派出所消防监督管理职责方面存在的突出问题,就进一步提高和加强基层公安派出所消防监督管理工作提出了具体意见和建议。     

部队基层思想政治教育中亟待解决的几个问题

贯彻落实新的《军队思想政治教育大纲》,部队基层必须着力解决重视不够、摆位不正的问题,转变与时代不相符的思想政治教育观念,创新和改进思想政治教育的内容和手段,提升思想政治教育队伍的综合素质,创新和完善思想政治教育机制,进一步优化思想政治教育环境。