5,429 research outputs found

    Robust H∞ filtering for markovian jump systems with randomly occurring nonlinearities and sensor saturation: The finite-horizon case

    Get PDF
    This article is posted with the permission of IEEE - Copyright @ 2011 IEEEThis paper addresses the robust H∞ filtering problem for a class of discrete time-varying Markovian jump systems with randomly occurring nonlinearities and sensor saturation. Two kinds of transition probability matrices for the Markovian process are considered, namely, the one with polytopic uncertainties and the one with partially unknown entries. The nonlinear disturbances are assumed to occur randomly according to stochastic variables satisfying the Bernoulli distributions. The main purpose of this paper is to design a robust filter, over a given finite-horizon, such that the H∞ disturbance attenuation level is guaranteed for the time-varying Markovian jump systems in the presence of both the randomly occurring nonlinearities and the sensor saturation. Sufficient conditions are established for the existence of the desired filter satisfying the H∞ performance constraint in terms of a set of recursive linear matrix inequalities. Simulation results demonstrate the effectiveness of the developed filter design scheme.This work was supported in part by the National Natural Science Foundation of China under Grants 61028008, 60825303, and 61004067, National 973 Project under Grant 2009CB320600, the Key Laboratory of Integrated Automation for the Process Industry (Northeastern University) from the Ministry of Education of China, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K., under Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

    Fault detection for markovian jump systems with sensor saturations and randomly varying nonlinearities

    Get PDF
    This is the post-print version of the Article. The official published version can be accessed from the link below - Copyright @ 2012 IEEE.This paper addresses the fault detection problem for discrete-time Markovian jump systems with incomplete knowledge of transition probabilities, randomly varying nonlinearities and sensor saturations. For the Markovian mode jumping, the transition probability matrix is allowed to have partially unknown entries, while the cases with completely known or completely unknown transition probabilities are also investigated as two special cases. The randomly varying nonlinearities and the sensor saturations are introduced to reflect the limited capacity of the communication networks resulting from the noisy environment, probabilistic communication failures, measurements of limited amplitudes, etc. Two energy norm indices are used for the fault detection problem in order to account for, respectively, the restraint of disturbance and the sensitivity of faults. The purpose of the problem addressed is to design an optimized fault detection filter such that 1) the fault detection dynamics is stochastically stable; 2) the effect from the exogenous disturbance on the residual is attenuated with respect to a minimized H∞-norm; and 3) the sensitivity of the residual to the fault is enhanced by means of a maximized H∞-norm. The characterization of the gains of the desired fault detection filters is derived in terms of the solution to a convex optimization problem that can be easily solved by using the semi-definite programme method. Finally, a simulation example is employed to show the effectiveness of the fault detection filtering scheme proposed in this paper.This work was supported in part by the National 973 Project under Grant 2009CB320600, the National Natural Science Foundation of China under Grants 61028008, 61134009, 60825303, 90916005 and 61004067, the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., and the Alexander von Humboldt Foundation of Germany

    Efficient Transition Probability Computation for Continuous-Time Branching Processes via Compressed Sensing

    Full text link
    Branching processes are a class of continuous-time Markov chains (CTMCs) with ubiquitous applications. A general difficulty in statistical inference under partially observed CTMC models arises in computing transition probabilities when the discrete state space is large or uncountable. Classical methods such as matrix exponentiation are infeasible for large or countably infinite state spaces, and sampling-based alternatives are computationally intensive, requiring a large integration step to impute over all possible hidden events. Recent work has successfully applied generating function techniques to computing transition probabilities for linear multitype branching processes. While these techniques often require significantly fewer computations than matrix exponentiation, they also become prohibitive in applications with large populations. We propose a compressed sensing framework that significantly accelerates the generating function method, decreasing computational cost up to a logarithmic factor by only assuming the probability mass of transitions is sparse. We demonstrate accurate and efficient transition probability computations in branching process models for hematopoiesis and transposable element evolution.Comment: 18 pages, 4 figures, 2 table

    H∞ model reduction for discrete-time Markovian jump systems with deficient mode information

    Get PDF
    This paper investigates the problem of H∞ model reduction for a class of discrete-time Markovian jump linear systems (MJLSs) with deficient mode information, which simultaneously involves the exactly known, partially unknown, and uncertain transition probabilities. By fully utilizing the properties of the transition probability matrices, together with the convexification of uncertain domains, a new H∞ performance analysis criterion for the underlying MJLSs is first derived, and then two approaches, namely, the convex linearisation approach and iterative approach, for the H∞ model reduction synthesis are proposed. Finally, a simulation example is provided to illustrate the effectiveness of the proposed design methods
    corecore