美国无人机助推段拦截计划的拦截弹方案

美国国防部弹道导弹防御局正在管理着美国的无人机助推段拦截计划。这项计划的目的是研究无人机携带拦截弹的潜力,以便对战区弹道导弹提供一个助推段防御层。为了确定无人机助推段拦截系统的要求,正在进行技术评估和风险减小工作。空军器材司令部空间与导弹系统中心先进系统部已被选定为领导该种抛头该种拦截弹的“综合产品组”。     

弹道导弹自由段拦截窗口建模与仿真

为有效应对战术弹道导弹的威胁,必须提高拦截系统对目标的预警和探测能力。合适的拦截窗口对拦截效果将起到关键作用。根据拦截窗口的定义,给出了最早拦截点与最晚拦截点的确定方法;提出了通过弹道导弹的飞行弹道求解自由段拦截窗口的计算方法。并以弹道导弹为拦截目标进行了仿真分析。算例仿真说明,拦截弹的拦截低界以及弹道导弹的关机点速度是影响拦截窗口的主要因素。     

一种适用于地基拦截弹高空拦截弹道导弹的制导方法

研究了地基拦截弹高空拦截中近程弹道导弹的制导方法。首先,对目标预测拦截点进行拦截的拦截弹运载段的制导方案进行了研究,给出了一级飞行程序模型和二级导引规律,同时提出了一种确定目标预测拦截点的方法,并通过仿真分析论证了方案的可行性。     

大气层内姿控反导导弹末端控制技术研究

未来战争是高技术战争,随着战术弹道导弹(TBM)及其技术的发展,TBM已成为现代战争中的核心武器,与此同时TBM的使用也对防空系统构成了严重的威胁,所以有效拦截TBM已成为现代防空作战的重要任务之一。TBM具有高速大机动的特点,因此拦截弹在末制导段的精确制导及复合控制是保证拦截弹最终完成摧毁效果的关键。总结了拦截弹末制导的情况,建立了拦截弹数学模型,设计了直接力/气动力复合控制系统,最后对拦截弹末制导段进行了仿真。结果表明,所设计的制导控制系统具有很强的自适应性和鲁棒性,制导精度满足要求。     

基于Petri网的弹道导弹攻防对抗仿真系统CGF模型

作为弹道导弹攻防对抗仿真系统的重要组成部分,弹道导弹拦截CGF是一个具有分布、并发、异步等特性的复杂仿真系统,而Petri网是描述具有此类特性系统的有效工具。通过对典型弹道导弹拦截系统作战过程的分析,基于Petri网建立弹道导弹拦截CGF各组成部分的模型,进而建立弹道导弹拦截CGF的整体模型,并通过仿真分析,验证了模型的有效性。     

"标准-3"拦截弹对机动弹头的拦截有效性分析

以"标准-3"拦截弹的多次拦截试验情况为参考,根据其能力及试验中的表现,分析其总体设计方案和各项性能参数,建立数学仿真模型.在研究海基导弹防御指挥控制流程、拦截弹动力学模型和仿真算法的基础上,对拦截具有机动突防能力的弹道导弹目标进行仿真分析.获得拦截弹对机动突防目标拦截有效性的仿真结果.分析仿真结果可知,拦截弹对机动弹头的拦截能力有限.     

反导动能拦截武器的现状与发展研究

介绍了动能拦截弹在弹道导弹防御中的应用,分助推段拦截、中段拦截、末段拦截对美国发展的动能拦截武器进行了详细说明。介绍了动能拦截弹的组成,给出了动能拦截器的关键技术,对动能拦截器技术的发展进行了阐述。     

战术导弹攻防对抗模拟

利用最小能量原理,构造一种简易战术弹道导弹(TBM)弹道用于攻防对抗仿真;依据美国"爱国者"反导导弹PAC-3基本拦截原理,构造了一种逆轨拦截反导弹道模型;利用上述攻防仿真平台,计算分析拦截弹最佳拦截制导方式(中、末制导交班点的确定),分析拦截弹过载变化情况.     

