.png){kind=icon}
.png){kind=icon}
Return
Probabilistic set invariance and ultimate boundedness
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2012.06.074.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The notions of invariant sets and ultimate bounds are important concepts in the analysis of dynamical systems and very useful tools for the design of control systems. Several approaches have been reported for the characterisation of these sets, including constructive methods for their computation and procedures to obtain different approximations. However, there are shortcomings in those concepts, in the sense that no general probability distributions can be considered for the disturbances affecting the system (which, for example, precludes the assumption of Gaussian distributions insofar as they are not bounded). Motivated by those shortcomings, we propose in this paper the novel concepts of probabilistic ultimate bounds and probabilistic invariant sets, which extend the notions of invariant sets and ultimate bounds to consider 'containment in probability', and have the important feature of allowing stochastic noises with more general distributions, including the ubiquitous Gaussian distribution, to be considered. We introduce some key definitions for these sets, establish their main properties and develop methods for their computation. A numerical example illustrates the main ideas. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
Invariant sets
Ultimate bounds
Linear systems
Probabilistic methods
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W