一维弹道修正弹阻力环修正控制算法研究

根据一维弹道修正弹阻力环修正技术的特点,建立了一维弹道修正弹的弹道模型.在此基础上分析了利用阻力环进行一维弹道修正的能力以及阻力环张开时刻与射程修正量之间的关系.提出了阻力环张开时刻的算法.仿真结果表明,该算法具有较强的修正能力,选择合适的阻力环张开时刻,可以使弹丸的落点偏差大大减小.     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

空间拦截零控脱靶量与末段制导能量需求的近似计算

基于理想二体假设下的弹道方程解析式,忽略重力在拦截末段对拦截器和目标运动状态的影响.推导了空间拦截初始制导偏差与终端零控脱靶量之间的线性近似计算式,并以速度增量的大小来近似描述拦截末端主动寻的制导段的能量需求,给出了拦截末段制导最小能量需求与零控脱靶量、探测距离之间的近似关系.通过数字仿真测试了近似计算的准确性.     

某型末制导炮弹偏流的分析与计算

针对某型激光半主动式末制导炮弹偏流问题,基于考虑末制导炮弹各个典型弹道飞行阶段的刚体弹道模型,通过仿真计算,分析该末制导炮弹偏流的基本特点;探讨偏流形成的原因,确定影响其大小的关键因素,并对计算偏流所需要的数值积分时间步长进行了探讨。有关结论对准确编拟末制导炮弹射表所需要的偏流有直接应用价值,对新型末制导炮弹的弹道设计有积极的指导意义。     

基于A~*算法的虚拟士兵城市作战路径规划

针对虚拟士兵在城市作战仿真领域的需求,重点研究了虚拟士兵在城市环境中路径规划问题。通过对三维城市虚拟环境空间进行分层信息处理,生成虚拟士兵能够感知的虚拟信息层。用A*算法求出虚拟士兵从初始位置到达目标位置的最佳路径,并给出算法的具体设计与实现。     

金属磁记忆管道检测机器人的应用研究

阐述了金属磁记忆检测技术的基本原理及磁记忆检测机器人的研究现状,针对存在的问题,基于形态分析法对不同驱动形式的机器人进行优选。提出了一种适用于150mm管径的螺旋轮式机器人驱动系统,对机器人的动力系统和检测单元进行设计,为长输管道磁记忆检测机器人的结构设计和优化提供了有益参考。     

基于二层遗传算法的导弹航路选优问题研究

在多批次多数量的反舰导弹从多个方向对敌舰艇进行饱和攻击的决策过程中,如何选择出最优的航路组合是提高反舰导弹作战效能的关键问题。在综合分析反舰导弹航路选优问题的基础上,建立了导弹航路选择的优化模型,并针对导弹航路选优问题,对基本遗传算法进行了改进,提出了二层遗传算法。仿真分析了多火力单元多目标导弹攻击的航路组合优化问题,得出了有效的导弹攻击航路。通过验证,说明了二层遗传算法在导弹航路规划中的有效性。     

基于Dubins路径的智能车辆路径规划算法

路径规划是车辆智能化的核心问题之一,而所有路径均可分解为简单的Dubins路径。在Dubins路径的思想下对智能车辆的行驶路径进行分段研究,并利用经典PID控制对该算法的执行性能进行检验。研究表明:算法能计算出车辆行驶的最短路径,减少了车辆行驶的路径长度,缩短了行驶时间,减少了控制系统的计算量,提高了车辆执行系统的执行力度,降低了执行误差,对最优路径具有较好的选择性。     

Making defense planning meaningful: the evolution of strategic guidance in the Hungarian Ministry of Defense

Hungary, a former communist state, adapted a Western-style defense planning system during the 1990s and 2000s. Although on the surface the elements of this planning system were similar to the planning programming budgeting system (PPBS) developed by the US Department of Defense, strategic guidance for defense planning has not been properly developed until recently. Thus, albeit PPBS-based defense plans were developed in the Hungarian Ministry of Defense (Hungarian MoD) regularly, they lacked both an expression of clear priorities and strategic focus. This article delineates the evolution of strategic guidance in the Hungarian MoD concentrating on current developments, and introduces the newly elaborated analytical concepts and tools, which helped to create needed strategic guidance in Hungary.     

基于多目标优化的任务计划建模及方法

针对任务计划在进行多目标优化时采用进化算法求解效率较低的问题,设计了一种结合分组策略的非支配排序遗传(NSGA-Ⅱ)算法,可以快速有效地得到合理的分组结果。基于分组结果,调整NSGA-Ⅱ算法的步骤,灵活地进行种群初始化,使最终分配结果各优化的目标有了明显的改善,提高了算法的效率。通过实验分析,验证了所提方法的可行性和有效性。