美国几种典型的动能拦截弹

自20世纪80年代以来,美国在弹道导弹防御和反卫星计划的名义下,已经论证、研究、研制和试验了各种类型的新概念动能拦截弹及其最核心的技术设备——动能拦截器(KKV): (1)部署在外层空间或空中、用于拦截助推飞行中的弹道导弹的各种动能拦截弹,如部署在空间轨道上的“天基拦截弹”(SBI)和“智能卵石”(BP)动能拦截弹,以及部署在有人驾驶飞机上的“游隼”(Peregrine)动能拦截弹方案和部署在无人驾驶飞机上的“塔伦”(Talon)动能拦截弹方案等。     

弹道导弹突防方案与拦截策略的对抗研究

对弹道导弹可能采取的饱和攻击、以假乱真、阻碍探测以及机动突防这4种突防方案和手段进行了简要分析,并针对这些方案与手段重点研究了导弹防御系统基于技术层面的4种拦截对策与设想,最后提出了对弹道导弹在助推段、中段以及末段实现多层拦截的技术方案及途径。     

A proportional defense model

This paper considers the problem of defending a set of point targets of differing values. The defense is proportional in that it forces the offense to pay a price, in terms of reentry vehicles expended, that is proportional to the value of the target. The objective of the defense is to balance its resources so that no matter what attack is launched, the offense will have to pay a price greater than or equal to some fixed value for every unit of damage inflicted. The analysis determines which targets should be defended and determines the optimal firing doctrine for interceptors at defended targets. A numerical example is included showing the relationship between the total target damage and the size of the interceptor force for different values of p, the interceptor single shot kill probability. Some generalizations are discussed.     

Attack and defense of ICBMs deceptively based in a number of identical areas

On-site verification of ICBMs in the context of an arms control agreement might involve a situation where an inspector would choose one or more of a number of identical areas to inspect and would have confidence that the other areas had the same characteristics. This article considers optimal attack and defense of missiles deceptively based in a number of identical areas. The attacker may allocate warheads across areas as he desires and uniformly within areas. The defender may allocate interceptors across areas as he desires and either uniformly or preferentially within areas. The effect of restricting the defender to uniform allocation across areas is explored for various assumptions. Robustness of surviving missiles with respect to the number of attacking warheads is studied. Results are presented for a wide range of cases.     

Layered defense of deceptively based ICBMs

The basing of ICBMs is a fundamental problem of defense analysis. Deceptive basing and antiballistic missile defense are two of the methods available to attempt to insure that there are ICBMs surviving after undergoing an attack. This article treats tradeoffs among missiles, silos or shelters, exoatmospheric interceptors, and endoatmospheric interceptors. Most of the analysis deals with 200 missiles, the number of MX missiles which were recommended to be moved among the 4600 shelters of the Multiple Protective Shelter (MPS) deployment, though some variants in the number of missiles (from 115 to 400) are also treated here. The basic reference point of the analysis is the provision of 1000 ICBM warheads delivered in a second strike. The combination of exoatmospheric interceptors and endoatmospheric interceptors is referred to as “layered defense.” Warheads are destroyed by interceptors after the warheads separate from the missile which carries them. Exoatmospheric interceptors are assumed to achieve a non-nuclear kill, while endoatmospheric interceptors are assumed to achieve either a non-nuclear or nuclear kill, depending on the technology available to both sides. Exoatmospheric interceptors may be capable of protecting value targets against the warheads of a second strike. To the extent that this can be achieved, they facilitate a first strike with relative impunity and hence are destabilizing. This article explores various layered defense topics.     

截击机作战起飞规划分析

根据截击机在优化的目标分配形式下拦截效果的概率模型,导出了截击机在拦截多攻击机机群时的最优目标分配形式,研究了机场飞机起飞架数与机场战术、技术参数、机场飞机的战术、技术参数以及与攻击机的进攻态势之间的关系,确定了多机场飞机对多攻击机机群进行最优目标分配时所应满足的量化关系,给出的模型可对作战决策过程提供理论依据     

