Skip to main content

The Discrete-Time Minimax Design Problem With Perfect State Measurements

  • Chapter
H∞-Optimal Control and Related

Part of the book series: Systems & Control: Foundations & Applications ((SCFA))

  • 412 Accesses

Abstract

In this chapter, we study the discrete-time minimax controller design problem, as formulated by (1.6)-(1.7), when the controller is allowed to have perfect access to the system state, either without or with one step delay. We first consider the case when the controlled output is a concatenation of the system state and the current value of the control, and the initial state is zero; that is, the system dynamics and the performance index are (without any loss of generality in this class):

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Here, even though the sets U and W are not compact, it follows from the quadratic nature of the objective function that u and w can be restricted to closed and bounded (hence compact) subsets of finite-dimensional spaces, without affecting the saddle-point solution. Hence, Theorem 2.3 can be used.

    Google Scholar 

  2. For this terminology, see Section 2.2.

    Google Scholar 

  3. This result follows readily from Remark 3.1.

    Google Scholar 

  4. This bound is the largest root of the polynomial 5s3 — 1382 + 7s — 1.

    Google Scholar 

  5. This bound is the largest root of the polynomial 13s3 — 19s2 + 8s — 1.

    Google Scholar 

  6. We will shortly see that this is true also for the infinite-horizon case.

    Google Scholar 

  7. This condition holds when ry° ry*, which (intuitively) is generally the case, due to loss of information to the controller under delayed state information.

    Google Scholar 

  8. Henceforth, in this section, we take all the system matrices, in (3.1) and (3.2a), as constant matrices.

    Google Scholar 

  9. This fact has already been used in the proof of Theorem 3.2.

    Google Scholar 

  10. Here the gain coefficient of the controller remains bounded as -y y, by (the infinite-horizon version of) Lemma 3.2.

    Google Scholar 

  11. One such sufficient condition is Q 0, under which boundedness of upper value implies input-output stability under controller (3.59a).

    Google Scholar 

  12. For a related transformation in the time-invariant continuous-time case, see [74] which uses a loop-shifting method.

    Google Scholar 

  13. This follows from Theorem 2.5.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Başar, T., Bernhard, P. (1991). The Discrete-Time Minimax Design Problem With Perfect State Measurements. In: H-Optimal Control and Related. Systems & Control: Foundations & Applications. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4899-3561-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-3561-8_3

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4899-3563-2

  • Online ISBN: 978-1-4899-3561-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics