\(H_ \infty\)-optimal sampled-data control: Computation and design (Q1911253): Difference between revisions
From MaRDI portal
Latest revision as of 10:35, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(H_ \infty\)-optimal sampled-data control: Computation and design |
scientific article |
Statements
\(H_ \infty\)-optimal sampled-data control: Computation and design (English)
0 references
21 April 1996
0 references
\(H_\infty\)-optimal control of sampled-data systems is considered. The \(H_\infty\) analysis for the synthesis problem requires iteration on the achievable performance level \(\gamma\). For each iteration, the sampled-data problem is reduced to an equivalent discrete-time problem. In this paper, a new set of formulas is obtained for the equivalent discrete-time system; in each iteration, the formulas depend on computing only one matrix exponential function. The formulas are applied to a design example, yielding interesting results.
0 references
\(H_ \infty\)-optimal control
0 references
sampled-data systems
0 references
discrete-time
0 references
0 references
0 references
0 references
0 references
0 references
0 references