IMM-Singer模型的机动目标跟踪算法

交互式多模型(IMM)算法是一种有效机动目标跟踪算法,但其性能与模型的选择、个数以及参数有关。Singer模型算法可以实现对机动目标的跟踪,但该算法存在机动频率和过程噪声大小等参数难以选取的问题。针对以上情况,利用IMM算法易于结合其他算法的特点,提出一种基于IMM-Singer模型的机动目标跟踪算法,实现Singer模型参数的自适应选择。仿真结果表明,该算法比单一的Singer模型算法或一般的IMM算法更能有效提高机动目标跟踪精度。     

舰艇红外隐身技术的探讨

舰艇红外隐身技术在现代战争中发挥着越来越重要的作用.定性描述了舰艇的主要红外辐射源,定量分析了舰艇和背景的红外辐射特征,通过分析舰艇对红外隐身的要求,结合舰艇红外隐身的发展现状,研究了舰艇红外隐身技术所采取的措施.     

舰船航渡过程中的松弛时间与航渡策略问题

针对舰船特点和任务要求,提出了舰船航渡中的松弛时间问题。在对问题分析的基础上,给出了松弛时间的定义并对其进行了建模,讨论了航渡失败的判断准则,给出了松弛时间的上下限以及航渡中实际的松弛时间的计算方法,并采用仿真的方法进行了典型航渡过程的松弛时间和成功概率的计算。在大量计算的基础上,初步探讨了航渡成功概率与各类航渡参数之间的关系,并对舰船最优航渡策略问题进行了初步分析,最后对于优化目标、计算初值、结果的表达方式等提出了一个可行的解决方案。     

一类微分方程组极限环的不存在性

在系统奇点唯一的条件下,研究了一类微分方程组不存在极限环的的充分条件,运用和发展了以往的结果。     

战场环境下无人车辆战术机动路径规划方法

针对不同类型威胁体存在的战场环境中无人车辆战术机动路径规划问题,提出了一种基于威胁代价地图的粒子群优化（Particle Swarm Optimization,PSO）方法。借助极坐标系中关键点的极角进行路径描述,并使用分段3次Hermite插值方法形成光滑路径,将路径规划问题转化为关键点极角的参数优化问题。针对基本PSO（BPSO）算法存在的早熟收敛和后期迭代效率低的缺陷,借鉴以群集方式生活的物种按照不同任务对种群进行分工的机制,提出了一种基于多任务子群协同的改进粒子群优化（Particle Swarm Optimization based on the Multi—tasking Subpopu—lation Cooperation,PSO-MSC）算法。借助该算法的快速收敛和全局寻优特性实现了最优路径规划。实验结果表明：该算法可以快速有效地实现战场环境下无人车辆的战术机动路径规划,且规划路径安全、平滑。     

Evaluation of effectiveness of polymer coatings in reducing blast-induced deformation of steel plates

Incorporating elastomers such as polymers in protective structures to withstand high energetic dynamic loads, has gained significant interest. The main objective of this study is to investigate the influence of a Polyurea coating towards the blast-induced response in steel plates. As such, Polyurea coated steel plates were tested under near-field blast loads, produced by the detonation of 1 kg of spherical nitromethane charges, at a standoff distance of 150 mm. Mild steel (XLERPLATE 350) and high-strength steel (BIS80) plates with thicknesses of 10 mm were Polyurea coated with thicknesses of 6 mm and 12 mm on either the front (facing the charge) or the back face. The deformation profiles were measured using 3D scanning. Numerical simulations were performed using the non-linear finite element code LS-DYNA. The strain-dependent behaviour of the steel and Polyurea were represented by Johnson-cook and Money-Rivlin constitutive models, respectively. The numerical models were validated by comparing the plate deflection results obtained from the experiments and were then used in the subsequent parametric study to investigate the optimum thickness of the Polyurea coating. The results indicate that back face coating contributes towards an approximately 20% reduction in the residual deformation as well as the absence of melting of the Polyurea layer, while the front-face coating can be used a means of providing additional standoff distance to the steel plates.     

基于分布式协调算法的多导弹网络避障

提出一种避障的多导弹网络协调算法.为了实现协同拦截,制导采用目标捕获、时间协调和避障3个独立条件.即使多导弹网络中的某一部件也只能从最近的邻居处收集信息,分布式协调算法可使一组拦截导弹同时到达目标.仿真结果表明,该制导策略为多导弹网络的避障提供了一种可行方法,具有良好的目标捕获精度.讨论了增益参数的影响,以评估所提出的方法.     

Bayesian inference for a Lanchester type combat model

We undertake inference for a stochastic form of the Lanchester combat model. In particular, given battle data, we assess the type of battle that occurred and whether or not it makes any difference to the number of casualties if an army is attacking or defending. Our approach is Bayesian and we use modern computational techniques to fit the model. We illustrate our method using data from the Ardennes campaign. We compare our results with previous analyses of these data by Bracken and Fricker. Our conclusions are somewhat different to those of Bracken. Where he suggests that a linear law is appropriate, we show that the logarithmic or linear‐logarithmic laws fit better. We note however that the basic Lanchester modeling assumptions do not hold for the Ardennes data. Using Fricker's modified data, we show that although his “super‐logarithmic” law fits best, the linear, linear‐logarithmic, and logarithmic laws cannot be ruled out. We suggest that Bayesian methods can be used to make inference for battles in progress. We point out a number of advantages: Prior information from experts or previous battles can be incorporated; predictions of future casualties are easily made; more complex models can be analysed using stochastic simulation techniques. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 541–558, 2000     

Heuristic scheduling of resource-constrained projects with cash flows

Resource-constrained project scheduling with cash flows occurs in many settings, ranging from research and development to commercial and residential construction. Although efforts have been made to develop efficient optimal procedures to maximize the net present value of cash flows for resource-constrained projects, the inherent intractability of the problem has led to the development of a variety of heuristic methods to aid in the development of near-optimal schedules for large projects. This research focuses on the use of insights gained from the solution of a relaxed optimization model in developing heuristic procedures to schedule projects with multiple constrained resources. It is shown that a heuristic procedure with embedded priority rules that uses information from the revised solution of a relaxed optimization model increases project net present value. The heuristic procedure and nine different embedded priority rules are tested in a variety of project environments that account for different network structures, levels of resource constrainedness, and cash-flow parameters. Extensive testing with problems ranging in size from 21 to 1000 activities shows that the new heuristic procedures dominate heuristics using information from the critical path method (CPM), and in most cases outperform heuristics from previous research. The best performing heuristic rules classify activities into priority and secondary queues according to whether they lead to immediate progress payments, thus front loading the project schedule. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 365–381, 1997     

Nonpreemptive scheduling of independent tasks with prespecified processor allocations

In this article we study the problem of scheduling independent tasks, each of which requires the simultaneous availability of a set of prespecified processors, with the objective of minimizing the maximum completion time. We propose a graph-theoretical approach and identify a class of polynomial instances, corresponding to comparability graphs. We show that the scheduling problem is polynomially equivalent to the problem of extending a graph to a comparability graph whose maximum weighted clique has minimum weight. Using this formulation we show that in some cases it is possible to decompose the problem according to the canonical decomposition of the graph. Finally, a general solution procedure is given that includes a branch-and-bound algorithm for the solution of subproblems which can be neither decomposed nor solved in polynomial time. Some examples and computational results are presented. © 1994 John Wiley & Sons, Inc.