Introducing communication in Dis-POMDPs with locality of interaction
| Autor: | Pradeep Varakantham, Makoto Tasaki, Yuichi Yabu, Milind Tambe, Yuki Iwanari, Makoto Yokoo, Janusz Marecki |
|---|---|
| Rok vydání: | 2010 |
| Předmět: |
Mathematical optimization
Theoretical computer science Computer Networks and Communications Computer science Distributed computing Multi-agent system Locality Approximation algorithm Markov process Time horizon Interval (mathematics) symbols.namesake Exponential growth Distributed algorithm Artificial Intelligence Bellman equation symbols Point (geometry) Markov decision process Software |
| Zdroj: | IAT |
| ISSN: | 1570-1263 |
| DOI: | 10.3233/wia-2010-0193 |
| Popis: | The Networked Distributed POMDPs (ND-POMDPs) can model multiagent systems in uncertain domains and have begun to scale-up the number of agents. However, prior work in ND-POMDPs has failed to address communication. Without communication, the size of a local policy at each agent within the ND-POMDPs grows exponentially in the time horizon. To overcome this problem, we extend existing algorithms so that agents periodically communicate their observation and action histories with each other. After communication, agents can start from new synchronized belief state. Thus, we can avoid the exponential growth in the size of local policies at agents. Furthermore, we introduce an idea that is similar to the Point-based Value Iteration algorithm to approximate the value function with a fixed number of representative points. Our experimental results show that we can obtain much longer policies than existing algorithms as long as the interval between communications is small. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|