Dynamic programming complexity and application

Research output: Contribution to journalConference articlepeer-review

Abstract

The authors consider the solution of dynamic programming in the presence of uncertainty. They discuss the Howard algorithm, complexity, the full multigrid Howard algorithm, the Pandore expert system for stochastic control, and the use of the formal calculus.

Original languageEnglish
Pages (from-to)1551-1558
Number of pages8
JournalProceedings of the IEEE Conference on Decision and Control
Publication statusPublished - 1 Dec 1988
Externally publishedYes
EventProceedings of the 27th IEEE Conference on Decision and Control - Austin, TX, USA
Duration: 7 Dec 19889 Dec 1988

Fingerprint

Dive into the research topics of 'Dynamic programming complexity and application'. Together they form a unique fingerprint.

Cite this