任务规划系统研究综述

任务规划系统作为举世瞩目的高科技技术,已经引起了广泛的关注和应用.目前世界上一些主要国家都在研制任务规划系统,且进展很快.为了更好地推进我国学者对于任务规划系统的研究,对任务规划系统的研究进行了全面综述.主要内容包括任务规划系统的发展、应用、主要实现方法及未来发展方向.在应用中,综述了任务规划系统在战场态势评估、无人飞行器、机器人领域的应用.在主要实现方法中,主要描述了数学规划、D*优化算法、Agent方法和遗传算法四种方法.最后给出了任务规划系统未来发展方向:现代技术的融合、发展战略级任务规划系统及未来社会任务规划系统预研.     

基于DEA系统下的武器装备采办理论及运用

数据包络分析DEA(data envelopment analysis)系统主要是针对武器装备性能的论证和武器装备采办提供相应的分析工具。介绍了该系统组成及DEA模型算法的基本思路,分析了武器装备采购费用的相对有效性,并简要阐述了该系统在军事领域的应用前景。     

Coordinated replenishments from multiple suppliers with price discounts

In this study we present an integer programming model for determining an optimal inbound consolidation strategy for a purchasing manager who receives items from several suppliers. The model considers multiple suppliers with limited capacity, transportation economies, and quantity discounts. We propose an integrated branch and bound procedure for solving the model. This procedure, applied to a Lagrangean dual at every node of the search tree, combines the subgradient method with a primal heuristic that interact to change the Lagrangean multipliers and tighten the upper and lower bounds. An enhancement to the branch and bound procedure is developed using surrogate constraints, which is found to be beneficial for solving large problems. We report computational results for a variety of problems, with as many as 70,200 variables and 3665 constraints. Computational testing indicates that our procedure is significantly faster than the general purpose integer programming code OSL. A regression analysis is performed to determine the most significant parameters of our model. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 579–598, 1998     

Scheduling deteriorating jobs to minimize makespan

We consider a single-machine problem of scheduling n independent jobs to minimize makespan, in which the processing time of job J_j grows by w_j with each time unit its start is delayed beyond a given common critical date d. This processing time is p_j if J_j starts by d. We show that this problem is NP-hard, give a pseudopolynomial algorithm that runs in time and O(nd) space, and develop a branch-and-bound algorithm that solves instances with up to 100 jobs in a reasonable amount of time. We also introduce the case of bounded deterioration, where the processing time of a job grows no further if the job starts after a common maximum deterioration date D > d. For this case, we give two pseudopolynomial time algorithms: one runs in O(n²d(D − d) time and O(nd(D − d)) space, the other runs in p_j)²) time and p_j) space. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 511–523, 1998     

三维涡度方程单向周期问题的谱—差分混合格式及其误差估计

本文对非线性的三维涡度方程单向周期问题构造了一种新的谱——差分格式,并证明了格式的稳定性和收敛性。     

逐步Ⅰ型混合截尾试验下Burr部件的可靠性分析

在逐步Ⅰ型混合截尾试验下,研究了Burr部件寿命参数及可靠性指标的极大似然估计和Bayes估计.利用简单迭代方法,给出了寿命参数和可靠性指标的极大似然估计的数值解.然后利用Lindely Bayes近似算法得到了平方损失下寿命参数以及可靠性指标的Bayes估计.最后,运用Monte-Carlo方法对各估计结果作了模拟比较,结果表明Bayes估计较极大似然估计的误差小.     

酚醛-石英混杂纤维增强苯并噁嗪复合材料高温失效特征

通过模压工艺制备了酚醛-石英混织纤维增强苯并噁嗪复合材料(P-Q/BZ)试样,考察了其力学性能、烧蚀性能和耐冲刷性能,分析了该试样在高温环境中的主要失效特征,研究其在高温环境中的适用性。结果表明,未经热处理的P-Q/BZ试样平均弯曲强度、弯曲模量和层间剪切强度分别为283 MPa、10.8 GPa和22.6 MPa;经300℃,N_2处理15 min后,试样均匀膨胀,厚度增加22%,弯曲强度、弯曲模量和层间剪切强度分别下降58%、41%和58%;在氧乙炔焰的平均质量烧蚀率和线烧蚀率分别为0.048 4 g/s和-0.081 mm/s,烧蚀后试样宏观不分层,表面炭层微观分层严重,酚醛纤维热解炭、树脂基体热解炭、熔融石英纤维以及碳硅氧化产物相互分离;该试样耐冲刷能力差,在发动机尾焰烧蚀平台模拟的热-力耦合环境中的质量损失率高达59%。P-Q/BZ复合材料需要解决热解膨胀问题,进一步提高抗冲刷性能。     

The Damoclean sword of offensive cyber: Policy uncertainty and collective insecurity

Cyberspace is a new domain of operation, with its own characteristics. Cyber weapons differ qualitatively from kinetic ones: They generate effects by non-kinetic means through information, technology, and networks. Their properties, opportunities, and constraints are comparable to the qualitative difference between conventional and nuclear weapons. New weapons and their target sets in a new domain raise a series of unresolved policy challenges at the domestic, bilateral, and international levels about deterrence, attribution, and response. They also introduce new risks: uncertainty about unintended consequences, expectations of efficacy, and uncertainty about both the target’s and the international community’s response. Cyber operations offer considerable benefits for states to achieve strategic objectives both covertly and overtly. However, without a strategic framework to contain and possibly deter their use, make state and non-state behavior more predictable in the absence of reciprocal norms, and limit their impact, an environment where states face persistent attacks that nonetheless fall below the threshold of armed conflict presents a policy dilemma that reinforces collective insecurity.     

The Russian hybrid warfare strategy – neither Russian nor strategy

Following Russia’s annexation of Crimea and its initial actions in eastern Ukraine in 2014, the term hybrid warfare has received much public attention. Many have argued that the Russian actions we saw in Ukraine were part of a completely new strategy while others have suggested that there was nothing new in Russia’s actions. This article takes a critical look at these claims. Through the assessment of the history of the term hybrid warfare and a rigorous analysis of the so-called Gerasimov doctrine, this study finds that the Russian hybrid warfare strategy is rather a western myth than a formal comprehensive Russian strategic concept. Additionally, through the assessment of the Russian use of information operations and the way she has utilised the cyberspace in several recent conflicts, the study finds that against all claims Russia did not make these areas its main battlefield, but rather has been using them in support of its traditional concepts.     

Robust shortest path planning and semicontractive dynamic programming

In this article, we consider shortest path problems in a directed graph where the transitions between nodes are subject to uncertainty. We use a minimax formulation, where the objective is to guarantee that a special destination state is reached with a minimum cost path under the worst possible instance of the uncertainty. Problems of this type arise, among others, in planning and pursuit‐evasion contexts, and in model predictive control. Our analysis makes use of the recently developed theory of abstract semicontractive dynamic programming models. We investigate questions of existence and uniqueness of solution of the optimality equation, existence of optimal paths, and the validity of various algorithms patterned after the classical methods of value and policy iteration, as well as a Dijkstra‐like algorithm for problems with nonnegative arc lengths.© 2016 Wiley Periodicals, Inc. Naval Research Logistics 66:15–37, 2019