一类非线性控制系统模型的数学分析

采用非线性分析的方法,研究了一类非线性控制系统模型,得到解的整体存在性。     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

采用PWPF调节器的再入飞行器最优控制分配方法

针对具有反作用控制系统(Reaction Control System,RCS)和气动舵两类控制机构的再入飞行器,提出一种基于脉宽脉频(Pulse-Width Pulse-Frequency,PWPF)调节器的最优控制分配方法。将RCS的输入信号转化为连续变化量,RCS与气动舵的控制分配问题被描述为二次规划问题,并采用有效集方法对其求解。采用离散法和PWPF调节器将优化结果转化为RCS的开关机状态。与混合整数规划问题相比,连续二次规划问题更容易求解,计算速度更快。通过对二次规划问题的重构,该算法能有效地应对故障情况。     

船舶静态电场跟踪的渐进更新扩展卡尔曼滤波器

为了实现利用船舶静态电场对船舶进行跟踪的目的,针对传统卡尔曼滤波算法中存在的问题,设计一种新的非线性滤波器。建立船舶的状态空间模型,分析传统卡尔曼滤波算法在船舶跟踪中存在的问题;依据渐进贝叶斯思想,利用连续白噪声与离散白噪声序列噪声协方差之间的关系,设计一种新的渐进更新扩展卡尔曼滤波器。仿真结果表明,该滤波器能有效地抑制由于初始误差较大而造成的滤波性能下降和滤波发散,能够有效地跟踪船舶,具有较高的实用价值。     

一类带时滞的非线性兰彻斯特战斗模型的分析

基于非线性兰彻斯特方程的一般形式和现代战争的特点,考虑到时间因素在现代战争中的巨大作用,建立并讨论了一类带时滞的非线性兰彻斯特战斗模型。通过定性分析,得到了模型的平衡点及其稳定性,证明了原模型解的存在唯一性,并给出了解的存在区域。战例分析结果表明该模型能用来描述现代战争。因此,该模型对研究现代战争的战斗进程、武器发展规划、现代军事练兵等都具有一定的参考价值。     

基于粒子滤波的目标跟踪抗野值算法

运用粒子滤波对目标位置进行跟踪时,测量数据的异常突变点、目标的机动转弯、粒子数量的制约和重要性密度函数的优劣都会导致估计误差较大的野值出现,这将严重影响雷达对目标的跟踪精度。现有的野值剔除方法在目标发生机动时,都存在误剔率较高的问题。针对这个问题,采用莱特准则与机动门限准则相结合的方法,提出了不确定观测点的概念,设计了一种适用于机动目标的抗野值粒子滤波算法。仿真结果表明,该方法能较好地检测和更新野值,降低跟踪误差,提高跟踪精度。     

胶泥缓冲器的非线性阻尼的控制机理研究

为了改善履带车辆悬挂系统在各种路面的平顺性,对悬挂系统匹配了一款具有非线性特性的粘弹性胶泥缓冲器。为了定量地研究胶泥缓冲器的非线性阻尼控制机理,建立了非线性悬挂系统的动力学方程,将非线性时滞动力系统的随机最优控制规律应用于履带车辆悬挂系统,建立了车辆垂直振动加速度与车速、路况与阻尼比之间的数学关系,从理论上推导出了最佳阻尼比。最后,对履带车辆在F级和G级路面上进行了仿真分析来验证胶泥缓冲器的非线性阻尼的变化规律,结果表明,在0.07~0.18范围内调控阻尼比,可以使车体垂直振动加速度最小。该研究工作为胶泥缓冲器的优化设计和胶泥材料的配方提供了理论指导。     

高轨双星辐射源跟踪的高斯和-容积Kalman滤波算法

针对辐射源运动方程和观测方程的强非线性,提出基于高斯和框架与5阶容积Kalman滤波(5CKF)的跟踪算法GS-5CKF。该方法将起始时刻的时差观测量所确定的位于地球表面的时差线按经度等间隔划分,初始化多个并行的5CKF,线性组合各滤波器的输出获得辐射源运动状态的估计。针对5CKF,提出新的非线性测度并引入滤波器分裂与合并,从而提高了跟踪精度,同时保持GS-5CKF算法复杂度基本不变。仿真表明,相对仅使用单个5CKF和基于高斯和框架但使用3阶容积Kalman滤波器的GS-3CKF等方法,提出的算法具有更高的估计精度。