带三维落角约束的寻的导弹制导与姿控系统设计

针对带三维落角约束的寻的导弹制导与姿态控制系统设计问题,提出一种基于终端滑模控制和扩张状态观测器的六自由度制导控制系统设计方法。建立包含模型不确定项的寻的导弹六自由度质心与绕质心模型,设计内外双层环路六自由度制导控制系统框架;基于弹-目三维相对运动模型和坐标系转移矩阵建立以攻角和侧滑角为输入的三维全耦合导引方程,利用终端滑模控制方法和扩展状态观测器得到期望的攻角和侧滑角并将其转化为对应的俯仰、偏航和滚转角指令;根据线性形式的寻的导弹绕质心动力学方程,设计与俯仰、偏航和滚转角相关的滑模面向量,并利用终端滑模控制方法和扩张状态观测器得到寻的导弹的副翼偏角、方向舵偏角和俯仰舵偏角指令。六自由度数值仿真结果验证了该方法的有效性和鲁棒性,并证明了该制导控制系统设计方法能以较少的控制设计参数完成预设的制导控制任务。     

平流层飞艇抗风场干扰约束Unscented卡尔曼滤波算法设计与应用

为了提高风场干扰环境下飞艇的导航精度,研究飞艇抗风场干扰导航算法。在建立风场干扰条件下飞艇速度误差约束模型的基础上,设计抗风场干扰的约束Unscented卡尔曼滤波算法。确定风场干扰条件下飞艇的速度误差约束量,将该约束与Unscented卡尔曼滤波算法相结合,对速度误差进行估计和补偿,以减小风场对飞艇定位精度的影响;证明该算法的状态估计量不仅是无偏的,而且协方差小于标准Unscented卡尔曼滤波的协方差;将提出的算法应用于捷联惯导/天文/合成孔径雷达组合导航系统中进行仿真验证,并与自适应扩展卡尔曼滤波和抗差自适应Unscented卡尔曼滤波算法进行比较。结果表明:提出的约束Unscented卡尔曼滤波算法的滤波性能明显优于自适应扩展卡尔曼滤波和抗差自适应Unscented卡尔曼滤波算法,能够有效抑制风场对飞艇定位精度的影响,提高飞艇的导航定位精度。     

基于引导员负荷的指挥引导容量评估

针对目前传统指挥引导容量评估不准确的问题,通过对空战指挥引导容量与引导员负荷的综合分析,提出了基于引导员负荷的指挥引导容量评估方法。基于引导员负荷重新定义了指挥引导容量,给出了引导员负荷的确定方法,并建立了指挥引导容量评估模型。最后对某指挥机构进行实例评估,评估结果表明所提出的指挥引导容量评估方法将评估误差控制在1批之内。     

基于Delphi-BP神经网络的装备保障能力评估

针对评估指标数量过多可能给评估过程及结果带来的弊端,在构建装备保障能力评估指标体系基础上,给出了基于Delphi法的指标体系筛选的方法步骤,通过计算累计贡献率,对指标体系进行了筛选,降低了评估模型的输入维度。建立了评估部队装备保障能力的三层BP神经网络模型,利用Matlab神经网络工具箱对网络进行了训练和仿真,结果显示误差小于10-3。最后,通过对比评估,验证了方法的有效性和正确性。     

装备体系核心保障能力分析

明确了装备体系和核心保障能力的概念内涵。针对核心保障能力的评价问题,从评价参数和评价方法两个方面入手,系统整理了国内外开展关于核心保障能力的问题特点和研究进展,总结了现有研究成果,通过对照比较,指出了现有研究中存在的不足之处。在此基础上,从装备体系核心保障能力评价问题的外军研究成果、基础理论、系统分析和保障仿真技术4个方面,提出了后续的研究建议,对于相关科研人员具有参考和借鉴意义。     

正确认识信息化战争的制胜机理

习主席强调,研究作战问题核心是要把现代战争的特点规律和制胜机理搞清楚。深刻认识信息化战争的五个时代特征,准确把握特点规律,真正搞清信息化战争的五个制胜机理,在将信息化建设成果转化为现实战斗力的过程中做到五个坚持,对于做好军事斗争准备,打赢信息化战争具有重要意义。     

新型PBL键外包钢-混凝土组合梁抗弯承载力简化计算

基于理论分析,建立了新型PBL键外包钢-混凝土组合梁抗弯承载力计算的基本假定和计算模型,推导出组合梁抗弯承载力的简化计算公式,并采用有限元分析软件ANSYS14.5对组合梁进行了非线性有限元分析.对比分析表明:新型PBL键外包钢混凝土组合梁抗弯承载力的试验值、简化计算值和模拟分析值吻合较好.     

Approximation algorithms for capacitated stochastic inventory systems with setup costs

We develop the first approximation algorithm with worst‐case performance guarantee for capacitated stochastic periodic‐review inventory systems with setup costs. The structure of the optimal control policy for such systems is extremely complicated, and indeed, only some partial characterization is available. Thus, finding provably near‐optimal control policies has been an open challenge. In this article, we construct computationally efficient approximate optimal policies for these systems whose demands can be nonstationary and/or correlated over time, and show that these policies have a worst‐case performance guarantee of 4. We demonstrate through extensive numerical studies that the policies empirically perform well, and they are significantly better than the theoretical worst‐case guarantees. We also extend the analyses and results to the case with batch ordering constraints, where the order size has to be an integer multiple of a base load. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 304–319, 2014     

Violence and the state: Lessons from Colombia

Whether or not Colombia has improved is a controversial topic. If improvement has occurred, what, if any, lessons from the Colombian model can be learned? The first lesson is that Colombia's problems were caused more by a weak state than by drugs. The second lesson is that improving state capacity requires more than just increased security. The state must also provide the basic social services that citizens require to gain and maintain their support. Additionally, government institutions need to improve their professionalism, protect human rights, and root out impunity and corruption. The alternative is to suffer from new cycles of violence as old foes are vanquished, but new ones emerge.     

Optimal service‐capacity allocation in a loss system

We consider a loss system with a fixed budget for servers. The system owner's problem is choosing the price, and selecting the number and quality of the servers, in order to maximize profits, subject to a budget constraint. We solve the problem with identical and different service rates as well as with preemptive and nonpreemptive policies. In addition, when the policy is preemptive, we prove the following conservation law: the distribution of the total service time for a customer entering the slowest server is hyperexponential with expectation equal to the average service rate independent of the allocation of the capacity. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 81–97, 2015