Abstract
For Markov chains controlled by a team of agents there is no generally applicable method for obtaining the optimal control policy if the delay in information sharing between the agents is more than one-step. The authors consider such a problem for a Markov chain whose transition probability matrix consists of blocks, with the coupling between the blocks being on the order of ε, where ε is a small parameter. It is shown that if each block is controlled by only one agent, then it is possible to obtain policies arbitrarily close to the optimal control policy by making use of the fact that the coupling between the blocks is weak. The authors present a complete set of results for the finite-horizon case and discuss possible extensions to the infinite-horizon case.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 168-173 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE Conference on Decision and Control |
| Volume | 1 |
| State | Published - 1989 |
| Event | Proceedings of the 28th IEEE Conference on Decision and Control. Part 1 (of 3) - Tampa, FL, USA Duration: Dec 13 1989 → Dec 15 1989 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Modeling and Simulation
- Control and Optimization