三点等间隔线列阵目标定位存在唯一解的充要条件

简要介绍了三点等间隔线列阵目标定位的原理,证明了目标定位存在唯一解的充要条件是:τ12≠τ23,并给出了它的等价条件,为战斗使用线列阵提供科学选择.同时,指出了时延的距离表达式在不同文献中形式不一致的原因;给出了m个水听器时,由时延进行目标定向的公式.     

基于RBF网络的导弹攻击区解算及对比分析

研究了神经网络在空空导弹攻击区处理中的运用,在提出多层前馈(MF)网络和径向基函数(RBF)网络设计方案的基础上,着重对MF网络的BP算法、改进BP算法以及RBF网络的应用进行了仿真,并从收敛速度、逼近精度和实时性三个方面,对计算结果进行了对比分析,结论表明RBF网络在导弹攻击区处理中具有更高的可行性,更适用于快速高精度的火控解算。     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

吸气式高超声速飞行器助推分离过程数值仿真

针对吸气式高超声速冲压发动机验证性试验特殊的飞行环境和助推分离条件,以某轴对称吸气式高超声速飞行器级间分离问题为具体研究对象,采用非结构网格局部网格重构技术和非定常问题非定常六自由度问题仿真方法,对该复杂构型飞行器助推分离过程进行数值计算。研究得到弱干扰冷态分离状态下飞行器及助推器的运动参数和气动力参数在分离过程中的发展规律。对0.3 s内助推器的位移轨迹进行分析,判断分离方案的可行性,并给出最佳的分离工况条件。     

BDS/INS紧组合三频动对动模糊度解算方法

针对伪距观测噪声较大导致动对动条件下三频整周模糊度解法(Three Carrier Ambiguity Resolution, TCAR)模糊度解算不可靠的问题,提出了一种BDS/INS紧组合三频动对动整周模糊度解算方法。通过紧组合系统输出的高精度位置坐标,估算出双差几何距离值,并用其分别代替无几何和几何模式下的双差伪距观测值,显著降低了伪距双差观测噪声水平,有效提高了三频整周模糊度解算成功率。仿真实验结果表明,BDS/INS紧组合输出的高精度位置坐标使得伪距观测精度提高了60%以上,在短基线条件下,当伪距观测噪声达到2 m时,无几何模式下的TCAR算法模糊度解算成功率为0.73%,几何模式下的TCAR算法模糊度解算成功率为31.25%,而BDS/INS紧组合的TCAR算法在两种模式下的模糊度解算成功率达到99%以上,并且获得了厘米级的相对定位精度。     

考虑地球非球形引力摄动影响的自由段弹道解析解

针对地球非球形引力摄动影响下的自由段弹道快速计算问题,在非正交坐标系内建立考虑J2项摄动的地球引力作用下的运动微分方程,在轨道坐标系内建立扰动引力作用下的运动微分方程,并计算天向扰动引力加速度对应的质量偏差,进而通过椭圆轨道以修正J2项摄动运动微分方程;在建立上述运动微分方程解析解的基础上,给出了地心坐标系内弹道飞行器位置和绝对速度的表达式,从而提出了J2项摄动引力和扰动引力作用下的自由段弹道解析计算方法。仿真分析表明:该方法具有较高的计算效率,落点位置偏差小于20 m,满足弹道飞行器高精度实时制导、轨迹预测等应用需求。     

一类二阶Hamilton系统周期解的存在性

Hamilton系统是非线性科学中的一个重要领域,很多人在超二次或次二次条件及其他一些条件下对Hamilton系统的周期解进行了研究。此文则研究了非自制二阶Hamilton系统在零点局部环绕及“非二次”条件下周期解的存在性,并利用局部紧性条件(C)条件以及极大极小方法证明了其周期解的存在性。     

GPS和类GPS测距技术联合用于双星编队星座的状态确定

编队卫星状态的高精度确定是编队星座功能实现的重要基础。针对对地观测的双星编队星座的状态确定问题,为了提高状态确定的精度,在GPS技术的基础上,引入了类GPS测距技术,建立了联合GPS和类GPS测距技术进行状态整体确定的两种数学模型,并讨论了GPS星间单差模糊度和类GPS星内单差模糊度的同时初始化方法,最后进行了数值仿真。仿真结果显示,类GPS观测值尤其是类GPS星内载波单差观测值的引入,明显提高了双星编队星座的状态确定精度,其中绝对姿态角的精度达到rad,相对位置的精度达到m,相对钟差的精度达到s。仿真证明方法正确有效,模型二更优于模型一。     

一类时滞微分方程正周期解的存在性

讨论了一类生物模型正周期解的存在性问题,利用Mawhin延拓定理得到了系统存在正周期解的一个充分条件。而且,当系统为无穷时滞时,结论也是成立的。     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.