英国车辆电子学研究防御倡议(VERDI)述评

车辆电子学（ＶＥＴＲＯＮＩＣＳ）是近年来装甲车辆研究领域内兴起的一项意义深远的尖端技术。目前,最有影响的３个典型系统是美国的“标准陆军车辆电子系统体系结构（ＳＡＶＡ）”、英国的“车辆电子学研究防御倡议（ＶＥＲＤＩ）”及法国的全电子化主战坦克“勒克莱尔”。简单介绍了ＶＥＲＤＩ的研究历史,系统阐述了其第二研究阶段（ＶＥＲＤＩ－２）的改进方针、改进后的系统组成、设备配置、功能度及系统特征等。     

空间布置中的干涉性检查算法

本文提出一种新的干涉性检查算法:首先估计被测对象是否位于可能发生干涉的区域,若是,则再进一步检查它们之间是否接触或穿越等。算法简单明了,效率较高,适用面广,计算机运行结果证实了算法的正确性和可靠性。     

浅议陆军合成旅装备一体化联合检验

近年来,装备试验深入推进。作为装备试验领域的最高形式,装备一体化联合检验已经成为陆军合成旅装备试验的新趋势和新常态。本文从装备一体化联合检验的概念入手,简要阐述了以作战效能、作战适用性、体系适用性和在役适用性为主的“一能三性”,从装备体系效能的联合检验、装备体系运用的具体检验和陆军合成旅的综合检验三个方面深入理解和认识装备一体化联合检验,提出了立足联合作战、立足贴近实战、紧盯短板弱项、聚焦摸清底数等四个需要重点关注的问题,以为陆军合成旅装备一体化联合检验的深入开展提供理论参考和借鉴。     

Disruption management in production planning

We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A concave‐cost production planning problem with remanufacturing options

We focus on the concave‐cost version of a production planning problem where a manufacturer can meet demand by either producing new items or by remanufacturing used items. Unprocessed used items are disposed. We show the NP‐hardness of the problem even when all the costs are stationary. Utilizing the special structure of the extreme‐point optimal solutions for the minimum concave‐cost problem with a network flow type feasible region, we develop a polynomial‐time heuristic for the problem. Our computational study indicates that the heuristic is a very efficient way to solve the problem as far as solution speed and quality are concerned. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

论校园文化建设的内容与规划——基于华山中学校园文化建设活动的系列思考之二

开展校园文化建设必须以马克思主义文化观作为指导思想,在此基础上,要全面了解校园文化建设的内容,进行科学规划,稳步实施,才能收到成效。本文结合华山中学的具体实践,阐述了对校园文化建设工作的认识,并且提出以校园文化建设为目标的教育形式才可以称得上是全面教育,它比侧重传授知识的教育模式更加接近教育的本质规律,更加反映人性发展的需要,也更加符合人类社会发展的方向。     

光电载荷安装误差标校的飞行航路

无人机搭载光电载荷进行安装误差标校时,飞行航路的选择与规划在很大程度上影响着标校算法的收敛性与误差识别结果。为增强标校飞行架次的有效性,提高安装误差可被识别的程度,改善标校算法的收敛性及标校精度,对标校的原理和标校算法进行了理论分析,并利用考察差异函数偏微分的方法找到了标校航路和安装误差标校之间的相互联系,然后结合标校实施过程中所遇到的实际问题提出标校航路规划应遵循的原则,给出了标校航路规划的参考范例。     

一种面向节点定位的移动信标动态路径规划方法

针对基于移动信标的传感器节点定位问题,提出一种基于在线决策的移动信标动态路径规划方法.针对以往算法大都只适用于节点均匀分布的局限,该方法用移动信标不断获取两跳范围内的未定位节点数目,并向最大覆盖未定位节点方向移动,不需要网络先验信息,即可实现路径的优化.仿真结果表明:与传统方法相比,该方法无需网络的先验信息,在移动路径长度上具有明显优越性,减少了信标的能量消耗,更适用于户外部署的大规模传感器网络.     

战场环境下无人车辆战术机动路径规划方法

针对不同类型威胁体存在的战场环境中无人车辆战术机动路径规划问题,提出了一种基于威胁代价地图的粒子群优化（Particle Swarm Optimization,PSO）方法。借助极坐标系中关键点的极角进行路径描述,并使用分段3次Hermite插值方法形成光滑路径,将路径规划问题转化为关键点极角的参数优化问题。针对基本PSO（BPSO）算法存在的早熟收敛和后期迭代效率低的缺陷,借鉴以群集方式生活的物种按照不同任务对种群进行分工的机制,提出了一种基于多任务子群协同的改进粒子群优化（Particle Swarm Optimization based on the Multi—tasking Subpopu—lation Cooperation,PSO-MSC）算法。借助该算法的快速收敛和全局寻优特性实现了最优路径规划。实验结果表明：该算法可以快速有效地实现战场环境下无人车辆的战术机动路径规划,且规划路径安全、平滑。     

Optimal path finding in direction,location, and time dependent environments

This article examines optimal path finding problems where cost function and constraints are direction, location, and time dependent. Recent advancements in sensor and data‐processing technology facilitate the collection of detailed real‐time information about the environment surrounding a ground vehicle, an airplane, or a naval vessel. We present a navigation model that makes use of such information. We relax a number of assumptions from existing literature on path‐finding problems and create an accurate, yet tractable, model suitable for implementation for a large class of problems. We present a dynamic programming model which integrates our earlier results for direction‐dependent, time and space homogeneous environment, and consequently, improves its accuracy, efficiency, and run‐time. The proposed path finding model also addresses limited information about the surrounding environment, control‐feasibility of the considered paths, such as sharpest feasible turns a vehicle can make, and computational demands of a time‐dependent environment. To demonstrate the applicability and performance of our path‐finding algorithm, computational experiments for a short‐range ship routing in dynamic wave‐field problem are presented. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012