Ellipsoidal bounds on state trajectories for discrete-time systems with linear fractional uncertainties
Name
11081_2014_Article_9255.pdf
Size
1.4 MB
Format
Adobe PDF
Checksum (MD5)
30d97d74dc0557431021d4cb0ccc8666
Author(s)
Kishida, Masako
Braatz, Richard D
Date Issued
March 2014
Journal
Optimization and Engineering
Publisher
Springer US
Citation
Kishida, Masako, and Richard D. Braatz. “Ellipsoidal Bounds on State Trajectories for Discrete-Time Systems with Linear Fractional Uncertainties.” Optimization and Engineering 16.4 (2015): 695–711.
Version
Author's final manuscript
Abstract
Computation of exact ellipsoidal bounds on the state trajectories of discrete-time linear systems that have time-varying or time-invariant linear fractional parameter uncertainties and ellipsoidal uncertainty in the initial state is known to be NP-hard. This paper proposes three algorithms to compute ellipsoidal bounds on such a state trajectory set and discusses the tradeoffs between computational complexity and conservatism of the algorithms. The approach employs linear matrix inequalities to determine an initial estimate of the ellipsoid that is refined by the subsequent application of the skewed structured singular value ν. Numerical examples are used to illustrate the application of the proposed algorithms and to compare the differences between them, where small conservatism for the tightest bounds is observed.
MIT Department
Massachusetts Institute of Technology. Department of Chemical Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s11081-014-9255-9
