基于自适应二阶终端滑模的航天器有限时间姿态机动算法

针对航天器有限时间姿态机动问题,提出一种自适应二阶终端滑模控制算法。设计一种终端滑模面,保证系统状态能够在有限时间内沿滑模面收敛到系统原点;为克服系统抖振,设计了二阶终端滑模控制器,并采用参数自适应估计项补偿系统中的外部干扰力矩。基于Lyapunov函数法证明了二阶自适应终端滑模控制器能够保证闭环系统实际有限时间稳定。仿真结果表明,提出的姿态机动算法响应速度快、精度高,能够有效实现对系统抖振和外部干扰的抑制,具有重要的科学意义和工程应用价值。     

进入角约束下的载机变结构远距引导

针对一般导引律在载机远距引导中存在的问题,结合远距引导的需求,设计了远距引导的三维变结构导引律。该导引律具有较强自适应性,可以使载机以期望的进入角接近目标。仿真结果表明,载机在该导引律作用下,能以较小过载,平滑轨迹快速接近机动目标,并保证载机引导结束时占有有利的空中战术态势。     

助推-滑翔飞行器可达区域影响因素研究

利用Radau伪谱法将连续的助推-滑翔飞行器轨迹优化问题转化为非线性规划问题,通过仿真得到了飞行器完整的可达区域,着重分析了升阻比、终端速度以及终端倾角对飞行器可达区域的影响.研究结果表明,可达区域呈现出类椭圆结构,其地理区域覆盖能力由助推火箭关机点速度决定;与终端倾角对飞行器可达区域的影响相比,飞行器升阻比特性和终端速度的影响相对较大.     

尺度自适应特征压缩跟踪

为在复杂环境中对目标进行长时间精确跟踪,提出一种尺度自适应特征压缩跟踪算法。通过结构约束性采样,获取不同尺度不同位置的扫描窗,离线计算不同尺度下的稀疏随机感知矩阵。在线跟踪时利用这些矩阵感知对应尺度的图像采样块,实现特征降维,提高运算速度。利用朴素贝叶斯分类器对降维特征判决,在线学习更新分类器参数,找出具有最高分类得分的采样块作为新的跟踪结果,实现跟踪位置及尺度的自适应更新。实验结果表明,该算法能适应目标的基本姿态变化及尺度缩放,不依赖于目标初始跟踪区域尺度选取,跟踪结果具有较强的鲁棒性。     

应用于四旋翼无人机角速度估计的几何滑模观测器设计

对四旋翼无人机的角速度进行估计时,传统的基于单位四元数的滑模观测器需要引入强制比例重调,因而影响了跟踪精度。本文提出一种基于数值积分的李群方法的滑模观测器设计框架。该算法基于等变映射思想,在齐性流形空间的等价李代数空间中设计滑模反馈,从而避免了直接在流形空间中设计反馈的复杂性,并消除了传统方法在每个积分步骤中强制加入的比例重调,提高了观测器的跟踪性能。仿真结果表明,几何滑模观测器算法可以有效的对四旋翼无人机的角速度进行估计。     

某型末制导炮弹惯导飞行角运动研究

为研究某型末制导炮弹惯性飞行过程的稳定性,建立该炮弹在惯导飞行阶段有控弹道攻角运动方程.基于该攻角运动方程,求解方程特征根推导出末制导炮弹自由运动的稳定性条件,并给出舵片偏转控制力对弹体强迫作用的解,分别讨论了影响自由运动和受迫运动稳定性的因素.分析结果表明,惯性飞行过程中,舵面参数以及弹丸转动角速度是影响飞行稳定的主要因素,舵片偏转过程与弹丸共振条件无关.     

基于SQP法的助推-滑翔导弹助推段弹道优化

高超声速助推-滑翔导弹的弹道优化问题涉及攻角、法向过载、最大动压等多种约束条件,是一种复杂的最优控制问题。序列二次规划法（ SQP ）是解决该类问题行之有效的数值优化方法。首先给定了助推-滑翔导弹助推段的动力学方程并建立数学模型,之后利用SQP算法对助推-滑翔导弹助推段进行弹道优化仿真,获得满足各种约束条件的优化弹道。经分析可得SQP算法可以为导弹助推段寻找到一条最优弹道,从而为助推-滑翔导弹的整体结构设计提供了有益的参考。     

递归划分的标签约束可达性计算方法

现实世界中的图往往在结点和边上包含描述信息,可达性查询是图数据管理和挖掘中的基本操作之一。针对图数据中标签约束的可达性计算问题,提出一种基于递归划分的可达性计算方法 RP-Hop。该算法基于层次划分思想,利用独立集性质,在保持标签和可达性前提下对大规模图进行递归划分,并结合贪婪扩展思想和递归编码,为标签约束的可达性查询提供压缩索引。经过合成和真实数据集上的实验,结果表明,RP-Hop算法不仅降低了索引大小和构建时间,而且提高了查询效率。     

Dynamic inventory control with limited capital and short‐term financing

For most firms, especially the small‐ and medium‐sized ones, the operational decisions are affected by their internal capital and ability to obtain external capital. However, the majority of the literature on dynamic inventory control ignores the firm's financial status and financing issues. An important question that arises is: what are the optimal inventory and financing policies for firms with limited internal capital and limited access to external capital? In this article, we study a dynamic inventory control problem where a capital‐constrained firm periodically purchases a product from a supplier and sells it to a market with random demands. In each period, the firm can use its own capital and/or borrow a short‐term loan to purchase the product, with the interest rate being nondecreasing in the loan size. The objective is to maximize the firm's expected terminal wealth at the end of the planning horizon. We show that the optimal inventory policy in each period is an equity‐level‐dependent base‐stock policy, where the equity level is the sum of the firm's capital level and the value of its on‐hand inventory evaluated at the purchasing cost; and the structure of the optimal policy can be characterized by four intervals of the equity level. Our results shed light on the dynamic inventory control for firms with limited capital and short‐term financing capabilities.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 184–201, 2014     

The quay crane scheduling problem with time windows

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high‐priority vessels while serving low‐priority vessels casually. This article provides a mathematical formulation of the problem and a tree‐search‐based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011