The viability Kernel algorithm for computing value functions of infinite horizon optimal control problems

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

This article is free to access.

Abstract

We characterize in this paper the epigraph of the value function of a discounted infinite horizon optimal control problem as the viability kernel of an auxiliary differential inclusion. Then the viability kernel algorithm applied to this problem provides the value function of the discretized optimal control problem as the supremum of a nondecreasing sequence of functions iteratively defined. We also use the fact that an upper Painlevé-Kuratowski limit of closed viability domains is a viability domain to prove the convergence of the discrete value functions. © 1996 Academic Press, Inc.

Cite

CITATION STYLE

APA

Aubin, J. P., & Frankowska, H. (1996). The viability Kernel algorithm for computing value functions of infinite horizon optimal control problems. Journal of Mathematical Analysis and Applications, 201(2), 555–576. https://doi.org/10.1006/jmaa.1996.0273

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