飞行器低空突防威胁建模与航迹优化算法

提出了一种飞行器在给定地形和威胁分布的威胁场进行低空突防的航迹优化算法。该方法首先对地形的高程栅格数据进行了图形简化预处理,将各种威胁叠加到地形图上,构成一个包含各种威胁的特定威胁场,再对其建立合理的有向图数学建模,用Dijkstra最短路算法进行航迹优化。航迹优化的过程中考虑了飞行器的过载限制,使优化航迹能够较好地满足飞行器各项性能指标及任务规划的要求,仿真结果显示,该算法简单快速,能很好地进行地形、威胁、障碍物的回避。     

慢刀伺服加工环曲面的刀具路径规划方法

如何规划刀具路径、进而获得高质量的数控加工代码,是应用慢刀伺服技术加工环曲面的关键技术之一。提出了基于等距面规划刀位点轨迹的刀具路径规划方法,推导了外凸环曲面的面形方程及其等距面方程,对比分析了两种导动曲线及两种数据点离散方法,优选了刀具路径规划方案,应用VB.net语言编写了慢刀伺服加工环曲面用数控代码生成软件,在Vericut平台上对数控代码进行了仿真验证,直观地展示了虚拟加工面相对理论曲面的残留区域,仿真结果验证了方法的可行性。结果表明:将外凸环曲面方程中的非一次常数项a变为a+r_d,即得到外凸环曲面的等距面方程;所提刀具路径规划方法适用于慢刀伺服加工外凸环曲面;该方法对应用慢刀伺服技术加工其他面型的光学镜面具有借鉴价值。     

Path planning for moving target tracking by fixed-wing UAV

For the automatic tracking of unknown moving targets on the ground, most of the commonly used methods involve circling above the target. With such a tracking mode, there is a moving laser spot on the target, which will bring trouble for cooperative manned helicopters. In this paper, we propose a new way of tracking, where an unmanned aerial vehicle (UAV) circles on one side of the tracked target. A circular path algorithm is developed for monitoring the relative position between the UAV and the target considering the real-time range and the bearing angle. This can determine the center of the new circular path if the predicted range between the UAV and the target does not meet the monitoring requirements. A transition path algorithm is presented for planning the transition path between circular paths that constrain the turning radius of the UAV. The transition path algorithm can generate waypoints that meet the flight ability. In this paper, we analyze the entire method and detail the scope of applications. We formulate an observation angle as an evaluation index. A series of simulations and evaluation index comparisons verify the effectiveness of the proposed algorithms.     

深入学习贯彻习主席重要论述 全面推进军队院校军事理论研究创新发展【将军论坛】

科学的军事理论就是战斗力。在新起点上全面推进军队院校军事理论研究创新发展,必须深入学习贯彻习主席关于军事理论创新的重要论述,着力提高站位、谋篇布局、形成拳头,进一步加强标准统筹、导向统筹、力量统筹和机制统筹,努力为强军兴军实践提供科学理论支撑。     

常规导弹作战批量测试优化研究

短时间内测试大批量合格的常规导弹是未来作战的客观要求.结合导弹部队的作战实际情况,分析了当前技术阵地测试所面临的问题,提出了一些改革的方法.改造技术阵地测试设备,提高操作人员的熟练程度,采用并行技术和关键路技术优化导弹测试流程,同时建立战时应急状态下的测试流程,特别是导弹批量测试技术的提出,将极大地提高导弹测试速度,缩短测试时间,为将来技术阵地的建设提供了建议,同时也对将来常规导弹的设计和研制提出了更高的要求.     

海上编队传感器管理架构研究

在信息化海战场,获取信息优势是保障作战胜利的基础之一,海上编队传感器管理是提升传感器探测整体效能,从而达成信息优势的关键环节.首先分析了海上编队传感器管理需求,包括组成结构、作用以及编队、平台、传感器各层级的管理需求;其次研究了海上编队传感器管理的总体架构,提出采用混合式的体系结构,设计了事前规划与实时调度2个方面的处...     

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

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

重塑非饱和含粘砂土变形强度特性的三轴试验

利用多功能土工三轴仪探讨了非饱和含粘砂土的变形和强度特性,共进行3种应力路径的三轴试验：控制吸力的各向同性压缩试验、控制净平均应力的三轴收缩试验、控制吸力和净围压为常数的三轴排水剪切试验。研究结果表明：该土的屈服净平均应力和偏应力都随吸力增大;在净平均应力不变的条件下,该土的屈服吸力是一常数但不等于土样在历史上曾受过的最大吸力;随着净围压增大,其应力-应变曲线由软化向硬化型转变;在高吸力高围压下,呈现脆性破坏。控制吸力和净围压为常数的三轴排水剪切试验在p—q平面内的强度包络线为直线;在试验研究的吸力范围（50～200kPa）内,该土的粘聚力随吸力线性增加;内摩擦角随吸力的变化很小,可以认为是一常数;该土具有显著的剪胀特性,剪胀性不仅取决于千密度与围压,而且还与吸力密切相关。     

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     

用Excel演示Floyd算法

Floyd算法是计算最短路径长度的基本算法之一,若用Excel实现,算法的核心部分只需填写一个公式,比通常的四重循环结构算法简单、直观。