메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 133-139

Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED CONSTRAINT OPTIMIZATION; MULTIAGENT DOMAINS; NETWORK STRUCTURE;

EID: 29344437834     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (144)

References (13)
  • 1
    • 27344432831 scopus 로고    scopus 로고
    • Solving transition independent decentralized Markov decision processes
    • Becker, R.; Zilberstcin, S.; Lesser, V.; and Goldman, C. 2004. Solving transition independent decentralized Markov decision processes. JAIR 22:423-455.
    • (2004) JAIR , vol.22 , pp. 423-455
    • Becker, R.1    Zilberstcin, S.2    Lesser, V.3    Goldman, C.4
  • 2
    • 0010221983 scopus 로고    scopus 로고
    • The complexity of decentralized control of MDPs
    • Bernstein, D. S.; Zilberstein, S.; and Immerman, N. 2000. The complexity of decentralized control of MDPs. In UAI.
    • (2000) UAI
    • Bernstein, D.S.1    Zilberstein, S.2    Immerman, N.3
  • 4
    • 4544299571 scopus 로고    scopus 로고
    • Graphical models in local, asymmetric multi-agent markov decision processes
    • Dolgov, D., and Durfee, E. 2004. Graphical models in local, asymmetric multi-agent markov decision processes. In AAMAS.
    • (2004) AAMAS
    • Dolgov, D.1    Durfee, E.2
  • 5
    • 27344449757 scopus 로고    scopus 로고
    • Decentralized control of cooperative systems: Categorization and complexity analysis
    • Goldman, C., and Zilberstrin, S. 2004. Decentralized control of cooperative systems: Categorization and complexity analysis. JAIR 22:143-174.
    • (2004) JAIR , vol.22 , pp. 143-174
    • Goldman, C.1    Zilberstrin, S.2
  • 6
    • 1142281638 scopus 로고    scopus 로고
    • Context specific multiagent coordination and planning with factored MDPs
    • Guestrin, C.; Venkataraman, S.; and Koller, D. 2002. Context specific multiagent coordination and planning with factored MDPs. In AAAI.
    • (2002) AAAI
    • Guestrin, C.1    Venkataraman, S.2    Koller, D.3
  • 7
    • 32144461572 scopus 로고    scopus 로고
    • Dynamic programming for partially observable stochastic games
    • Hansen, E.; Bernstein, D.; and Zilberstcin, S. 2004. Dynamic Programming for Partially Observable Stochastic Games. In AAAI.
    • (2004) AAAI
    • Hansen, E.1    Bernstein, D.2    Zilberstcin, S.3
  • 9
    • 4544311969 scopus 로고    scopus 로고
    • An asynchronous complete method for distributed constraint optimization
    • Modi, P. J.; Shen, W.; Tambe, M.; and Yokoo, M. 2003. An asynchronous complete method for distributed constraint optimization. In AAMAS.
    • (2003) AAMAS
    • Modi, P.J.1    Shen, W.2    Tambe, M.3    Yokoo, M.4
  • 10
    • 4544325183 scopus 로고    scopus 로고
    • Approximate solutions for partially observable stochastic games with common payoffs
    • Montemerlo, R. E.; Gordon, G.; Schneider, J.; and Thrun, S. 2004. Approximate solutions for partially observable stochastic games with common payoffs. In AAMAS.
    • (2004) AAMAS
    • Montemerlo, R.E.1    Gordon, G.2    Schneider, J.3    Thrun, S.4
  • 11
    • 84880823326 scopus 로고    scopus 로고
    • Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings
    • Nair, R.; Pynadath, D.; Yokoo, M.; Tambe, M.; and Marsella, S. 2003. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In IJCAI.
    • (2003) IJCAI
    • Nair, R.1    Pynadath, D.2    Yokoo, M.3    Tambe, M.4    Marsella, S.5
  • 13
    • 0002818660 scopus 로고    scopus 로고
    • Distributed break-out algorithm for solving distributed constraint satisfaction problems
    • Yokoo, M., and Hirayama, K. 1996. Distributed break-out algorithm for solving distributed constraint satisfaction problems. In ICMAS.
    • (1996) ICMAS
    • Yokoo, M.1    Hirayama, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.