메뉴 건너뛰기




Volumn , Issue , 2011, Pages 2027-2032

Scaling up optimal heuristic search in Dec-POMDPs via incremental expansion

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; HEURISTIC FUNCTIONS; HEURISTIC SEARCH; HEURISTIC SEARCH METHODS; OPTIMAL SOLUTIONS; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; PLANNING UNDER UNCERTAINTY; STATE OF THE ART;

EID: 84868299292     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-338     Document Type: Conference Paper
Times cited : (42)

References (13)
  • 1
    • 84881082946 scopus 로고    scopus 로고
    • Agent influence as a predictor of difficulty for decentralized problem-solving
    • M. Allen and S. Zilberstein. Agent influence as a predictor of difficulty for decentralized problem-solving. In AAAI, 2007.
    • (2007) AAAI
    • Allen, M.1    Zilberstein, S.2
  • 2
    • 77958561050 scopus 로고    scopus 로고
    • Incremental policy generation for finite-horizon DEC-POMDPs
    • C. Amato, J. Dibangoye, and S. Zilberstein. Incremental policy generation for finite-horizon DEC-POMDPs. In ICAPS, 2009.
    • (2009) ICAPS
    • Amato, C.1    Dibangoye, J.2    Zilberstein, S.3
  • 3
    • 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, 2004.
    • (2004) AAMAS
    • Emery-Montemerlo, R.1    Gordon, G.2    Schneider, J.3    Thrun, S.4
  • 4
    • 84899456155 scopus 로고    scopus 로고
    • Pointbased backup for decentralized POMDPs: Complexity and new algorithms
    • A. Kumar and S. Zilberstein. Pointbased backup for decentralized POMDPs: Complexity and new algorithms. In AAMAS, 2010.
    • (2010) AAMAS
    • Kumar, A.1    Zilberstein, S.2
  • 5
    • 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
  • 6
    • 84899811776 scopus 로고    scopus 로고
    • Lossless clustering of histories in decentralized POMDPs
    • F. A. Oliehoek, S. Whiteson, and M. T. J. Spaan. Lossless clustering of histories in decentralized POMDPs. In AAMAS, 2009.
    • (2009) AAMAS
    • Oliehoek, F.A.1    Whiteson, S.2    Spaan, M.T.J.3
  • 8
    • 84881044687 scopus 로고    scopus 로고
    • The complexity of multiagent systems: The price of silence
    • Z. Rabinovich, C. V. Goldman, and J. S. Rosenschein. The complexity of multiagent systems: the price of silence. In AAMAS, 2003.
    • (2003) AAMAS
    • Rabinovich, Z.1    Goldman, C.V.2    Rosenschein, J.S.3
  • 9
    • 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
  • 10
    • 51649127552 scopus 로고    scopus 로고
    • Formal models and algorithms for decentralized decision making under uncertainty
    • S. Seuken and S. Zilberstein. Formal models and algorithms for decentralized decision making under uncertainty. JAAMAS, 17(2):190-250, 2008.
    • (2008) JAAMAS , vol.17 , Issue.2 , pp. 190-250
    • Seuken, S.1    Zilberstein, S.2
  • 12
    • 80053226937 scopus 로고    scopus 로고
    • MAA*: A heuristic search algorithm for solving decentralized POMDPs
    • D. Szer, F. Charpillet, and S. Zilberstein. MAA*: A heuristic search algorithm for solving decentralized POMDPs. In UAI, 2005.
    • (2005) UAI
    • Szer, D.1    Charpillet, F.2    Zilberstein, S.3
  • 13
    • 78650942474 scopus 로고    scopus 로고
    • Online planning for multi-agent systems with bounded communication
    • F. Wu, S. Zilberstein, and X. Chen. Online planning for multi-agent systems with bounded communication. Artificial Intelligence, 175(2):487-511, 2011.
    • (2011) Artificial Intelligence , vol.175 , Issue.2 , pp. 487-511
    • Wu, F.1    Zilberstein, S.2    Chen, X.3


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