skip to main content
10.1145/1329125.1329395acmotherconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
poster

Subjective approximate solutions for decentralized POMDPs

Published:14 May 2007Publication History

ABSTRACT

A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DEC-POMDPs) provide a convenient, but intractable model for specifying planning problems in cooperative teams. Compared to the single-agent case, an additional challenge is posed by the lack of free communication between the teammates. We argue, that acting close to optimally in a team involves a tradeoff between opportunistically taking advantage of agent's local observations and being predictable for the teammates. We present a more opportunistic version of an existing approximate algorithm for DEC-POMDPs and investigate the tradeoff. Preliminary evaluation shows that in certain settings oportunistic modification provides significantly better performance.

References

  1. R. Becker, S. Zilberstein, V. Lesser, and C. V. Goldman. Solving transition independent decentralized Markov decision processes. JAIR, 22:423--455, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. S. Bernstein, E. A. Hansen, and S. Zilberstein. Bounded policy iteration for decentralized POMDPs. In IJCAI, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The complexity of decentralized control of Markov decision processes. Mathematics of Operations Research, 27(4):819--840, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In Proc. AAMAS, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Game theoretic control for robot teams. In Proc. ICRA, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  6. E. A. Hansen, D. S. Bernstein, and S. Zilberstein. Dynamic programming for partially observable stochastic games. In Proc. AAAI, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Koes, I. Nourbakhsh, and K. Sycara. Constraint optimization coordination architecture for search and rescue robotics. In Proc. ICRA, pages 3977--3982, May 2006.Google ScholarGoogle ScholarCross RefCross Ref
  8. V. Lesser, C. Ortiz, and M. Tambe, editors. Distributed Sensor Networks: A Multiagent Perspective, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Nair, M. Tambe, M. Yokoo, D. V. Pynadath, and S. Marsella. Taming decentralized POMDPs: towards efficient policy computation for multiagent settings. In Proc. IJCAI, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Roth, R. Simmons, and M. Veloso. Decentralized communication strategies for coordinated multi-agent policies. Multi-Robot Systems: From Swarms to Intelligent Automat, III, 2005.Google ScholarGoogle Scholar
  11. M. T. J. Spaan, G. J. Gordon, and N. A. Vlassis. Decentralized planning under uncertainty for teams of communicating agents. In Proc. AAMAS, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Szer, F. Charpillet, and S. Zilberstein. MAA*: a heuristic search algorithm for solving decentralized POMDPs. In Proc. UAI, 2005.Google ScholarGoogle Scholar

Index Terms

  1. Subjective approximate solutions for decentralized POMDPs

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
      May 2007
      1585 pages
      ISBN:9788190426275
      DOI:10.1145/1329125

      Copyright © 2007 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 14 May 2007

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      Overall Acceptance Rate1,155of5,036submissions,23%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader