Variance-constrained control for uncertain stochastic systems with missing measurements

Copyright [2005] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this paper, we are concerned with a new control problem for uncertain discrete-time stochastic systems with missing measurements. The parameter uncertainties are allowed to be norm-bounded and enter into the state matrix. The system measurements may be unavailable (i.e., missing data) at any sample time, and the probability of the occurrence of missing data is assumed to be known. The purpose of this problem is to design an output feedback controller such that, for all admissible parameter uncertainties and all possible incomplete observations, the system state of the closed-loop system is mean square bounded, and the steady-state variance of each state is not more than the individual prescribed upper bound. We show that the addressed problem can be solved by means of algebraic matrix inequalities. The explicit expression of the desired robust controllers is derived in terms of some free parameters, which may be exploited to achieve further performance requirements. An illustrative numerical example is provided to demonstrate the usefulness and flexibility of the proposed design approach

DOC 2015-03 Master of Finance

Legislative Authority. Constitution of the Academic Senate of the University of Dayton, Article ll.B.

Self-Evaluation Applied Mathematics 2003-2008 University of Twente

This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008

Central Florida Future, Vol. 38 No. 60, April 13, 2006

https://stars.library.ucf.edu/centralfloridafuture/2899/thumbnail.jp

Stochastic consensus over noisy networks with Markovian and arbitrary switches

This paper considers stochastic consensus problems over lossy wireless networks. We first propose a measurement model with a random link gain, additive noise, and Markovian lossy signal reception, which captures uncertain operational conditions of practical networks. For consensus seeking, we apply stochastic approximation and derive a Markovian mode dependent recursive algorithm. Mean square and almost sure (i.e., probability one) convergence analysis is developed via a state space decomposition approach when the coefficient matrix in the algorithm satisfies a zero row and column sum condition.Subsequently,we consider a model with arbitrary random switching and a common stochastic Lyapunov function technique is used to prove convergence. Finally,our method is applied to models with heterogeneous quantizers and packet losses, and convergence results are proved

Optimization flow control -- I: Basic algorithm and convergence

We propose an optimization approach to flow control where the objective is to maximize the aggregate source utility over their transmission rates. We view network links and sources as processors of a distributed computation system to solve the dual problem using a gradient projection algorithm. In this system, sources select transmission rates that maximize their own benefits, utility minus bandwidth cost, and network links adjust bandwidth prices to coordinate the sources' decisions. We allow feedback delays to be different, substantial, and time varying, and links and sources to update at different times and with different frequencies. We provide asynchronous distributed algorithms and prove their convergence in a static environment. We present measurements obtained from a preliminary prototype to illustrate the convergence of the algorithm in a slowly time-varying environment. We discuss its fairness property