z-logo
open-access-imgOpen Access
ON NONDETERMINISTIC DYNAMIC PROGRAMMING
Author(s) -
Hiroshi Hisano
Publication year - 2008
Publication title -
bulletin of informatics and cybernetics
Language(s) - English
Resource type - Journals
eISSN - 2435-743X
pISSN - 0286-522X
DOI - 10.5109/18991
Subject(s) - nondeterministic algorithm , computer science , dynamic programming , mathematics , algorithm
R.Bellman left a lot of research problems in his work “Dynamic Programming” (1957). Having received ideas from Bellman, S. Iwamoto has extracted, out of his problems, a problem on nondeterministic dynamic programming (NDP). Instead of stochastic dynamic programming which has been well studied, Iwamoto has opened a gate to NDP. This report presents specific optimal solutions for NDPs on continuous state and decision spaces.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom