2007
DOI: 10.1016/j.automatica.2006.12.002
|View full text |Cite
|
Sign up to set email alerts
|

Systematic ultimate bound computation for sampled-data systems with quantization

Abstract: We present a novel systematic method to obtain componentwise ultimate bounds in perturbed sampled-data systems, especially when the perturbations arise due to quantization. The proposed method exploits the system geometry as well as the perturbation structure, and takes intersample behavior into account. The main features of the method are its systematic nature, whereby it can be readily computer coded, without requiring adjustment of parameters for its application, and its suitability for dealing with highly … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 29 publications
(22 citation statements)
references
References 17 publications
0
22
0
Order By: Relevance
“…[14]) and on the extension and application of the current results to networked control systems (cf. [5]) and to switching systems with mixed continuous-and discrete-time dynamics.…”
Section: Discussionmentioning
confidence: 99%
“…[14]) and on the extension and application of the current results to networked control systems (cf. [5]) and to switching systems with mixed continuous-and discrete-time dynamics.…”
Section: Discussionmentioning
confidence: 99%
“…We provide here a general invariance result and point to Kofman, Haimovich, and Seron (2007) for the proof and to Haimovich, Kofman, and Seron (2007), Olaru et al (2008) and Stoican, Olaru, De Doná, and Seron (2011) for refinements in terms of conservativeness.…”
Section: Appendix a Background On Ubi Setsmentioning
confidence: 98%
“…where A = AC + AA, I AC = A + B(1 + H)K , B = A1 + A4 AAc = AA + AB(1+ H)K, Lemma 1 For any matrices E and F with appropriate dimensions and scalar e > 0, then the following inequality holds: EF + FTET < .-1EET +eFTF (9) Proof: Using the fact that for any two matrices E, F and scalar £ > 0, we have the following result:…”
Section: + Asmentioning
confidence: 99%
“…The stability analysis of networked control systems(NCSs) with quantized feedback control law has been extensively investigated( [1][2][3][4][5][6][7][8][9][10]]) since NCSs have been widely applied to various fields comprise spatially distributed resource allocation networks, supervisory control of continuous plants, intelligent vehicle highway systems, power generation or distribution networks, wireless networks and many others. There are some features specific to NCSs such as inherent interregnum, nondeterminism and the variety of control mechanisms which significantly aggravate both performance and stability analysis of system, especially, for uncertain system.…”
Section: Introductionmentioning
confidence: 99%