异类传感器动态数据关联算法北大核心

数据关联是异类传感器系统中最核心且最重要的内容之一,典型的数据关联算法可以归结为特定的分配为问题,然而现有的S维分配算法只考虑同一时刻的每个传感器量测的互联。将此静态关联推广到动态关联中,提出了一种适用于异类传感器的(S+1)维动态数据关联算法。该算法首先将同一时刻各传感器的量测与目标轨迹的一步预测值合并,把问题转化为(S+1)维分配问题,然后将各传感器量测估计的位置信息与目标航迹的预测值的差值作为关联代价,并利用LP-SOLVE工具包解决多维分配问题,最后利用求得的全局最优关联解进行滤波和航迹的更新。仿真实验表明提出的关联代价能更精准地反映数据关联的可能性,能够对多目标进行稳定的跟踪。     

异类传感器动态数据关联算法

数据关联是异类传感器系统中最核心且最重要的内容之一,典型的数据关联算法可以归结为特定的分配为问题,然而现有的S维分配算法只考虑同一时刻的每个传感器量测的互联。将此静态关联推广到动态关联中,提出了一种适用于异类传感器的(S+1)维动态数据关联算法。该算法首先将同一时刻各传感器的量测与目标轨迹的一步预测值合并,把问题转化为(S+1)维分配问题,然后将各传感器量测估计的位置信息与目标航迹的预测值的差值作为关联代价,并利用LP-SOLVE工具包解决多维分配问题,最后利用求得的全局最优关联解进行滤波和航迹的更新。仿真实验表明提出的关联代价能更精准地反映数据关联的可能性,能够对多目标进行稳定的跟踪。     

一种新的多传感器多机动目标快速跟踪算法

基于FAFDA滤波算法,根据Houles和Shalom将PDA算法推广到解决两个传感器单目标的跟踪问题的思路中,构造一种两个同类传感器的序列观测数据的融合来跟踪多个机动目标的数据关联方法(MSFAFDA)。它主要使用的是点/航迹联合和序列估计法。算法计算量远小于原先的顺序和并行多传感器联合概率数据关联算法,蒙特卡洛仿真结果也表明它对多机动目标的跟踪具有比FAFDA更好的跟踪性能。     

基于多目标多特征的模糊数据关联

在弹道导弹飞行中段多目标跟踪过程中,传统的数据关联方法只利用目标距离、方位、状态等与计算直接相关的信息,针对传统数据关联存在误跟、失跟的问题,提出一种基于多目标多特征的模糊相似度关联算法。该算法同时利用目标尺寸、形状、材料3种属性特征,应用模糊数据关联计算雷达观测目标间的相似度,利用蒙特卡罗法验证其正确率。     

多平台多目标航迹关联方法

战术数据链是当前各国信息化武器作战的高效平台,也是各国当前军事研究的重点和热点.其中,多平台多目标的航迹关联问题是数据链研究的一个技术难点.针对这一问题进行了研究,提出一种在数据链中对多平台多目标航迹数据进行关联的实现方法,并建立了多平台多目标航迹关联处理模型.对新提出的航迹关联算法进行了Monte Carlo仿真,结果表明新算法的有效性与可行性.     

改进的被动多传感器数据关联算法

针对被动传感器数据关联的问题,提出了一种基于改进量子粒子群算法的被动传感器数据关联方法。算法采用分层关联的思想,首先通过构造角度检验统计量进行方位粗关联,然后将余下的候选关联组合转化为三维分配问题,继而提出了一种改进的量子粒子群算法求解此问题。仿真实验表明,该算法能够快速消减候选关联集合的数目,快速、准确地排除虚假定位点。     

基于LAP的MHT算法在多目标跟踪中的应用

围绕弹道导弹多目标跟踪中的数据关联问题,分析了MHT算法的关联假设构建及概率计算的基本过程;而后为降低关联假设概率计算的复杂度,提出了基于线性分配方法(LAP)的MHT关联假设构建方法;仿真表明基于LAP的MHT算法对邻近发射和轨迹交叉的多弹道导弹目标具有较好的跟踪能力,进一步通过设置距离门限,该算法对变加速度的弹道导弹目标亦具有良好的跟踪能力。     

多机空战多目标威胁评估和分配算法

研究了多机空战中目标威胁评估和目标分配的过程和算法.首先通过对影响空战态势的相关因素进行分析,提出一种新的综合目标空战态势和空战能力的威胁评估和目标分配算法,利用层次分析法和灰色关联决策理论对目标威胁程度进行分析,计算出目标综合威胁指数矩阵,然后根据目标综合威胁指数矩阵进行多机多目标分配和攻击排序,最后,通过具体算例验证该算法.     

