基于人工神经网络的操作手IKP 求解

人工神经网络以其信息的并行处理与分布式存储、自组织和自适应等特点,在机器人领域显示了极大的应用潜力。本文探讨人工神经网络在机器人操作手ＩＫＰ求解中的应用,试图求得操作手ＩＫＰ的一组或所有可行解。文章利用ＢＰ网络对操作手ＩＫＰ的求解进行了讨论和分析,并给出了具体的求解实例。     

Directional change‐point detection for process control with multivariate categorical data

Most modern processes involve multiple quality characteristics that are all measured on attribute levels, and their overall quality is determined by these characteristics simultaneously. The characteristic factors usually correlate with each other, making multivariate categorical control techniques a must. We study Phase I analysis of multivariate categorical processes (MCPs) to identify the presence of change‐points in the reference dataset. A directional change‐point detection method based on log‐linear models is proposed. The method exploits directional shift information and integrates MCPs into the unified framework of multivariate binomial and multivariate multinomial distributions. A diagnostic scheme for identifying the change‐point location and the shift direction is also suggested. Numerical simulations are conducted to demonstrate the detection effectiveness and the diagnostic accuracy.© 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

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

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

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。     

驱护舰编队防空火力分配决策模型研究

驱护舰编队防空火力分配的确定和优化是最大限度地发挥驱护舰编队的整体作战能力的关键。为了高效地发挥驱护舰编队火力优势,用运筹学理论建立了驱护舰编队防空火力分配决策问题的优化模型,分析了各种解决此模型的方法的优缺点,并尝试运用粒子群优化理论(PSO)求解该模型。实例计算分析表明,所提出的方法较好地解决了驱护舰防空火力分配决策问题,为舰艇编队指挥员进行防空火力分配决策提供了一种有效的参考处理方法。     

A stochastic assignment problem

There are n boxes with box i having a quota value Balls arrive sequentially, with each ball having a binary vector attached to it, with the interpretation being that if X_i = 1 then that ball is eligible to be put in box i. A ball's vector is revealed when it arrives and the ball can be put in any alive box for which it is eligible, where a box is said to be alive if it has not yet met its quota. Assuming that the components of a vector are independent, we are interested in the policy that minimizes, either stochastically or in expectation, the number of balls that need arrive until all boxes have met their quotas. © 2014 Wiley Periodicals, Inc. 62:23–31, 2015     

Transformations of node‐balanced routing problems

This article describes a polynomial transformation for a class of unit‐demand vehicle routing problems, named node‐balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BRPs, and any combination thereof. At the heart of the procedure lies transforming the BRP into a generalized traveling salesman problem (TSP), which can then be transformed into a TSP. The transformed graph exhibits special properties which can be exploited to significantly reduce the number of arcs, and used to construct a formulation for the resulting TSP that amounts to no more than that of a constrained assignment problem. Computational results on a number of instances are presented. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 370–387, 2015     

基于时变量测方差的多传感器多目标优化分配算法

在目标跟踪过程中,目标的动态模型通常在笛卡尔坐标系中,而量测是在极/球坐标系中得到的。在基于卡尔曼滤波及其一些改进算法中,设定量测方差固定不变,可能导致滤波发散。为此提出了一种基于时变量测方差的多传感器资源管理算法。该算法通过统计方法求出转换测量值误差的均值和方差,利用转化卡尔曼滤波算法估计误差协方差,基于协方差的效能函数进行多传感器多目标分配。仿真结果显示该算法在目标跟踪过程中满足跟踪精度要求,并实现传感器资源的充分的利用。     

双层随机机会约束规划的通信干扰任务分配优化仿真

研究不确定条件下的通信干扰任务分配优化问题具有重要的军事意义。基于干扰效益因子的概念,剖析了影响通信干扰任务分配的不确定性因素,建立了基于双层随机机会约束规划的通信干扰任务分配优化模型,设计了遗传蚁群智能算法,实例计算得到了通信干扰任务分配的最佳策略。