메뉴 건너뛰기




Volumn 1, Issue , 2012, Pages 200-207

Heuristic search of multiagent influence space

Author keywords

Heuristic Search; Influence Based Abstraction; Multiagent Planning Under Uncertainty; TD POMDP

Indexed keywords

ABSTRACTING; AUTONOMOUS AGENTS; HEURISTIC ALGORITHMS; MATHEMATICAL TECHNIQUES; MODULAR ROBOTS;

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

References (25)
  • 1
    • 4544301377 scopus 로고    scopus 로고
    • Decentralized Markov decision processes with event-driven interactions
    • R. Becker, S. Zilberstein, and V. Lesser. Decentralized Markov decision processes with event-driven interactions. In AAMAS, pages 302-309, 2004.
    • (2004) AAMAS , pp. 302-309
    • Becker, R.1    Zilberstein, S.2    Lesser, V.3
  • 2
    • 27344432831 scopus 로고    scopus 로고
    • Solving transition independent decentralized Markov decision processes
    • R. Becker, S. Zilberstein, V. Lesser, and C. V. Goldman. Solving transition independent decentralized Markov decision processes. JAIR, 22:423-455, 2004.
    • (2004) JAIR , vol.22 , pp. 423-455
    • Becker, R.1    Zilberstein, S.2    Lesser, V.3    Goldman, C.V.4
  • 3
    • 0036874366 scopus 로고    scopus 로고
    • The complexity of decentralized control of Markov decision processes
    • D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The complexity of decentralized control of Markov decision processes. Math. of OR, 27(4):819-840, 2002.
    • (2002) Math. of OR , vol.27 , Issue.4 , pp. 819-840
    • Bernstein, D.S.1    Givan, R.2    Immerman, N.3    Zilberstein, S.4
  • 4
    • 0346942368 scopus 로고    scopus 로고
    • Decision-theoretic planning: Structural assumptions and computational leverage
    • C. Boutilier, T. Dean, and S. Hanks. Decision-theoretic planning: Structural assumptions and computational leverage. JAIR, 11:1-94, 1999.
    • (1999) JAIR , vol.11 , pp. 1-94
    • Boutilier, C.1    Dean, T.2    Hanks, S.3
  • 5
    • 4544325183 scopus 로고    scopus 로고
    • Approximate solutions for partially observable stochastic games with common payoffs
    • R. Emery-Montemerlo, G. Gordon, J. Schneider, and S. Thrun. Approximate solutions for partially observable stochastic games with common payoffs. In AAMAS, pages 136-143, 2004.
    • (2004) AAMAS , pp. 136-143
    • Emery-Montemerlo, R.1    Gordon, G.2    Schneider, J.3    Thrun, S.4
  • 6
    • 0001770240 scopus 로고    scopus 로고
    • Value-function approximations for partially observable Markov decision processes
    • M. Hauskrecht. Value-function approximations for partially observable Markov decision processes. JAIR, 13:33-94, 2000.
    • (2000) JAIR , vol.13 , pp. 33-94
    • Hauskrecht, M.1
  • 7
    • 0032073263 scopus 로고    scopus 로고
    • Planning and acting in partially observable stochastic domains
    • L. P. Kaelbling, M. L. Littman, and A. R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2):99-134, 1998.
    • (1998) Artificial Intelligence , vol.101 , Issue.1-2 , pp. 99-134
    • Kaelbling, L.P.1    Littman, M.L.2    Cassandra, A.R.3
  • 8
    • 84868288428 scopus 로고    scopus 로고
    • Scalable multiagent planning using probabilistic inference
    • A. Kumar, S. Zilberstein, and M. Toussaint. Scalable multiagent planning using probabilistic inference. In IJCAI, pages 2140-2146, 2011.
    • (2011) IJCAI , pp. 2140-2146
    • Kumar, A.1    Zilberstein, S.2    Toussaint, M.3
  • 9
    • 80053162775 scopus 로고    scopus 로고
    • Compact mathematical programs for DEC-MDPs with structured agent interactions
    • H. Mostafa and V. Lesser. Compact mathematical programs for DEC-MDPs with structured agent interactions. In UAI, pages 523-530, 2011.
    • (2011) UAI , pp. 523-530
    • Mostafa, H.1    Lesser, V.2
  • 10
    • 84880823326 scopus 로고    scopus 로고
    • Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings
    • R. Nair, M. Tambe, M. Yokoo, D. V. Pynadath, and S. Marsella. Taming decentralized POMDPs: Towards efficient policy computation for multiagent settings. In IJCAI, 2003.
    • (2003) IJCAI
    • Nair, R.1    Tambe, M.2    Yokoo, M.3    Pynadath, D.V.4    Marsella, S.5
  • 11
    • 29344437834 scopus 로고    scopus 로고
    • Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs
    • R. Nair, P. Varakantham, M. Tambe, and M. Yokoo. Networked distributed POMDPs: A synthesis of distributed constraint optimization and POMDPs. In AAAI, pages 133-139, 2005.
    • (2005) AAAI , pp. 133-139
    • Nair, R.1    Varakantham, P.2    Tambe, M.3    Yokoo, M.4
  • 13
    • 57349184659 scopus 로고    scopus 로고
    • The cross-entropy method for policy search in decentralized POMDPs
    • F. A. Oliehoek, J. F. Kooi, and N. Vlassis. The cross-entropy method for policy search in decentralized POMDPs. Informatica, 32:341-357, 2008.
    • (2008) Informatica , vol.32 , pp. 341-357
    • Oliehoek, F.A.1    Kooi, J.F.2    Vlassis, N.3
  • 14
    • 52249098423 scopus 로고    scopus 로고
    • Optimal and approximate Q-value functions for decentralized POMDPs
    • F. A. Oliehoek, M. T. J. Spaan, and N. Vlassis. Optimal and approximate Q-value functions for decentralized POMDPs. JAIR, 32:289-353, 2008.
    • (2008) JAIR , vol.32 , pp. 289-353
    • Oliehoek, F.A.1    Spaan, M.T.J.2    Vlassis, N.3
  • 15
    • 84899909133 scopus 로고    scopus 로고
    • Exploiting locality of interaction in factored dec-POMDPs
    • F. A. Oliehoek, M. T. J. Spaan, S. Whiteson, and N. Vlassis. Exploiting locality of interaction in factored Dec-POMDPs. In AAMAS, pages 517-524, 2008.
    • (2008) AAMAS , pp. 517-524
    • Oliehoek, F.A.1    Spaan, M.T.J.2    Whiteson, S.3    Vlassis, N.4
  • 16
    • 84860644195 scopus 로고    scopus 로고
    • Efficient planning for factored infinite-horizon DEC-POMDPs
    • J. Pajarinen and J. Peltonen. Efficient planning for factored infinite-horizon DEC-POMDPs. In IJCAI, pages 325-331, 2011.
    • (2011) IJCAI , pp. 325-331
    • Pajarinen, J.1    Peltonen, J.2
  • 18
    • 84880856384 scopus 로고    scopus 로고
    • Memory-bounded dynamic programming for DEC-POMDPs
    • S. Seuken and S. Zilberstein. Memory-bounded dynamic programming for DEC-POMDPs. In IJCAI, 2007.
    • (2007) IJCAI
    • Seuken, S.1    Zilberstein, S.2
  • 19
    • 84868299292 scopus 로고    scopus 로고
    • Scaling up optimal heuristic search in dec-POMDPs via incremental expansion
    • M. T. J. Spaan, F. A. Oliehoek, and C. Amato. Scaling up optimal heuristic search in Dec-POMDPs via incremental expansion. In IJCAI, pages 2027-2032, 2011.
    • (2011) IJCAI , pp. 2027-2032
    • Spaan, M.T.J.1    Oliehoek, F.A.2    Amato, C.3
  • 20
    • 80053226937 scopus 로고    scopus 로고
    • *: A heuristic search algorithm for solving decentralized POMDPs
    • *: A heuristic search algorithm for solving decentralized POMDPs. In UAI, pages 576-583, 2005.
    • (2005) UAI , pp. 576-583
    • Szer, D.1    Charpillet, F.2    Zilberstein, S.3
  • 21
    • 78650622568 scopus 로고    scopus 로고
    • Letting loose a SPIDER on a network of POMDPs: Generating quality guaranteed policies
    • P. Varakantham, J. Marecki, Y. Yabu, M. Tambe, and M. Yokoo. Letting loose a SPIDER on a network of POMDPs: Generating quality guaranteed policies. In AAMAS, 2007.
    • (2007) AAMAS
    • Varakantham, P.1    Marecki, J.2    Yabu, Y.3    Tambe, M.4    Yokoo, M.5
  • 23
    • 84899454751 scopus 로고    scopus 로고
    • Distributed model shaping for scaling to decentralized POMDPs with hundreds of agents
    • P. Velagapudi, P. Varakantham, P. Scerri, and K. Sycara. Distributed model shaping for scaling to decentralized POMDPs with hundreds of agents. In AAMAS, 2011.
    • (2011) AAMAS
    • Velagapudi, P.1    Varakantham, P.2    Scerri, P.3    Sycara, K.4
  • 25
    • 78650593547 scopus 로고    scopus 로고
    • Influence-based policy abstraction for weakly-coupled dec-POMDPs
    • S. J. Witwicki and E. H. Durfee. Influence-based policy abstraction for weakly-coupled Dec-POMDPs. In ICAPS, 2010.
    • (2010) ICAPS
    • Witwicki, S.J.1    Durfee, E.H.2


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