多传感器多机动目标跟踪方法研究进展

讨论了多传感器多机动目标的研究现状,分析了几种跟踪滤波器的性能,着重探讨了交互多模型(IMM)算法的发展状况和应用。同时还研究了多传感器跟踪多机动目标过程中的数据关联方法。最后指出,寻求采用自适应变结构的IMM算法,研究模型切换过程中算法的过渡性能,以及在数据关联中引入混沌、遗传算法等智能控制方法,将是未来多传感器多机动目标研究的方向。     

基于多假设跟踪弹道导弹主动段跟踪算法

针对弹道导弹主动段防御中多枚弹道导弹同时跟踪问题,提出了基于多假设思想的主动段跟踪算法.重点阐述了该算法中假设生成、假设概率计算、假设约简以及假设剪枝等环节.从工程实用的角度出发,采用求解一个线性分配问题(LAP)方法得到M个最优假设,大大减少了假设数量,并运用N-scan回溯剪枝方法对假设进行剪枝,确定要输出的航迹,提高了算法的效率和实用性.仿真实验表明,该算法能够对主动段多枚弹道导弹目标准确关联跟踪.     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

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     

联合作战规划中资源调度算法研究

以联合作战为例建立任务和作战平台资源模型,通过多维动态列表规划算法(Multidimensional Dynamic List Scheduling,MDLS)进行任务-平台分配,对平台选择提出了两种不同的优先权计算方法,通过对案例求解比较了不同方法的结果.     

改进的拉格朗日松弛数据关联算法

在多传感器多目标跟踪领域中,当传感器为被动式的,传统的多维分配算法利用拉格朗日松弛算法求解.拉格朗日乘子更新一般用次梯度方法,但每次迭代都要进行多次极小化运算来求对偶解,导致实时性差.针对这个问题,提出了一种改进的基于拉格朗日松弛的数据关联算法,通过代理修正次梯度方法更新拉格朗日乘子,并在允许时间内获得近似解.仿真实验...     

指派问题的降阶优化算法

指派问题是运筹学中特殊线性规划中的一类问题。在现实生活中,指派问题非常普遍,常常可以见到各种各样的指派问题。通过对指派问题的数学模型进行分析,提出了与以往方法不同的求解指派问题的一种新的思路,通过对几个定理的研究,给出了一种新的求解方法——降阶优化算法。对求解指派问题提供了一种新的途径,在运筹学等领域有着较好的应用前景。     

Duality in constrained multi‐facility location models

We consider the ??_p‐norm multi‐facility minisum location problem with linear and distance constraints, and develop the Lagrangian dual formulation for this problem. The model that we consider represents the most general location model in which the dual formulation is not found in the literature. We find that, because of its linear objective function and less number of variables, the Lagrangian dual is more useful. Additionally, the dual formulation eliminates the differentiability problem in the primal formulation. We also provide the Lagrangian dual formulation of the multi‐facility minisum location problem with the ??_pb‐norm. Finally, we provide a numerical example for solving the Lagrangian dual formulation and obtaining the optimum facility locations from the solution of the dual formulation. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 410–421, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10010     

Optimal set partitioning,matchings and lagrangian duality

We formulate the set partitioning problem as a matching problem with simple side constraints. As a result we obtain a Lagrangian relaxation of the set partitioning problem in which the primal problem is a matching problem. To solve the Lagrangian dual we must solve a sequence of matching problems each with different edge-weights. We use the cyclic coordinate method to iterate the multipliers, which implies that successive matching problems differ in only two edge-weights. This enables us to use sensitivity analysis to modify one optimal matching to obtain the next one. We give theoretical and empirical comparisons of these dual bounds with the conventional linear programming ones.     

基于马尔柯夫过程的武器系统目标分配问题决策分析

将防空作战中武器系统目标分配决策作为一个在动态随机系统中实现最优化的问题,并用马尔柯夫过程理论进行建模分析,提出新的算法并运用Matlab编程;通过对实行不同策略时武器系统长期平均效能的分析比较,指出在目标分配问题上仅靠原有的静态线性规划决策方法是不够的,还必须考虑动态随机对抗过程本身的特性.     

模糊匈牙利算法在舰艇抢修人员指派问题中的研究

分析了舰艇在执行任务或作战等紧急情况下的抢修人员指派问题,并对此建立了多目标广义指派问题的数学模型。在任务数少于工作人数的情况下,采用虚拟“工作”和“人员”的方法,得到适合经典匈牙利算法的拓展效益矩阵,并对此矩阵采用匈牙利算法求得最优指派。