正则化方法在拉普拉斯数值反演中的应用

本文用正则化方法给出了拉普拉斯变换的数值反演方法,并考虑了问题的不适定性,此方法在实际中有较强的应用价值.     

一个人机瞄系统的非线性分析设计

讨论了一个人机瞄系统的非线性分析设计。首先建立了人机瞄系统的非线性模型,然后采用反馈线性化方法,利用状态反馈,完全抵消了非线性因素对系统输出的影响,实现了系统输入－输出的严格线性关系和解耦控制,再利用线性系统方法,进行了系统的极点配置,使系统具有希望的跟踪性能,最后提出有待于深入研究的内容。     

新型角速率火控系统研究

根据激光测距仪获得的目标斜距,建立实时确定目标速度和过航斜距的数学模型,并提出解决角速率火控系统中普遍存在的计算延迟、预测精度不高和弹道气象修正困难等问题的方案。     

用正则化方法对频谱有限信号进行外推的新算法

本文给出了频谱有限信号外推的一个新算法,首先考虑了问题的不适定性,然后用正则化方法构造一个稳定算法,因本文把噪音η(t)看成是L~2〔-T,T〕(T > 0)中的函数,且当integral from n=-T to T (|η(t)|~2dt→0时,外推在(-∞, ∞)上一致逼近准确信号,所以有较强的应用价值.最后还给出了外推的误差估计.     

Allocation with demand competition: Uniform,proportional, and lexicographic mechanisms

We examine capacity allocation mechanisms in a supply chain comprising a monopolistic supplier and two competing retailers with asymmetric market powers. The supplier allocates limited capacity to retailers according to uniform, proportional, or lexicographic mechanism. We study the impact of these allocation mechanisms on supplier pricing decisions and retailer ordering behavior. With individual order size no greater than supplier capacity, we show that all three mechanisms guarantee equilibrium ordering. We provide precise structures of retailer ordering decisions in Nash and dominant equilibria. Further, we compare the mechanisms from the perspective of the supplier, the retailers, and the supply chain. We show that regardless of whether retailer market powers are symmetric, lexicographic allocation with any priority sequence of retailers is better than the other two mechanisms for the supplier. Further, under lexicographic allocation, the supplier gains more profit by granting higher priority to the retailer with greater market power. We also extend our study to the case with multiple retailers. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 85–107, 2017     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017     

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

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

临近空间高超声速目标跟踪技术研究

由于临近空间高超声速目标具有高速度、高机动的特点,对此类目标的跟踪是一个研究热点问题。提出了一种基于容积卡尔曼滤波的临近空间目标跟踪方法,首先分析临近空间高超声速目标的运动特性,建立了临近空间高超声速目标的运动模型。然后通过三站测得时差信息,实现了对临近空间目标的跟踪。最后,对提出的算法与扩展卡尔曼滤波和不敏卡尔曼滤波进行了综合性能对比分析,并通过仿真结果验证了该算法的实时性有效性。     

三维半线性波动方程初值问题解的破裂

研究了半线性波动方程初值问题在三维空间中解的生命跨度的上界估计,关于此初值问题的爆破解将被建立。无论多么小的初值,该问题都没有整体解,在前人研究的基础上给出该初值问题解的生命跨度的上界估计。     

边缘化粒子概率假设密度滤波的多目标跟踪

针对复杂情况下的多目标跟踪问题,提出一种边缘化粒子概率假设密度滤波(MPF-PHD)方法。该方法首先将复杂情况下多个目标的状态向量分别提取出其中的非线性状态与线性状态。然后利用粒子概率假设密度滤波(PF-PHD)估计非线性状态,利用卡尔曼滤波(KF)估计线性状态,并把其中与非线性状态相关的线性状态估计用来优化非线性状态估计。通过对MPF-PHD方法与传统的PF-PHD方法仿真对比,验证了MPF-PHD方法有效解决了复杂情况下多目标跟踪的漏检问题,提高了多目标状态估计精度。