BTT导弹状态反馈H_∞控制自动驾驶仪设计

针对倾斜转弯(BTT)导弹自动驾驶仪的抗干扰性和鲁棒性问题,以考虑耦合的情况下建立的更接近于实际的导弹数学模型为基础,将通道间的耦合作为干扰,在弹道特征点上对导弹模型进行解耦和线性化,得到各个通道的数学模型;设计基于线性矩阵不等式(LMI)的状态反馈H_∞控制自动驾驶仪,搭建全耦合状态下的三通道仿真模型,并进行联合仿真研究。结果表明所设计的状态反馈H_∞控制自动驾驶仪能够实现对导弹制导指令的有效跟踪,满足BTT导弹控制的要求。     

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

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

通信时延对无人作战飞机NWL轰炸精度影响研究

无人作战飞机具有飞行器与指挥平台"空地分离"的技术特征,源自飞行员的战术决策指令须通过战术数据链传输给飞机,该特性在空地轰炸模式下将对系统作战效能产生一定的影响。建立了面向无人作战飞机的空地一体化机翼非水平(NWL,Non-Wing-Level)轰炸仿真模型,通过Monte-Carlo仿真表明脱靶量与数据链时延之间存在线性关系,采用Kalman滤波可以克服时延对脱靶量的影响,并提高命中精度。     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

Optimally scheduling interfering and non‐interfering cranes

This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail‐mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium‐sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile.     

基于FrFT的差分跳频通信LFM干扰抑制算法

针对差分跳频通信系统抗LFM干扰能力不足的问题,利用差分跳频信号和LFM干扰信号调频斜率参数的不同,通过估计采样信号中LFM干扰信号的调频斜率K和旋转阶次α参数,结合分段、参数估计和均值处理提高估计精度,进一步在采样信号的分数阶时频域二维参数平面(α,μ)中利用LFM干扰信号频带外的平面均值替代LFM信号成分,实现对差分跳频通信中LFM干扰信号的抑制。仿真结果表明,该算法可有效抑制差分跳频信号中LFM干扰信号,提高信噪比约11 d B。     

基于节点综合效能的DTN路由算法

针对容忍延迟网络(DTN)高延迟、数据传输成功率低等问题,提出了一种基于节点综合效能的DTN路由算法SERA。该算法综合考虑移动节点的活跃度和剩余能量,使消息副本向综合效能高的节点扩散。SERA节点活跃度描述了节点的社会和动态特性,SERA尽量将消息副本传递给活跃度高的节点,以提高消息传输的成功率;在选择中继节点时,充分考虑节点的能量状态,以避免能量不足的节点承担更多的信息传输任务,从而提高网络节点的存活率。仿真结果表明,与典型的DTN路由算法相比,SERA能够更好地平衡节点的能耗,获得更高的消息递交成功率和更长的网络生存期。     

基于GA-ML-PMHT的多基站无源协同定位方法

针对无源协同定位系统中低可观测目标的航迹初始及维持问题,提出一种基于遗传算法的极大似然概率多假设的多基站无源协同定位方法。首先,建立多基站无源协同定位系统数学模型。其次,提出基于极大似然概率多假设的无源协同定位航迹初始算法,并首次利用遗传算法解决极大似然概率多假设中的优化求解问题,以提高目标检测跟踪性能。最后,通过滑窗法实现航迹维持。仿真结果表明,所提方法能够有效解决多基站无源协同定位系统中低可观测目标的航迹初始及维持问题。     

数据并行程序设计语言中分布数组的地址计算

本文讨论了在大规模并行计算机上实现数据并行程序设计语言的关键问题──分布数组的地址计算问题。文中详细给出了维分布数组的下标地址计算公式,分布数组的内情向量结构以及分布数组映射函数算法,并对有关编译实现技术进行了探讨。