Dynamic programming for deterministic discrete-time systems with uncertain gain

23Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

We generalise the optimisation technique of dynamic programming for discrete-time systems with an uncertain gain function. We assume that uncertainty about the gain function is described by an imprecise probability model, which generalises the well-known Bayesian, or precise, models. We compare various optimality criteria that can be associated with such a model, and which coincide in the precise case: maximality, robust optimality and maximinity. We show that (only) for the first two an optimal feedback can be constructed by solving a Bellman-like equation. © 2004 Published by Elsevier Inc.

Cite

CITATION STYLE

APA

De Cooman, G., & Troffaes, M. C. M. (2005). Dynamic programming for deterministic discrete-time systems with uncertain gain. In International Journal of Approximate Reasoning (Vol. 39, pp. 257–278). https://doi.org/10.1016/j.ijar.2004.10.004

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