Skip to main content

Dynamic programming

  • Chapter
  • First Online:
Mathematical Control Theory

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

  • 2196 Accesses

Abstract

   This chapter starts from a derivation of the dynamic programming equations called Bellman equations. They are used to solve the linear regulator problem on a finite time interval. A fundamental role is played here by the Riccati-type matrix differential equations. The stabilization problem is reduced to an analysis of an algebraic Riccati equation.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 79.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Author information

Authors and Affiliations

Authors

Bibliographical notes

Bibliographical notes

Dynamic programming ideas are presented in the monograph by R. Bellman [7].

The results of the linear regulator problem are classic. Theorem 9.5 is due to W.M. Wonham [101]. In the proof of Lemma 9.3(i) we follow J. Zabczyk [106].

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Zabczyk, J. (2020). Dynamic programming. In: Mathematical Control Theory. Systems & Control: Foundations & Applications. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-44778-6_9

Download citation

Publish with us

Policies and ethics