基于黑板模型的分布式协同任务决策方法研究

基于黑板模型的分布式指挥控制网络为未来复杂环境下海战中多平台间的高效协同提供了新思路,通过构建应用于多航母群联合海战的分布式协同网络,对多航母群联合海战下的系统负载进行了研究,建立了一种多平台任务决策的数学模型,采用嵌套遗传算法进行了仿真求解,得到了理想的任务决策方案。最后对由于目标函数中内部负载权重系数不同取值所引起的不同任务决策结果进行了比较,验证了将基于黑板模型的分布式协同网络应用于多航母海战协同决策的科学性,为分布式海战协同决策网络的后续研究工作奠定了基础。     

改进预测协方差门限法的采样周期自适应选择算法

传感器采样周期是影响目标跟踪的一个重要参数。现有自适应采样周期策略中,一些算法运算量比较大,计算效率低,不具有一般性。为此提出了一种改进的预测协方差门限法。该算法改进传统采样周期的全遍历寻优策略。最后与几种自适应采样周期算法与固定采样周期算法通过交互式多模型(IMM)滤波算法进行仿真比较。仿真结果表明该算法在目标跟踪过程中能满足跟踪需求,具有较少的计算量,较高的运行效率,比固定采样周期算法更能节约资源。     

基于IAFSA的四自由度翼伞分段归航设计

为实现翼伞系统的精确空投,需要对其归航轨迹作合理规划。根据翼伞系统自身的运动特性及操纵特性,采用分段归航策略。在四自由度翼伞模型下,利用各轨迹段的几何关系,建立表征轨迹优劣程度的目标函数。基于改进的人工鱼群算法,对目标函数进行参数寻优,进而得到轨迹的设计参数。仿真结果表明,所提出的改进方法能加快算法的收敛速度,所规划的轨迹满足了精确落点和逆风着陆的要求。     

基于模糊多属性决策的装备维修行为选择

针对装备保障行动中维修行为决策在实践中存在的问题,借助于多属性决策方法和模糊理论,提出基于模糊多属性决策的装备维修行为决策,在分析装备维修行为的影响因素和约束条件的基础上,建立了装备维修行为决策的模型方法,并进行了实例分析。研究表明,该方法能有效降低维修保障费用、缩短维修保障时间和提高维修保障效率。     

一种性能驱动的时序规划方法

在超级计算机体系结构设计阶段 ,有必要进行时序规划 ,以尽早判断设计方案和性能指标的物理可实现性。提出一种性能驱动的时序规划方法 ,采用适于组件性能描述的时序性能模型 ,并按照线网权重分配路径延时余量 ,算法具有效率高、延时分配合理的优点     

A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001     

A risk function for the stochastic modeling of electric capacity expansion

We present a stochastic optimization model for planning capacity expansion under capacity deterioration and demand uncertainty. The paper focuses on the electric sector, although the methodology can be used in other applications. The goals of the model are deciding which energy types must be installed, and when. Another goal is providing an initial generation plan for short periods of the planning horizon that might be adequately modified in real time assuming penalties in the operation cost. Uncertainty is modeled under the assumption that the demand is a random vector. The cost of the risk associated with decisions that may need some tuning in the future is included in the objective function. The proposed scheme to solve the nonlinear stochastic optimization model is Generalized Benders' decomposition. We also exploit the Benders' subproblem structure to solve it efficiently. Computational results for moderate‐size problems are presented along with comparison to a general‐purpose nonlinear optimization package. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:662–683, 2001     

Patterns in spatial point locations: Local indicators of spatial association in a minefield with clutter

The problem of detecting a minefield in the presence of clutter can be abstracted to that of detecting a spatial pattern within a set of point locations. The point locations are superpositions of several patterns, one of which corresponds to mines. In contrast to previous articles that take a formal, model‐based approach, this article proposes a statistical methodology that is distinctly exploratory. Each point location is considered separately, and its contributions to a global measure of spatial distances between locations are featured. Different patterns and unusual points can be more easily identified on the new scale. Both minefield data and simulated point patterns demonstrate the power of the method. © 2001 John Wiley & Sons, Inc., Naval Research Logistics 48:333–347, 2001     

城市环境下单无人机测向定位航迹优化算法

为解决单架无人机在城市环境中对辐射源目标的定位问题,提出了一种基于环境预测法的单无人机测向定位航迹优化算法。使用交互多模型-扩展卡尔曼滤波进行视距和非视距信号混合环境下的目标估计。结合估计的目标位置和城市地理信息模型,基于视线追踪法求解信号遮挡区域和多径信号干扰区域。在滚动时域控制算法框架下生成无人机预测轨迹,以最大化Fisher信息矩阵行列式为测向定位评价准则,考虑建筑物障碍以及其对信号的遮挡和反射效应对无人机测向定位航迹的影响,控制无人机选择最优航向飞行。仿真结果表明,该方法能够使无人机在存在障碍、信号遮挡和多径干扰的环境下实现对目标的高精度测向定位,为解决城市环境下的单架无人机测向定位问题提供了新思路。     

Capacitated selection problem

Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999