메뉴 건너뛰기




Volumn , Issue , 2005, Pages 35-42

Conflicts in teamwork: Hybrids to the rescue

Author keywords

BDI; DCOP; Game theory; POMDP

Indexed keywords

COMPUTER SIMULATION; GAME THEORY; OPTIMIZATION;

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

References (34)
  • 1
    • 33644800166 scopus 로고    scopus 로고
    • Preprocessing techniques for accelerating the dcop algorithm adopt
    • S. Ali, S.Koenig, and M.Tambe. Preprocessing techniques for accelerating the dcop algorithm adopt. In AAMAS, 2005.
    • (2005) AAMAS
    • Ali, S.1    Koenig, S.2    Tambe, M.3
  • 2
    • 4544363248 scopus 로고    scopus 로고
    • The complexity of decentralized control of markov decision processes
    • D. Bernstein, S.Zilberstein, and N.Immerman. The complexity of decentralized control of markov decision processes. In UAI, 2000.
    • (2000) UAI
    • Bernstein, D.1    Zilberstein, S.2    Immerman, N.3
  • 3
    • 84959401147 scopus 로고    scopus 로고
    • Distributed multi-criteria coordination in multi-agent systems
    • E. Bowring, M. Tambe, and M. Yokoo. Distributed multi-criteria coordination in multi-agent systems. In Workshop on DALT, 2005.
    • (2005) Workshop on DALT
    • Bowring, E.1    Tambe, M.2    Yokoo, M.3
  • 4
    • 0030263767 scopus 로고    scopus 로고
    • Collaborative plans for complex group action
    • B. Grosz and S.Kraus. Collaborative plans for complex group action. AIJ, 86:269-357, 1996.
    • (1996) AIJ , vol.86 , pp. 269-357
    • Grosz, B.1    Kraus, S.2
  • 5
    • 0242584074 scopus 로고    scopus 로고
    • Monitoring teams by overhearing: A multi-agent plan recognition approach
    • G. Kaminka, D.V.Pynadath, and M.Tambe. Monitoring teams by overhearing: A multi-agent plan recognition approach. JAIR, 17, 2002.
    • (2002) JAIR , vol.17
    • Kaminka, G.1    Pynadath, D.V.2    Tambe, M.3
  • 6
    • 14344272936 scopus 로고    scopus 로고
    • Robust multi-agent teams via socially-attentive monitoring
    • G. Kaminka and M.Tambe. Robust multi-agent teams via socially-attentive monitoring. JAIR, 12:105-147, 2000.
    • (2000) JAIR , vol.12 , pp. 105-147
    • Kaminka, G.1    Tambe, M.2
  • 9
    • 33645986070 scopus 로고    scopus 로고
    • Valuation of possible states: A unifying quantitative framework for evaluating privacy in collaboration
    • R. Maheswaran, J. Pearce, P. Varakantham, E. Bowring, and M. Tambe. Valuation of possible states: A unifying quantitative framework for evaluating privacy in collaboration. In AAMAS, 2005.
    • (2005) AAMAS
    • Maheswaran, R.1    Pearce, J.2    Varakantham, P.3    Bowring, E.4    Tambe, M.5
  • 10
    • 84958139209 scopus 로고    scopus 로고
    • Distributed algorithms for DCOP: A graphical-game-based approach
    • R. Maheswaran, J. P. Pearce, and M. Tambe. Distributed algorithms for DCOP: A graphical-game-based approach. In PDCS, 2004.
    • (2004) PDCS
    • Maheswaran, R.1    Pearce, J.P.2    Tambe, M.3
  • 11
    • 33644801848 scopus 로고    scopus 로고
    • Coalition formation in proportionality fair divisible auctions
    • R. Maheswaran and T.Basar. Coalition formation in proportionality fair divisible auctions. In AAMAS, 2003.
    • (2003) AAMAS
    • Maheswaran, R.1    Basar, T.2
  • 12
    • 33746092413 scopus 로고    scopus 로고
    • Comparing two approaches to dynamic, distributed constraint satisfaction
    • R. Mailler. Comparing two approaches to dynamic, distributed constraint satisfaction. In AAMAS, 2005.
    • (2005) AAMAS
    • Mailler, R.1
  • 13
    • 44049112032 scopus 로고
    • Minimizing conflicts: A heuristic method for constraint-satisfaction and scheduling problems
    • S. Minton, M.D.Johnston, A.B.Philips, and P.Laird. Minimizing conflicts: A heuristic method for constraint-satisfaction and scheduling problems. Artificial Intelligence, 58:161-205, 1992.
    • (1992) Artificial Intelligence , vol.58 , pp. 161-205
    • Minton, S.1    Johnston, M.D.2    Philips, A.B.3    Laird, P.4
  • 14
    • 0010278653 scopus 로고    scopus 로고
    • A dynamic distributed constraint satisfaction approach to resource allocation
    • P. Modi, H.Jung, M.Tambe, W.Shen, and S.Kulkarni. A dynamic distributed constraint satisfaction approach to resource allocation. In CP, 2001.
    • (2001) CP
    • Modi, P.1    Jung, H.2    Tambe, M.3    Shen, W.4    Kulkarni, S.5
  • 15
    • 10044277219 scopus 로고    scopus 로고
    • Adopt: Asynchronous distributed constraint optimizationwith quality guarantees
    • P. Modi, W. Shen, M. Tambe, and M. Yokoo. Adopt: Asynchronous distributed constraint optimization with quality guarantees. AIJ, 161:149-180, 2005.
    • (2005) AIJ , vol.161 , pp. 149-180
    • Modi, P.1    Shen, W.2    Tambe, M.3    Yokoo, M.4
  • 16
    • 27344450974 scopus 로고    scopus 로고
    • Hybrid bdi-pomdp framework for multiagent teaming
    • R. Nair and M.Tambe. Hybrid bdi-pomdp framework for multiagent teaming. JAIR, 23:367-413, 2005.
    • (2005) JAIR , vol.23 , pp. 367-413
    • Nair, R.1    Tambe, M.2
  • 17
    • 84880823326 scopus 로고    scopus 로고
    • Taming decentralized pomdps: Towards efficient policy computation for multiagent settings
    • R. Nair, M.Tambe, M.Yokoo, D.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.4    Marsella, S.5
  • 18
    • 33644800871 scopus 로고    scopus 로고
    • Networked distributed pomdps: A synergy of distributed constraint optimization and pomdps
    • R. Nair, P.Varakantham, M.Yokoo, and M.Tambe. Networked distributed pomdps: A synergy of distributed constraint optimization and pomdps. In IJCAI, 2005.
    • (2005) IJCAI
    • Nair, R.1    Varakantham, P.2    Yokoo, M.3    Tambe, M.4
  • 19
    • 4544369221 scopus 로고    scopus 로고
    • Towards a formalization of teamwork with resource constraints
    • P. Paruchuri, M.Tambe, F.Ordonez, and S.Kraus. Towards a formalization of teamwork with resource constraints. In AAMAS, 2004.
    • (2004) AAMAS
    • Paruchuri, P.1    Tambe, M.2    Ordonez, F.3    Kraus, S.4
  • 21
    • 84943330144 scopus 로고    scopus 로고
    • How local is that optimum? k-optimality for dcop
    • J. Pearce, R.T.Maheswaran, and M.Tambe. How local is that optimum? k-optimality for dcop. In AAMAS, 2005.
    • (2005) AAMAS
    • Pearce, J.1    Maheswaran, R.T.2    Tambe, M.3
  • 22
    • 0346502058 scopus 로고    scopus 로고
    • Automated teamwork among heterogeneous software agents and humans
    • D. Pynadath and M.Tambe. Automated teamwork among heterogeneous software agents and humans. JAAMAS, 7:71-100, 2003.
    • (2003) JAAMAS , vol.7 , pp. 71-100
    • Pynadath, D.1    Tambe, M.2
  • 25
    • 2442641587 scopus 로고    scopus 로고
    • Towards adjustable autonomy for the real-world
    • P. Scerri, D. Pynadath, and M. Tambe. Towards adjustable autonomy for the real-world. JAIR, 17:171-228, 2002.
    • (2002) JAIR , vol.17 , pp. 171-228
    • Scerri, P.1    Pynadath, D.2    Tambe, M.3
  • 26
    • 33644807917 scopus 로고    scopus 로고
    • The defacto system: Training tool for incident commanders
    • N. Schurr, J. Marecki, P. Scerri, J. Lewis, and M. Tambe. The defacto system: Training tool for incident commanders. In IAAI, 2005.
    • (2005) IAAI
    • Schurr, N.1    Marecki, J.2    Scerri, P.3    Lewis, J.4    Tambe, M.5
  • 27
    • 0001936250 scopus 로고    scopus 로고
    • Towards flexible teamwork
    • M. Tambe. Towards flexible teamwork. JAIR, 7:83-124, 1997.
    • (1997) JAIR , vol.7 , pp. 83-124
    • Tambe, M.1
  • 29
    • 84880677312 scopus 로고    scopus 로고
    • Two fielded teams and two experts: A robocup response challenge from the trenches
    • M. Tambe, G.Kaminka, S.Marsella, I.Muslea, and T.Raines. Two fielded teams and two experts: A robocup response challenge from the trenches. In IJCAI, 1999.
    • (1999) IJCAI
    • Tambe, M.1    Kaminka, G.2    Marsella, S.3    Muslea, I.4    Raines, T.5
  • 31
    • 0034411115 scopus 로고    scopus 로고
    • Towards flexible teamwork in persistent teams
    • M. Tambe and W.Zhang. Towards flexible teamwork in persistent teams. JAAMAS, 3:159-183, 1998.
    • (1998) JAAMAS , vol.3 , pp. 159-183
    • Tambe, M.1    Zhang, W.2
  • 32
    • 33644814996 scopus 로고    scopus 로고
    • Exploiting belief bounds: Practical pomdps for personal assistant agents
    • P. Varakantham, R. Maheswaran, and M. Tambe. Exploiting belief bounds: Practical pomdps for personal assistant agents. In AAMAS, 2005.
    • (2005) AAMAS
    • Varakantham, P.1    Maheswaran, R.2    Tambe, M.3
  • 34
    • 0002818660 scopus 로고    scopus 로고
    • Distributed breakout algorithm for solving distributed constraint satisfaction problems
    • M. Yokoo and K.Hirayama. Distributed breakout algorithm for solving distributed constraint satisfaction problems. In ICMAS, 1996.
    • (1996) ICMAS
    • Yokoo, M.1    Hirayama, K.2


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