March 2008
Systems Science;2008, Vol. 34 Issue 1, p39
Academic Journal
The paper considers a set of linear discrete-time systems with uncertain parameters. A method of synthesis of robust control which simultaneously stabilizes all the systems from this set is proposed. This method consists of two steps. First, a set of stochastic comparison systems with multiplicative noises is constructed such that if the stochastic system from this set is mean square stable then the corresponding system with uncertain parameters from the original set is robustly stable. Second, the simultaneous stabilization problem for the comparison system is solved. To find a gain matrix of the simultaneously stabilizing controller in the case of state feedback an LMI based algorithm is given and in the case of static output feedback a new method and convergent iteration algorithm are obtained.


Related Articles

  • Robust Finite-Time ... Control for Uncertain Systems Subject to Intermittent Measurements. Zhenghong Deng // Discrete Dynamics in Nature & Society;2012, p1 

    This paper investigates the robust finite-time ... controller design problem of discrete-time systems with intermittent measurements. It is assumed that the system is subject to the norm-bounded uncertainties and the measurements are intermittent. The Bernoulli process is used to describe the...

  • Stability of Semi-Implicit and Iterative Centered-Implicit Time Discretizations for Various Equation Systems Used in NWP. BĂ©nard, P. // Monthly Weather Review;Oct2003, Vol. 131 Issue 10, p2479 

    The stability of the classical semi-implicit scheme and some more advanced iterative schemes recently proposed for NWP purposes is examined. In all of these schemes, the solution of the centered-implicit nonlinear equation is approached by an iterative fixed-point algorithm, preconditioned by a...

  • A Novel Approach Based on MEMS-Gyro's Data Deep Coupling for Determining the Centroid of Star Spot. Zhong-hua Wei; Xia Zhao; Ke-wen Wang; Yan Xiong // Mathematical Problems in Engineering;2012, Vol. 2012, Special section p1 

    The traditional approach of star tracker for determining the centroid of spot requires enough energy and good shape, so a relatively long exposure time and stable three-axis state become necessary conditions to maintain high accuracy, these limit its update rate and dynamic performance. In view...

  • Bus Dispatching Interval Optimization Based on Adaptive Bacteria Foraging Algorithm. Zhong-hua Wei; Xia Zhao; Ke-wen Wang; Yan Xiong // Mathematical Problems in Engineering;2012, Vol. 2012, Special section p1 

    The improved bacterial foraging algorithm was applied in this paper to schedule the bus departing interval. Optimal interval can decrease the total operation cost and passengers' mean waiting time. The principles of colony sensing, chemotactic action, and improved foraging strategy made this...

  • Tree approximation for discrete time stochastic processes: a process distance approach. Kovacevic, Raimund; Pichler, Alois // Annals of Operations Research;Dec2015, Vol. 235 Issue 1, p395 

    Approximating stochastic processes by scenario trees is important in decision analysis. In this paper we focus on improving the approximation quality of trees by smaller, tractable trees. In particular we propose and analyze an iterative algorithm to construct improved approximations: given a...

  • Stable iterative adaptive dynamic programming algorithm with approximation errors for discrete-time nonlinear systems. Wei, Qinglai; Liu, Derong // Neural Computing & Applications;May2014, Vol. 24 Issue 6, p1355 

    In this paper, a novel iterative adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon optimal control problems for discrete-time nonlinear systems. When the iterative control law and iterative performance index function in each iteration cannot be accurately...

  • New iterative algorithms for coupled matrix equations. Lingling Lv; Lei Zhang // Journal of Computational Analysis & Applications;Dec2015, Vol. 19 Issue 6, p947 

    Iterative algorithms are presented for solving coupled matrix equations including the well-known coupled Sylvester matrix equations and the discrete-time coupled Markovian jump Lyapunov matrix equations as special cases. The proposed methods remove the restriction that the considered matrix...

  • A Finite Iterative Method for Solving the General Coupled Discrete-Time Periodic Matrix Equations. Hajarian, Masoud // Circuits, Systems & Signal Processing;Jan2015, Vol. 34 Issue 1, p105 

    Analysis and design of linear periodic control systems are closely related to the discrete-time periodic matrix equations. In this paper, we propose an iterative algorithm based on the conjugate gradient method on the normal equations (CGNE) for finding the solution group of the general coupled...

  • Iterated function system models in data analysis: Detection and separation. Alexander, Zachary; Meiss, James D.; Bradley, Elizabeth; Garland, Joshua // Chaos;Jun2012, Vol. 22 Issue 2, p023103 

    We investigate the use of iterated function system (IFS) models for data analysis. An IFS is a discrete-time dynamical system in which each time step corresponds to the application of one of the finite collection of maps. The maps, which represent distinct dynamical regimes, may be selected...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics