\(H_ \infty\)-optimal sampled-data control: Computation and design (Q1911253): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0005-1098(96)85551-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111018362 / rank
 
Normal rank

Revision as of 01:55, 20 March 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
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    \(H_ \infty\)-optimal control
    0 references
    sampled-data systems
    0 references
    discrete-time
    0 references
    0 references