Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1758-1759.
Abstract
In many real-world multiagent applications such as distributed sensor nets, a network of agents is formed based on each agent’s limited interactions with a small number of neighbors. While distributed POMDPs capture the realworld uncertainty in multiagent domains, they fail to exploit such locality of interaction. Distributed constraint optimization (DCOP) captures the locality of interaction but fails to capture planning under uncertainty. This paper present a new model synthesized from distributed POMDPs and DCOPs, called Networked Distributed POMDPs (ND-POMDPs). Exploiting network structure enables us to present a distributed policy generation algorithm that performs local search.
@inproceedings{ijcai2005p347,
title = {Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs},
author = {Nair, Ranjit and Varakantham, Pradeep and Tambe, Milind and Yokoo, Makoto},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1758--1759},
year = {2005},
url = {https://ijcai.org/proceedings/2005/347},
}
TY - CPAPER TI - Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs AU - Nair, Ranjit AU - Varakantham, Pradeep AU - Tambe, Milind AU - Yokoo, Makoto T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1758 EP - 1759 UR - https://ijcai.org/proceedings/2005/347 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
