메뉴 건너뛰기




Volumn , Issue , 2011, Pages 114-121

Scaling up multiagent planning: A best-response approach

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SPACES; CONGESTION GAMES; EMPIRICAL EVALUATIONS; EMPIRICAL EXPERIMENTS; IMPROVEMENT METHODS; MULTI-AGENT PLANNING; NASH EQUILIBRIUM; PLANNING ALGORITHMS; SCALING-UP; SELF-INTERESTED AGENTS; SINGLE-AGENT;

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

References (20)
  • 2
    • 84880818689 scopus 로고    scopus 로고
    • Simultaneous adversarial multi-robot learning
    • Bowling, M., and Veloso, M. 2003. Simultaneous adversarial multi-robot learning. In Procs IJCAI 2003, 699-704.
    • (2003) Procs IJCAI 2003 , pp. 699-704
    • Bowling, M.1    Veloso, M.2
  • 3
    • 58849140143 scopus 로고    scopus 로고
    • From One to Many: Planning for Loosely Coupled Multi-Agent Systems
    • AAAI Press
    • Brafman, R. I., and Domshlak, C. 2008. From One to Many: Planning for Loosely Coupled Multi-Agent Systems. In Procs ICAPS 2008. 28-35. AAAI Press.
    • (2008) Procs ICAPS 2008 , pp. 28-35
    • Brafman, R.I.1    Domshlak, C.2
  • 6
    • 38149008114 scopus 로고    scopus 로고
    • An efficient algorithm for multiagent plan coordination
    • ACM
    • Cox, J. S., and Durfee, E. H. 2005. An efficient algorithm for multiagent plan coordination. In Procs AAMAS 2005, 828-835. ACM.
    • (2005) Procs AAMAS 2005 , pp. 828-835
    • Cox, J.S.1    Durfee, E.H.2
  • 7
    • 33747191063 scopus 로고    scopus 로고
    • A distributed framework for solving the multiagent plan coordination problem
    • ACM
    • Cox, J. S.; Durfee, E. H.; and Bartold, T. 2005. A distributed framework for solving the multiagent plan coordination problem. In Procs AAMAS 2005, 821-827. ACM.
    • (2005) Procs AAMAS 2005 , pp. 821-827
    • Cox, J.S.1    Durfee, E.H.2    Bartold, T.3
  • 8
    • 38949194971 scopus 로고    scopus 로고
    • Multi-agent Coordination and Cooperation through Classical Planning
    • IEEE Computer Society
    • Dimopoulos, Y., and Moraitis, P. 2006. Multi-agent Coordination and Cooperation through Classical Planning. In Procs IAT 2006, 398-402. IEEE Computer Society.
    • (2006) Procs IAT 2006 , pp. 398-402
    • Dimopoulos, Y.1    Moraitis, P.2
  • 9
    • 0026225005 scopus 로고
    • Partial global planning: A coordination framework for distributed hypothesis formation
    • Durfee, E., and Lesser, V. 1991. Partial global planning: A coordination framework for distributed hypothesis formation. IEEE Transactions on Systems, Man, and Cybernetics SMC-21(5): 1167-1183.
    • (1991) IEEE Transactions on Systems, Man, and Cybernetics , vol.SMC-21 , Issue.5 , pp. 1167-1183
    • Durfee, E.1    Lesser, V.2
  • 10
    • 26644437162 scopus 로고
    • Increasing coherence in a distributed problem-solving network
    • Durfee, E. H.; Lesser, V. R.; and Corkill, D. D. 1985. Increasing coherence in a distributed problem-solving network. In Procs IJCAI 1985, 1025-1030.
    • (1985) Procs IJCAI 1985 , pp. 1025-1030
    • Durfee, E.H.1    Lesser, V.R.2    Corkill, D.D.3
  • 11
    • 0002816429 scopus 로고    scopus 로고
    • Distributed Problem Solving and Planning
    • Weiß, G., ed.
    • Durfee, E. H. 1999. Distributed Problem Solving and Planning. In Weiß, G., ed., Multiagent Systems, 121-164.
    • (1999) Multiagent Systems , pp. 121-164
    • Durfee, E.H.1
  • 12
    • 33749074604 scopus 로고
    • Multi-agent planning as search for a consensus that maximizes social welfare
    • Castelfranchi, C., and Werner, E., eds., Artificial Social Systems, Springer-Verlag
    • Ephrati, E., and Rosenschein, J. S. 1994. Multi-agent planning as search for a consensus that maximizes social welfare. In Castelfranchi, C., and Werner, E., eds., Artificial Social Systems, number 830 in Lecture Notes in Artificial Intelligence, 207-226. Springer-Verlag.
    • (1994) Lecture Notes in Artificial Intelligence , Issue.830 , pp. 207-226
    • Ephrati, E.1    Rosenschein, J.S.2
  • 13
    • 0030263767 scopus 로고    scopus 로고
    • Collaborative plans for complex group action
    • DOI 10.1016/0004-3702(95)00103-4
    • Grosz, B. J., and Kraus, S. 1996. Collaborative plans for complex group action. Artificial Intelligence 86(2): 269-357. (Pubitemid 126365534)
    • (1996) Artificial Intelligence , vol.86 , Issue.2 , pp. 269-357
    • Grosz, B.J.1    Kraus, S.2
  • 14
    • 77958566136 scopus 로고    scopus 로고
    • Additive and reversed relaxed reachability heuristics revisited
    • ICAPS-08
    • Haslum, P. 2008. Additive and reversed relaxed reachability heuristics revisited. IPC 2008 Competition Booklet, ICAPS-08.
    • (2008) IPC 2008 Competition Booklet
    • Haslum, P.1
  • 15
    • 38049181143 scopus 로고    scopus 로고
    • Extending Classical Planning to the Multi-agent Case: A Game-Theoretic Approach
    • Procs ECSQARU'07, Springer-Verlag
    • Larbi, R. B.; Konieczny, S.; and Marquis, P. 2007. Extending Classical Planning to the Multi-agent Case: A Game-Theoretic Approach. In Procs ECSQARU'07, volume 4724 of Lecture Notes in Artificial Intelligence, 731-742. Springer-Verlag.
    • (2007) Lecture Notes in Artificial Intelligence , vol.4724 , pp. 731-742
    • Larbi, R.B.1    Konieczny, S.2    Marquis, P.3
  • 16
    • 0030147102 scopus 로고    scopus 로고
    • Potential games
    • DOI 10.1006/game.1996.0044
    • Monderer, D., and Shapley, L. S. 1996. Potential Games. Games and Economic Behaviour 14(1): 124-143. (Pubitemid 126164246)
    • (1996) Games and Economic Behavior , vol.14 , Issue.1 , pp. 124-143
    • Monderer, D.1    Shapley, L.S.2
  • 17
    • 84899430659 scopus 로고    scopus 로고
    • A general, fully distributed multi-agent planning algorithm
    • IFAAMAS
    • Nissim, R.; Brafman, R. I.; and Domshlak, C. 2010. A general, fully distributed multi-agent planning algorithm. In Procs AAMAS 2010, 1323-1330. IFAAMAS.
    • (2010) Procs AAMAS 2010 , pp. 1323-1330
    • Nissim, R.1    Brafman, R.I.2    Domshlak, C.3
  • 18
    • 77956050972 scopus 로고    scopus 로고
    • The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks
    • Richter, S., and Westphal, M. 2010. The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks. Journal of Artificial Intelligence Research 39: 127-177.
    • (2010) Journal of Artificial Intelligence Research , vol.39 , pp. 127-177
    • Richter, S.1    Westphal, M.2
  • 19
    • 34250442766 scopus 로고
    • A class of games possessing pure-strategy Nash equilibria
    • Rosenthal, R. W. 1973. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2: 65-67.
    • (1973) International Journal of Game Theory , vol.2 , pp. 65-67
    • Rosenthal, R.W.1


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