临近空间拦截弹最优弹道跟踪制导律

针对拦截临近空间高超声速飞行器的弹道跟踪过程,基于线性二次型调节器理论和高斯伪谱法设计一种跟踪制导律。为了对标称弹道进行精确跟踪,考虑线性二次型跟踪问题,应用最优控制理论推导最优解的充要条件,得到带时变增益的线性状态反馈控制量的表达式;基于高斯伪谱法,在离散的勒让德-高斯点上利用标称弹道数据计算差分矩阵和系数矩阵,求得状态扰动反馈控制律。仿真结果表明,与基于求解矩阵黎卡提方程的方法相比,该方法选取较少的节点即可获得高精度的反馈控制量,且运算效率大幅提高,满足在线实施要求。     

多UCAV协同控制中的任务分配模型及算法

任务分配是多UCAV协同控制的核心和有效保证。分析了影响目标价值毁伤、UCAV损耗、任务消耗时间等三项关键战技指标的因素,综合考虑实战中多UCAV同时攻击同一目标和使用软杀伤武器这两种典型情况对UCAV执行任务的影响,建立了针对攻击任务的多UCAV协同任务分配模型,并应用粒子群算法求解。仿真结果验证了模型的合理性和算法的有效性。     

大气湍流引起的相位起伏对相干态量子雷达相位估计的影响

基于马赫曾德干涉仪模型并采用相位扩散主方程描述大气相位起伏效应对量子雷达的影响,给出了光场在相位扩散通道的演化过程,详细分析了大气相位起伏对相干态宇称探测量子雷达相位估计分辨率和最佳灵敏度的影响,并计算了大气相位起伏下相位估计灵敏度的Cramer-Rao极限。研究发现:相位起伏对于分辨率的影响可通过增加单个脉冲平均光子数来消除。在强相位起伏情况下,宇称探测得到最佳灵敏度会严重偏离散粒噪声极限,但是在弱相位起伏情况下,通过与Cramer-Rao极限的对比,发现宇称探测是一种准最佳探测方案。     

基于位置预测的靶场图像实时判读方法

在靶场经纬仪对目标实时跟踪测量时,会发生相机随机抖动的情况,引起目标在图像中大幅度运动。应对大幅度运动时,基于搜索窗口的跟踪方法容易丢失目标,而基于全图搜索的跟踪方法时效性差。针对以上问题,提出一种结合核相关滤波算法(Kernelized Correlation Filter, KCF)和目标位置预测的改进的跟踪学习检测算法(Tracking-Learning-Detection, TLD)跟踪框架。利用正交多项式最优线性滤波器及相机角度信息预测目标下一帧位置,在此区域利用KCF进行快速跟踪,可以提高跟踪的成功率和时效性,跟踪失败时再进行检测。仿真实验表明,最优线性滤波器能较准确预测目标位置,给KCF提供较准确的搜索位置,算法每帧耗时仅为1.1 ms,且定位精度优于TLD和KCF,能有效应对相机抖动的问题。靶场实际试验证明该方法可提高靶场自动判读水平,减少人工干预。     

Holonic-C2组织决策分配及演化方法

为了有效发挥指挥控制(Command and Control, C2)组织集中式决策和协作式决策的决策优势,对具有决策权限动态变化能力的Holonic-C2组织的决策分配问题进行研究。针对群决策中专家固定权重的主观性太强的缺点,提出基于专家权威性和意见一致性相结合的专家组选择方法,提高了决策分配过程中多属性决策的客观合理性;针对决策分配的动态演化问题,提出基于多阶段决策的决策模式演化机制,在考虑属性前后阶段的变化的基础上,给出相邻阶段决策模式跃迁方法。仿真结果表明,所提方法能够给出相对客观的决策模式的优劣排序以及多阶段的演化路线,从而证明了方法的可行性和有效性。     

面向卫星的在轨服务任务规划方法

针对空间在轨服务日趋成熟以及在轨服务现实需求增长的背景,以在轨服务航天器为研究对象,研究面向卫星的在轨服务任务规划问题,探讨如何合理安排与调配在轨服务资源。将问题分解为在轨服务资源分配和在轨服务路径规划两层,并建立双层优化数学模型。设计在轨服务任务规划算法求解问题,包括基于多种群并行进化的混沌遗传算法和基于全局坐标转换的NSGA-Ⅱ+GSDE算法,并通过仿真结果对比分析,验证算法的可行性和有效性。     

Capacitated warehouse location model with risk pooling

In this article, we introduce the capacitated warehouse location model with risk pooling (CLMRP), which captures the interdependence between capacity issues and the inventory management at the warehouses. The CLMRP models a logistics system in which a single plant ships one type of product to a set of retailers, each with an uncertain demand. Warehouses serve as the direct intermediary between the plant and the retailers for the shipment of the product and also retain safety stock to provide appropriate service levels to the retailers. The CLMRP minimizes the sum of the fixed facility location, transportation, and inventory carrying costs. The model simultaneously determines warehouse locations, shipment sizes from the plant to the warehouses, the working inventory, and safety stock levels at the warehouses and the assignment of retailers to the warehouses. The costs at each warehouse exhibit initially economies of scale and then an exponential increase due to the capacity limitations. We show that this problem can be formulated as a nonlinear integer program in which the objective function is neither concave nor convex. A Lagrangian relaxation solution algorithm is proposed. The Lagrangian subproblem is also a nonlinear integer program. An efficient algorithm is developed for the linear relaxation of this subproblem. The Lagrangian relaxation algorithm provides near‐optimal solutions with reasonable computational requirements for large problem instances. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Analysis and optimal design of discrete order picking technologies along a line

Order picking accounts for most of the operating expense of a typical distribution center, and thus is often considered the most critical function of a supply chain. In discrete order picking a single worker walks to pick all the items necessary to fulfill a single customer order. Discrete order picking is common not only because of its simplicity and reliability, but also because of its ability to pick orders quickly upon receipt, and thus is commonly used by e‐commerce operations. There are two primary ways to reduce the cost (walking distance required) of the order picking system. First is through the use of technology—conveyor systems and/or the ability to transmit order information to pickers via mobile units. Second is through the design—where best to locate depots (where workers receive pick lists and deposit completed orders) and how best to lay out the product. We build a stochastic model to compare three configurations of different technology requirements: single‐depot, dual‐depot, and no‐depot. For each configuration we explore the optimal design. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A componentwise index of service measurement in multi‐component systems

In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

防空中存在两次转火射击时的火力分配模型

在对空防御时 ,进行火力分配不但要考虑到一次性分配的最佳方案 ,而且应该考虑是否在条件允许的情况下进行一次或两次转火射击 ,如果存在 ,怎样进行转火才能使其射击效果最好。把威胁判断和火力分配结合起来考虑 ,以我方的生存概率为指标 ,建立了存在两次转火射击的火力分配模型 ,并用实例计算检验了模型的正确性。