基于星敏感器的姿态优化估计算法

对于采用星敏感器的航天器姿态确定问题,提出了一种快速的姿态优化估计方法;首先,根据Rodrigues参数和观测向量之间的线性关系,引入四元数,构造了不同的非奇异的优化准则;其次,借助四元数,求解了基于该准则的姿态优化算法;误差协方差分析和数值仿真结果表明,该算法与著名的QUaternion ESTmation(QUEST)算法相比,在相同的操作系统环境下,具有相同的姿态估计精度,但计算速度更快,对两种算法选取间隔为2000次的仿真步长,统计数据长度为100个采样点,最后对结果加权求平均值,统计结果显示仅为QUEST的三分之一;这种姿态优化估计方法具有一定的工程应用价值。     

多时滞线性连续系统的最优H∞容错控制

针对状态具有多个时滞的线性连续系统,基于Lyapunov稳定性理论和线性矩阵不等式方法(LMI),采用无时滞记忆的状态反馈控制律,研究了在执行器发生故障的情况下,连续多时滞系统的最优H∞容错控制问题.首先,给出了系统没有干扰输入时存在无记忆状态反馈容错控制器的一个充分条件;进一步,给出了在H∞扰动衰减指标约束下,系统存在无记忆状态反馈H∞容错控制器的一个充分条件;最后,给出了最优无时滞记忆状态反馈H∞容错控制器的设计方法.仿真实例证明了所得最优H∞容错控制嚣设计方法的正确性和有效性.     

基于最优Oustaloup的分数阶PID参数整定

目前工程控制中大部分系统采用传统PID控制,由于分数阶PID继承了传统PID的优点,并且具有更好的控制品质及更强的鲁棒性,因此针对分数阶微积分的高精度数字实现及分数阶PID控制器在工程复杂系统中的实际应用,提出一种新的分数阶微积分高精度数字实现算法-最优Oustaloup数字实现,并建立控制系统的仿真模型,利用框图式模型结合最优ITAE性能指标来整定分数阶PID的参数。通过实例仿真验证,该方法能进一步优化控制器参数,提高控制精度及获得更好的控制效果,便于非线性系统及复杂系统的分数阶PID参数整定。     

Optimal tracking performance of MIMO discrete‐time systems with communication constraints

The optimal tracking problem for multiple‐input multiple‐output linear‐time‐invariant discrete‐time systems with communication constraints in the feedback path is studied in this paper. The tracking performance is measured by the energy of the error signal between the output of the plant and the reference signal. The objective is to obtain an optimal tracking performance, attainable by all possible stabilizing compensators. It is shown that the optimal tracking performance consists of two parts, one depends on the nonminimum phase zeros and zero direction of the given plant, as well as the reference input signal direction, and the other depends on the nonminimum phase zeros, unstable poles, and pole direction of the given plant, as well as the bandwidth and additive white Gaussian noise of the communication channel. It is also shown that, if the constraint of the communication channel does not exist, the optimal tracking performance reduces to the existing tracking performance of the control system without communication constraints. A typical example is given to illustrate the theoretical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Handling multiple objectives with biogeography-based optimization

Biogeography-based optimization (BBO) is a new evolutionary optimization method inspired by biogeography. In this paper, BBO is extended to a multi-objective optimization, and a biogeography-based multi-objective optimization (BBMO) is introduced, which uses the cluster attribute of islands to naturally decompose the problem. The proposed algorithm makes use of nondominated sorting approach to improve the convergence ability effciently. It also combines the crowding distance to guarantee the diversity of Pareto optimal solutions. We compare the BBMO with two representative state-of-the-art evolutionary multi-objective optimization methods, non-dominated sorting genetic algorithm-II (NSGA-II) and archive-based micro genetic algorithm (AMGA) in terms of three metrics. Simulation results indicate that in most cases, the proposed BBMO is able to find much better spread of solutions and converge faster to true Pareto optimal fronts than NSGA-II and AMGA do.     

Optimal Performance in Tracking Stochastic Signal Under Disturbance Rejection

The analysis method of optimal tracking performance is proposed for multiple‐input multiple‐output (MIMO) linear time‐invariant (LTI) systems under disturbance rejection. An H₂ criterion of the error signal between the output of the plant and the reference signal is used as a measure for the tracking performance. Spectral factorization is applied to obtain the optimal solution of the system tracking error. The explicit expressions are derived for this minimal tracking error with respect to random reference signals under disturbance rejection. It is shown that the nonminimum phase zeros, the zero direction, the unstable poles, the pole direction of a given plant, statistical characteristics of the reference input signal, and disturbance signal have a negative effect on a feedback system's ability to reduce the system error with disturbance rejection. The results show that the optimal tracking performance will further be damaged because of disturbance rejection. Some typical examples are given to illustrate the theoretical results.     

Parallel heap: An optimal parallel priority queue

We describe a new parallel data structure, namely parallel heap, for exclusive-read exclusive-write parallel random access machines. To our knowledge, it is the first such data structure to efficiently implement a truly parallel priority queue based on a heap structure. Employing p processors, the parallel heap allows deletions of (p) highest priority items and insertions of (p) new items, each in O(log n) time, where n is the size of the parallel heap. Furthermore, it can efficiently utilize processors in the range 1 through n.This work was supported by U.S. Army's PM-TRADE contract N61339-88-g-0002, Florida High Technology and Industry grant 11-28-716, and Georgia State University's internal research support during spring and summer quarters, 1991.     

基于五层十五级遥感数据结构的并行算法研究

针对当前环境与监测预报小卫星宽覆盖和海量数据显示与处理不足的现状,设计五层十五级遥感数据组织结构,并依据此结构设计一种新的并行计算算法,得到并行计算的最大近优估算值,优化环境与监测预报小卫星海量数据的遥感产品生产能力,提高环境监测预报效率。     

线性矩阵方程异类约束最小二乘解的迭代算法

多矩阵变量线性矩阵方程(LME)约束解的计算问题在参数识别、结构设计、振动理论、自动控制理论等领域都有广泛应用。本文借鉴求线性矩阵方程(LME)同类约束最小二乘解的迭代算法,通过构造等价的线性矩阵方程组,建立了求多矩阵变量LME的一种异类约束最小二乘解的迭代算法,并证明了该算法的收敛性。在不考虑舍入误差的情况下,利用该算法不仅可在有限步计算后得到LME的一组异类约束最小二乘解,而且选取特殊初始矩阵时,可求得LME的极小范数异类约束最小二乘解。另外,还可求得指定矩阵在该LME的异类约束最小二乘解集合中的最佳逼近解。算例表明,该算法是有效的。