控制分配在平流层飞艇姿态控制中的应用

针对平流层飞艇一般采用多控制机构的特点,将广义逆控制分配方法应用到飞艇姿态控制系统中,并根据飞艇控制机构特性采用了加权伪逆控制分配算法。飞艇姿态控制仿真结果表明:设计的控制分配方法可以有效实现多控制机构的协调操纵,对姿态角控制效果良好,避免了单一操纵舵面过早进入饱和状态的情况;合理调整控制分配权值可减少能量损耗,增强实时性,便于工程实现。     

基于主成分的改进马氏距离TOPSIS方法

针对指标变量线性相关,导致变量协方差矩阵行列式(广义样本方差)为零无法应用马氏距离的情况,采用主成分分析法对指标变量进行线性组合,在不减少信息量的同时,得到少数几个不相关的主成分,由主成分构成的协方差矩阵行列式不再为零。依据降维后的主成分变量,采用基于马氏距离的逼近理想解法对五种预警机探测引导能力进行了排序,经检验其结果与实际情况相符。     

基于T-S模型的非线性系统主从控制器设计

针对同时具有输出和输入非线性的系统,通过中间虚拟控制量的设置,转化为两个非线性子系统的串联,从而简化系统结构并解决最终控制量不宜直接获取的问题。针对无人水面艇的航迹和横摇控制,设计了基于反演控制的从控制器,实现了输入非线性中虚拟控制量到舵角的映射,通过T-S模型将输出非线性系统,转化为线性时变系统,并考虑舵机的角度与角速度约束,设计了广义预测主控制器。该方法不仅简化了系统结构,同时仿真结果表明,所设计的主从控制器可以获得较好的控制效果。     

The burglar problem with multiple options

We consider the burglar problem in which a burglar can either retire or choose among different types of burglaries, with each type having its own success probability and reward distribution. Some general structural results are established and, in the case of exponentially distributed reward distributions, a solution technique is presented. The burglar problem's relationship to a stochastic knapsack problem with a random exponentially distributed knapsack capacity is shown. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 359–364, 2014     

A branch‐and‐price approach for the stochastic generalized assignment problem

In this article, we address a stochastic generalized assignment machine scheduling problem in which the processing times of jobs are assumed to be random variables. We develop a branch‐and‐price (B&P) approach for solving this problem wherein the pricing problem is separable with respect to each machine, and has the structure of a multidimensional knapsack problem. In addition, we explore two other extensions of this method—one that utilizes a dual‐stabilization technique and another that incorporates an advanced‐start procedure to obtain an initial feasible solution. We compare the performance of these methods with that of the branch‐and‐cut (B&C) method within CPLEX. Our results show that all B&P‐based approaches perform better than the B&C method, with the best performance obtained for the B&P procedure that includes both the extensions aforementioned. We also utilize a Monte Carlo method within the B&P scheme, which affords the use of a small subset of scenarios at a time to estimate the “true” optimal objective function value. Our experimental investigation reveals that this approach readily yields solutions lying within 5% of optimality, while providing more than a 10‐fold savings in CPU times in comparison with the best of the other proposed B&P procedures. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 131–143, 2014     

DEFENSIVE COUNTERTERRORISM MEASURES AND DOMESTIC POLITICS

Unlike most of the literature, this paper includes domestic political considerations in which two countries must decide defensive countermeasures against a common terrorist threat. A delegation problem arises as voters strategically choose a policymaker whose preferences differ from their own. As a consequence, countries limit the presumed oversupply of defensive countermeasures. Thus, the inclusion of domestic politics gives a new perspective on counterterrorism. The timing of elections is also shown to make a difference.     

THE MORAL PERMISSIBILITY OF AUTOMATED RESPONSES DURING CYBERWARFARE

Automated responses are an inevitable aspect of cyberwarfare, but there has not been a systematic treatment of the conditions in which they are morally permissible. We argue that there are three substantial barriers to the moral permissibility of an automated response: the attribution, chain reaction, and projection bias problems. Moreover, these three challenges together provide a set of operational tests that can be used to assess the moral permissibility of a particular automated response in a specific situation. Defensive automated responses will almost always pass all three challenges, while offensive automated responses typically face a substantial positive burden in order to overcome the chain reaction and projection bias challenges. Perhaps the most interesting cases arise in the middle ground between cyber-offense and cyber-defense, such as automated cyber-exploitation responses. In those situations, much depends on the finer details of the response, the context, and the adversary. Importantly, however, the operationalizations of the three challenges provide a clear guide for decision-makers to assess the moral permissibility of automated responses that could potentially be implemented.     

Limiting behavior of the stochastic sequential assignment problem

The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

基于广义模糊函数的MIMO SAR分辨特性分析

多发多收合成孔径雷达（MIMO SAR）是近年来发展起来的一种新型雷达体制。与传统SAR相比,MIMO SAR综合利用了波形分集和空间分集优势,如何衡量系统的分辨特性以及模糊特性成为亟待解决的问题。本文将模糊函数概念推广到MIMO SAR性能分析中,通过数学推导获得了广义模糊函数的解析表示,结果表明MIMO SAR系统分辨率不仅取决于发射波形参数以及合成孔径长度,还与发射波形集的正交性以及收发天线阵列流形密切相关,仿真实验验证了系统模型的有效性和相应分析的正确性。     

自由飘浮空间机器人准刚性分解运动轨迹控制与仿真

研究轨道空间机器人操作时,基座处于自由飘浮状态的手爪准刚性运动直角坐标轨迹的分解运动控制,重点分析了广义雅可比矩阵的计算,并进行了空间单手３—ＤＯＦ的仿真,该方法可相应推广到开链多手。