Networked distributed POMDPs

A synergy of distributed constraint optimization and POMDPs

Ranjit Nair, Pradeep Varakantham, Milind Tambe, Makoto Yokoo

Research output: Contribution to journalConference article

10 Citations (Scopus)

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 real-world 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.

Original languageEnglish
Pages (from-to)1758-1760
Number of pages3
JournalIJCAI International Joint Conference on Artificial Intelligence
Publication statusPublished - Dec 1 2005
Event19th International Joint Conference on Artificial Intelligence, IJCAI 2005 - Edinburgh, United Kingdom
Duration: Jul 30 2005Aug 5 2005

Fingerprint

sensor
Planning
Sensors
planning
policy
Uncertainty

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Networked distributed POMDPs : A synergy of distributed constraint optimization and POMDPs. / Nair, Ranjit; Varakantham, Pradeep; Tambe, Milind; Yokoo, Makoto.

In: IJCAI International Joint Conference on Artificial Intelligence, 01.12.2005, p. 1758-1760.

Research output: Contribution to journalConference article

@article{027a2267f4c2452b947b2f3601612b44,
title = "Networked distributed POMDPs: A synergy of distributed constraint optimization and POMDPs",
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 real-world 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.",
author = "Ranjit Nair and Pradeep Varakantham and Milind Tambe and Makoto Yokoo",
year = "2005",
month = "12",
day = "1",
language = "English",
pages = "1758--1760",
journal = "IJCAI International Joint Conference on Artificial Intelligence",
issn = "1045-0823",

}

TY - JOUR

T1 - Networked distributed POMDPs

T2 - A synergy of distributed constraint optimization and POMDPs

AU - Nair, Ranjit

AU - Varakantham, Pradeep

AU - Tambe, Milind

AU - Yokoo, Makoto

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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 real-world 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.

AB - 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 real-world 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.

UR - http://www.scopus.com/inward/record.url?scp=33644800871&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33644800871&partnerID=8YFLogxK

M3 - Conference article

SP - 1758

EP - 1760

JO - IJCAI International Joint Conference on Artificial Intelligence

JF - IJCAI International Joint Conference on Artificial Intelligence

SN - 1045-0823

ER -