By Topic

Decentralized optimal control of Markov chains with a common past information set

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Aicardi, M. ; University of Genoa, Genova, Italy ; Davoli, F. ; Minciardi, R.

Decentralized dynamic (closed-loop) optimal control strategies are sought for a class of finite state Markov decision processes, characterized by the sharing of a common past after k steps of delay. The control is considered over a finite time horizon, and it is shown that a nonclassical dynamic programming procedure can be applied, based on the existence of a sufficient statistic of constant dimension. Finally, the infinite horizon case is briefly discussed, in view of an extention of existing results on the minimization of average expected cost for the centralized and decentralized control of Markov chains.

Published in:

Automatic Control, IEEE Transactions on  (Volume:32 ,  Issue: 11 )