混合攻击机机群在空战中的最优控制策略

研究了混合攻击机机群在对由截击 -歼击机机群组成的敌国土防空系统进行突防过程中的最优控制方法 ,以攻击机的最小突防损失为战效指标 ,给出了其最优控制策略。     

An examination of the effects of the criterion functional on optimal fire-support policies

This paper examines the dependence of the structure of optimal time-sequential fire-support policies on the quantification of military objectives by considering four specific problems, each corresponding to a different quantification of objectives (i.e. criterion functional). We consider the optimal time-sequential allocation of supporting fires during the “approach to contact” of friendly infantry against enemy defensive positions. The combat dynamics are modelled by deterministic Lanchester-type equations of warfare, and the optimal fire-support policy for each one-sided combat optimization problem is developed via optimal control theory. The problems are all nonconvex, and local optima are a particular difficulty in one of them. For the same combat dynamics, the splitting of supporting fires between two enemy forces in any optimal policy (i.e. the optimality of singular subarcs) is shown to depend only on whether the terminal payoff reflects the objective of attaining an “overall” military advantage or a “local” one. Additionally, switching times for changes in the ranking of target priorities are shown to be different (sometimes significantly) when the decision criterion is the difference and the ratio of the military worths (computed according to linear utilities) of total infantry survivors and also the difference and the ratio of the military worths (computed according to linear utilities) of total infantry survivors and also the difference and the ratio of the military worths of the combatants' total infantry losses. Thus, the optimal fire-support policy for this attack scenario is shown to be significantly influenced by the quantification of military objectives.     

多机协同目标与火力资源分配

在协同空战中,快速正确的空战决策是己方战机少受敌方伤害并取得战争胜利的前提。目标与火力资源分配是决策过程的重要部分。多机空战与单机空战相比有明显的不同,不同之处是面临多个敌方目标,根据我方资源最优分配作战对象和火力,基于遗传算法实现了两种算法的有人无人目标与火力资源分配。仿真结果表明,带有毁伤概率门限的算法既节省火力资源又快速有效。     

防空监视网络传感器资源分配的最优化

针对防空监视网络的传感器管理问题,讨论了传感器资源分配的最优化方法。提出了把传感器资源分配问题映射为多代理系统分布约束最优化问题的解决策略,设计了基于约束代价下界搜索的异步分枝定界最优化算法,实现了传感器资源分配问题最优解的异步并行搜索,给出的仿真实例说明了传感器资源分配最优化方法的有效性。     

A worst‐case formulation for constrained ranking and selection with input uncertainty

In this research, we consider robust simulation optimization with stochastic constraints. In particular, we focus on the ranking and selection problem in which the computing time is sufficient to evaluate all the designs (solutions) under consideration. Given a fixed simulation budget, we aim at maximizing the probability of correct selection (PCS) for the best feasible design, where the objective and constraint measures are assessed by their worst‐case performances. To simplify the complexity of PCS, we develop an approximated probability measure and derive the asymptotic optimality condition (optimality condition as the simulation budget goes to infinity) of the resulting problem. A sequential selection procedure is then designed within the optimal computing budget allocation framework. The high efficiency of the proposed procedure is tested via a number of numerical examples. In addition, we provide some useful insights into the efficiency of a budget allocation procedure.     

基于粒子群算法维修保障单元优化配置

针对维修保障单元配置过程中需权衡综合多因素问题,提出了一种基于粒子群算法的维修保障单元优化配置决策模型和方法。首先,以维修任务完成概率为设计目标、以维修保障单元总数量为约束,建立维修保障单元配置决策模型;其次,运用粒子群算法对维修保障单元配置问题进行优化求解。通过具体实例分析,证明了该方法的正确性和有效性。