Structural Results for Cooperative Decentralized Control Models
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 46-51.
Abstract
The intractability in cooperative, decentralized control models is mainly due to prohibitive memory requirements in both optimal policies and value functions. The complexity analysis has emerged as the standard method to estimating the memory needed for solving a given computational problem, but complexity results may be somewhat limited. This paper introduces a general methodology — structural analysis — for the design of optimality-preserving concise policies and value functions, which will eventually lead to the development of efficient theory and algorithms. For the first time, we show that memory requirements for policies and value functions may be asymmetric, resulting in cooperative, decentralized control models with exponential reductions in memory requirements.
@inproceedings{ijcai2015p14,
title = {Structural Results for Cooperative Decentralized Control Models},
author = {Dibangoye, Jilles Steeve and Buffet, Olivier and Simonin, Olivier},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {46--51},
year = {2015},
month = {7},
note = {Main Track},
url = {https://ijcai.org/proceedings/2015/14},
}
TY - CPAPER TI - Structural Results for Cooperative Decentralized Control Models AU - Dibangoye, Jilles Steeve AU - Buffet, Olivier AU - Simonin, Olivier T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 46 EP - 51 UR - https://ijcai.org/proceedings/2015/14 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
