Skip to main content

Time-Optimization Problem

  • Chapter

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

Abstract

This chapter presents a detailed analysis of the so-called time-optimization problem. A switching control is shown to be optimal for this problem. The “Theorem on n-intervals” is proven for a class of linear stationary systems. Some examples illustrate the main results.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   139.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

Learn about institutional subscriptions

References

  • Feldbaum, A. (1953), ‘Optimal processes in systems of automatic control’, Avtom. Telemeh. 14(6), 712–728 (in Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vladimir G. Boltyanski .

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Boltyanski, V.G., Poznyak, A.S. (2012). Time-Optimization Problem. In: The Robust Maximum Principle. Systems & Control: Foundations & Applications. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-0-8176-8152-4_5

Download citation

Publish with us

Policies and ethics