基于能量与动量矩指标的两次“推-滑”离轨制导方法

对航天器在有限推力作用下的"推-滑-推-滑"离轨轨道制导问题进行了研究。将再入接口条件转化为能量与动量矩指标,基于该指标得出了单次"推-滑"的临界地心距,分析了其对离轨策略的影响;推导了有推力作用时飞行器能量与动量矩的相对变化规律,通过使飞行器的能量与动量矩以同样的相对速度减小的方法,导出了制导方程;得到了首次制动时推力方向始终与速度方向相反,二次制动根据制导方程进行导引的轨道形式;对不同高度与不同再入接口条件的离轨问题进行了数值仿真。仿真结果表明,该方法计算量小,可有效解决单次"推-滑"无法实现的离轨制导问题。     

Russian mission-command in VOSTOK strategic exercises

Russian military prefers and exercises differently compare to the Western planning and execution philosophies with mission command allowed and appreciated in sub unit levels only. “Vostok-2018” provided a lot of evidences Russians using de-centralised execution in the sub-unit levels and at the same time centralised control at levels of units and formations.     

基于Floyd算法的常规导弹连续波次作战运输规划

为提高常规导弹连续波次作战效能,对常规导弹连续波次作战运输规划问题进行研究。以Floyd算法为基础,首先生成了作战机动区域的交通网络最短路径、距离矩阵;其次将常规导弹连续波次作战运输过程分解为不同阶段,以运输过程中的整体暴露时间最短为目标,构建了初始规划方案0-1整数规划模型;然后考虑道路通行量及地域容量限制,对初始规划方案中存在的地域容量超过限制及单行道路中会车、超车情况进行逐步循环优化,以得到最佳运输规划方案;最后选择了一个作战案例想定,通过Matlab编程对案例进行了求解,得到了针对此案例的最佳运输规划方案,验证了模型的正确性和算法的有效性。     

基于模板的无人机机动动作建模与仿真

研究了常用的无人机机动模板构建和机动动作生成算法,构建了基于控制量的基本机动模板,以低空跃升攻击动作为例,对动作进行了分解,将此机动动作的各部分利用基本机动模板进行拼接,并对其进行了仿真。结果表明,算法可依据任务和无人机控制约束将模板拼接成可行的机动动作,从而较大程度地提升了无人机机动动作设计的灵活性。     

坦克兵力行为智能体模型研究

为了有效模拟兵力物理行为和智能行为的不同特性,提出了一个复合结构坦克兵力智能体模型,该模型综合了反应式行为和慎思行为两方面的优点。采用层次化组合方法建立了基于行为模式的兵力物理行为模型,使兵力智能体能对动态战场环境作出灵活的反应。结合兵力不同类型任务的分析,设计了基于规划的兵力智能行为模拟方法,使兵力智能体能按照战术原则进行作战任务规划。     

The Serbian defence institution: the need for clear policy guidance to improve the Serbian defence planning,management, and command processes

ABSTRACT

The uncritical layering of western liberal defence governance norms and concepts on top of existing legacy concepts has impeded achieving coherent military capabilities and capacities when Serbia’s political and military leadership tried to reform the defence system using Western benchmarking principles and Western countries’ best practices. The process of this change has been more valuable than its actual output, as defined by increased capabilities. Such outcomes should be reflective of policy guidance, and can be thought of as closing the trinity loop of a defence planning system: plans, money and execution. This article addresses two key functional areas of the Serbian defence institution. First, it assesses the current state of defence planning to discern its strengths and weaknesses to ascertain if plans are tied to financial decision-making. Second, a full examination of current Serbian defence management is conducted to discern whether weaknesses exist that distract from producing operational capabilities. Both areas are analyzed thoroughly and some solutions for change are proposed. Also, the article analyzes the appearance of two negative phenomena in the planning process – economization and managerialism.     

Optimal motion planning in rapid‐fire combat situations with attacker uncertainty

This article provides a modeling framework for quantifying cost and optimizing motion plans in combat situations with rapid weapon fire, multiple agents, and attacker uncertainty characterized by uncertain parameters. Recent developments in numerical optimal control enable the efficient computation of numerical solutions for optimization problems with multiple agents, nonlinear dynamics, and a broad class of objectives. This facilitates the application of more realistic, equipment‐based combat models, which track both more realistic models, which track both agent motion and dynamic equipment capabilities. We present such a framework, along with a described algorithm for finding numerical solutions, and a numerical example.     

权值编码遗传算法在单机任务规划中的应用

任务规划是在任务有不同威胁程度,资源消耗和战术价值条件下,寻找总战术价值最高,而又不超出约束的任务链,这对飞机完成任务中具有重要作用,针对机载资源有限、任务有不同威胁程度和战术价值,提出了基于权值编码遗传算法的任务规划方法,该算法通过对原始问题的偏离和启发式解码来得到最优的可完成任务子集.仿真结果验证了算法的有效性.     

An eikonal equation based path planning method using polygon decomposition and curve evolution

Path planning is a key technique of autonomous navigation for robots, and the velocity field is an important part. Constructing velocity field in a complex workspace is still challenging. In this paper, an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper. The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace, and the velocity field is obtained by utilizing the potential field of this workspace. Path optimization is implemented by curve evolution, during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field. The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness. Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths.     

试论战略数据规划及其概念基础

讨论了当前人们对数据规划概念的不同理解 ,在分析信息、系统等概念的基础上 ,提出了一个明确的面向整个组织的数据规划概念 ,给出了一种基于这一概念的新的数据规划方法的框架。