调运问题中基于栅格模型的快速路径规划方法

针对调运路径规划这一问题,采用栅格模型表示环境地图,通过设定路径搜索方向权重,剔除不必要的搜索区域,提高了搜索效率.仿真结果表明,该算法能有效地提高路径搜索效率,并能搜索到最优路径.     

装备作战单元任务可信度评估方法

首先简要分析了任务可信度的影响因素,并对最小任务单元的任务进行了分类;然后借助马尔可夫过程建立了k／N系统的任务可信度模型,该模型考虑了维修保障和备件补给对任务可信性的影响,在此基础之上分别建立了单台装备、最小任务单元、装备作战单元任务可信度的模型;最后通过实例分析和计算,结果表明该装备作战单元任务可信度评估方法有效可行。     

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*算法求出虚拟士兵从初始位置到达目标位置的最佳路径,并给出算法的具体设计与实现。     

防空导弹火力单元战斗效率评估

从防空战斗的实际需求出发,结合现行防空作战运筹理论中存在的问题,提出了防空导弹火力单元战斗效率指标应包括完成射击任务概率和毁歼空中目标数量等分指标的观点,利用概率论和军事运筹等方法,分析了这两项分指标的构成要素及其相互关系,并建立了相应的评估模型,结合实例说明了模型的具体应用.     

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

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

基于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.