Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

备件保障效能动态评估方法

针对目前效能评估方法多重视效能指标的静态观测值，对时序状态数据所蕴含的趋势信息关注较少的缺点，提出基于灰色聚类-粗糙集和集对分析的备件保障效能动态评估方法。针对主客观赋权方法各自的优缺点，引入依赖度和重要度的概念，建立灰色聚类-粗糙集组合赋权模型；将指标权重引入集对理论，提出集对同势、均势和反势的定义，描述备件保障效能的变化规律，构建基于马尔可夫链的集对分析动态模型。实例分析结果表明，该方法可以有效反映备件保障效能的动态变化特征，为决策者制定备件保障长期计划提供科学依据。     

一种变质心高速旋转炮弹鲁棒姿态控制律

针对采用变质心技术的高速旋转炮弹的姿态控制问题,提出一种基于扩张状态观测器的动态面控制方法。根据由弹体和单滑块组成的多体系统的特点,建立了系统的姿态动力学模型,并对其进行了合理的简化。将系统的滚转通道引起的强耦合、建模误差及外部扰动等视为未知不确定干扰,并且考虑由于炮弹尺寸限制而引起的多体系统控制输入(滑块位移)的有限性,设计了扩张状态观测器和辅助系统,分别对系统的干扰进行观测以及处理控制输入的有限性,综合动态面控制技术设计了姿态控制律,最后基于李雅普诺夫稳定性原理证明了控制器的稳定性。仿真结果表明,该控制器能够在克服干扰的前提下快速稳定地跟踪指令信号,具有良好的控制精度和鲁棒性。     

频谱感知次序的在线最优选择

动态频谱接入是解决无线电频谱资源短缺和频谱使用效率低下问题的有效方法,它允许次级用户在授权频谱空闲时动态地接入,以进行数据传输。而频谱感知是实现动态频谱接入的关键挑战之一。由于次级用户的感知能力有限,为了获得更多的频谱接入机会,需要尽快找到频谱空闲概率最大的频段,并研究频谱感知次序问题。考虑到频谱空闲概率对次级用户是不可知的,并且会随时间变化,提出了在线学习框架,把频谱感知次序问题归纳成经典多摇臂赌博机问题,并利用在线学习方法——满意折现汤普森抽样算法处理优化问题。仿真结果表明,和其他算法相比,所提算法可以获得更多的频谱接入机会并且能够跟踪频谱空闲概率的变化。     

多阶段传感器-武器联合任务管理方法

针对动态环境下的传感器-武器联合任务管理问题展开研究。根据在动态作战过程中出现的有效新目标、有效空闲传感器和武器数量设定阶段门限,以决定进入下一阶段的时机,从而构建多阶段的作战过程。从打击方案质量及系统响应时间的角度出发,分析构建分布式作战体系对系统作战效能的影响,使系统在每个任务管理阶段可以决定响应流程。通过仿真实验验证了所构建的分布式作战体系与设定的阶段门限可以明显提升系统的作战效能。     

Studies on the flame propagation characteristic and thermal hazard of the premixed N2O/fuel mixtures

An experimental study was carried out to investigate the flame propagation and thermal hazard of the premixed N₂O/fuel mixtures, including NH₃, C₃H₈ and C₂H₄. The study provided the high speed video images and data about the flame locations, propagation patterns, overpressures and the quenching diameters during the course of combustion in different channels to elucidate the dynamics of various combustion processes. The onset decomposition temperature was determined using high-performance adiabatic calorimetry. It was shown that the order of the flame acceleration rate and thermal hazard was N₂O/C₂H₄>N₂O/C₃H₈>N₂O/NH₃.     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

超压气球上升过程温度与动力学特性仿真分析

针对带加强筋的超压气球,分析上升过程热环境及受力状态,建立热力学与动力学模型并分析其耦合关系。基于MATLAB开发仿真程序,对超压气球进行仿真分析。分析了气球上升过程中高度、速度、温度变化特性,数据表明上升过程中的热力学环境和动力学特性都对球内气体温度有重要影响,气球上升速度和球内气体温度相互耦合并与自由浮力系数存在相关性。飞行试验实测数据验证了仿真结果的准确性。理论分析结果和仿真模型可为后续超压气球设计和飞行试验提供指导。     

高原环境对弹丸动态稳定性的影响

分析了高原环境低空气密度对弹丸动态稳定性的影响。给出了弹道坐标系中的力方程组和非滚转弹体坐标系中的力矩方程组,并通过线性化方法得到弹丸角运动的状态空间模型。列出了角运动状态矩阵的四个特征根,并利用复数平方根计算方法得到特征根实部的表达式。提出弹丸动态稳定性稳定因子的新定义,并证明新的动态稳定条件与传统的动态稳定条件是一致的。讨论了低空气密度对尾翼稳定弹和旋转稳定弹动态稳定性的影响,并通过仿真说明弹丸在高原条件和平原条件下的动态稳定性存在差异。