H∞ filtering for discrete-time systems subject to stochastic missing measurements: a decomposition approach

This paper deals with the problem of H_∞ filtering for discrete-time systems with stochastic missing measurements. A new missing measurement model is developed by decomposing the interval of the missing rate into several segments. The probability of the missing rate in each subsegment is governed by its corresponding random variables. We aim to design a linear full-order filter such that the estimation error converges to zero exponentially in the mean square with a less conservatism while the disturbance rejection attenuation is constrained to a given level by means of an H_∞ performance index. Based on Lyapunov theory, the reliable filter parameters are characterised in terms of the feasibility of a set of linear matrix inequalities. Finally, a numerical example is provided to demonstrate the effectiveness and applicability of the proposed design approach.     

On the Design of Observer for Nonlinear Time‐Delay Systems

This paper suggests a new method to design observers in a class of nonlinear time‐delay systems with delays in system states. The method is based on an extension of the well‐known state‐dependent Riccati equation (SDRE) technique. The conditions for locally asymptotic stability of the proposed observer are investigated. Some numerical simulations are provided to show the design procedure and the flexibility of the proposed observer.     

A generalized robust H ∞ filtering for singular Markovian jump systems and its applications

In this paper, a generalized robust H _∞ filtering method is proposed for a class of singular Markovian jump systems, whose generality is mainly embodied that the desired filter could bear perturbances in terms of uncertainties on its parameter matrices. Firstly, an LMI condition of robust mode‐dependent filter is developed. Based on the given result, a new approach to mode‐independent H _∞ filter is presented, which establishes a direct connection between mode‐dependent and mode‐independent filters. Secondly, when the transition rate matrix is with elementwise bounded uncertainties or partially unknown, sufficient conditions of such robust mode‐dependent and mode‐independent filters are all developed within LMI frameworks. Finally, a numerical example is used to demonstrate the effectiveness of the proposed methods. Copyright © 2013 John Wiley & Sons, Ltd.     

非线性时变时滞奇异系数的保性能控制设计

讨论了非线性时变时滞奇异系统的保性能控制问题,对于带有时变时滞的非线性奇异系统,给出了设计一个状态反馈控制律使得闭环系统是渐进稳定的且闭环系统的性能函数值不大于给定的一个数的充分条件;并利用线性不等式（LMI）给出了设计最优状态反馈控制律的方法,通过一个算例说明此方法的可行性.     

带有传感器故障的模糊时滞系统的容错控制

针对一类连续非线性时滞系统,在状态不完全可测的情况下,研究了带有传感器故障的容错控制问题。采用T-S模型对非线性系统进行模糊建模,通过构造广义系统设计了观测器,同时估计出系统的状态与故障,进一步利用平行分布补偿算法（PDC）设计基于观测器的模糊容错控制器,给出了保证该模糊容错控制系统稳定的充分条件。仿真例子进一步验证了所提出方法的有效性。     

输入受限线性系统鲁棒抗饱和控制

针对抗饱和控制的鲁棒性问题,将研究扩展到对输入饱和非线性、时变参数和动态不确定性具有结构摄动的鲁棒性框架内,给出了一种线性时不变系统鲁棒抗饱和控制算法.鉴于积分二次型约束具有刻画结构不确定性的能力,选择在积分二次型约束框架下解决问题.以定标的线性矩阵不等式形式给出了系统分析和控制综合条件.飞行控制仿真结果说明此算法不仅可以成功克服饱和非线性,且对时变参数和动态不确定性具有良好的鲁棒性.     

一类广义集值强非线性混合拟变分不等式(英文)

引进一类广义集值强非线性混合拟变分不等式,并且用投影技巧证明了它解的存在性.推广了广义集值强非线性混合变分不等式的许多结论.     

时滞中立型神经网络全局渐近稳定性

针对具有时变时滞的中立型Hopfield神经网络,在对时变时滞的合理假设下,文中通过构造适当的Lyapunov泛函,提出了一种新的方法判定时变时滞中立型Hopfield神经网络系统的全局一致渐近稳定性。所得判据是建立在一个代数Riccati方程及其对应离散Lyapunov方程存在对称正定解之上的,并得出了易于计算机仿真实现的线性矩阵不等式的判据形式,仿真验证了结果的有效性。     

一类非线性时滞系统的鲁棒H_∞混杂状态观测器设计

研究一类基于切换的非线性时滞系统的鲁棒状态观测器的设计问题.在系统存在有限个备选的状态观测器,并且每一个单一的观测器均不是系统的鲁棒H∞观测器的假设下,针对状态观测器增益矩阵全部已知或全部未知的2种情形,分别利用单Lyapunov函教技术和多Lyapunov函数技术,设计出状态观测器间的切换律,并获得了保证误差系统渐近稳定和H∞范数有界的2个充分条件.且当增益矩阵全部未知时,给出了增益矩阵的显式表达.     

Low-complexity optimal spatial channel pairing for AF-based multi-pair two-way relay networks

This paper considers a multi-pair two-way relay system with multi-antenna users and proposes a low-complexity optimal spatial channel pairing （SCP） strategy at the relay station （RS） for such a system. The proposed SCP scheme, following the BD-like beamformer at RS, pairs the uplink spatial subchannels of each user pair with the corresponding downlink spatial subchannels by maximizing sum-rate （Max-SR）. Furthermore, a new mathematical inequality （arrangement inequalities of a product） is developed and applied to obtain sufficient and necessary conditions for achieving Max-SR-SCP. This also yields a simple low-complexity implementation of the proposed SCP in contrast to the NP-hard complexity of the original Max-SR-SCP problem. Simulation results illustrate that the proposed Max-SR-SCP achieves substantial sum-rate gains over other pairing schemes.