Conclusions
The obtained results constitute an identification method of analysis of optimal decisions under uncertainty. Within this approach we have constructed a recursive procedure that has a number of fairly useful properties. First of all, it is sequential. Thus it is possible to use each observation for improving the estimates and for adaptive control. In this way we can construct fairly good estimates and a strategy with a small number of observations. In particular, the improvement of the strategy begins with a number of observations n=2. Moreover, it makes it possible to construct an optimal true stationary strategy after finitely many steps of adaptive control. Finally, the above methods make it possible to solve problems of fairly large dimension.
Similar content being viewed by others
Literature Cited
H. Mine and S. Osaki, Markovian Decision Processes, American Elsevier (1970).
V. G. Sragovich, Theory of Adaptive Systems [in Russian], Nauka, Moscow (1976).
V. V. Baranov, Recursive Methods of Optimal Decisions in Stochastic Systems [in Russian], Vyshcha S Shkola, Khar'kov (1981).
I. I. Martin, Bayesian Decision Problems and Markov Chains, Wiley, New York (1967).
Additional information
Translated from Kibernetika, No. 6, pp. 88–94, November–December, 1981.
Rights and permissions
About this article
Cite this article
Baranov, V.V. Recursive algorithms of adaptive control in stochastic systems. Cybern Syst Anal 17, 815–824 (1981). https://doi.org/10.1007/BF01069233
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069233