Dynamic programming approach for discrete-valued time discrete optimal control problems with dwell time constraints

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The article discusses a numerical approach to solve optimal control problems in discrete time that involve continuous and discrete controls. Special attention is drawn to the modeling and treatment of dwell time constraints. For the solution of the optimal control problem in discrete time, a dynamic programming approach is employed. A numerical example is included that illustrates the impact of dwell time constraints in mixed integer optimal control.

Cite

CITATION STYLE

APA

Burger, M., Gerdts, M., Göttlich, S., & Herty, M. (2016). Dynamic programming approach for discrete-valued time discrete optimal control problems with dwell time constraints. In IFIP Advances in Information and Communication Technology (Vol. 494, pp. 159–168). Springer New York LLC. https://doi.org/10.1007/978-3-319-55795-3_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free