메뉴 건너뛰기




Volumn 19, Issue 2, 2009, Pages 89-123

ADOPT-ing: Unifying asynchronous distributed optimization with asynchronous backtracking

Author keywords

ADOPT; DCOPs; Distributed CSPs; Distributed problem solving; Semi cooperative agents

Indexed keywords


EID: 67650085811     PISSN: 13872532     EISSN: 15737454     Source Type: Journal    
DOI: 10.1007/s10458-008-9069-2     Document Type: Article
Times cited : (19)

References (58)
  • 1
    • 33644800166 scopus 로고    scopus 로고
    • Preprocessing techniques for accelerating the DCOP algorithm ADOPT
    • Ali, S., Koenig, S., & Tambe, M. (2005). Preprocessing techniques for accelerating the DCOP algorithm ADOPT. In AAMAS.
    • (2005) AAMAS
    • Ali, S.1    Koenig, S.2    Tambe, M.3
  • 2
    • 0031366535 scopus 로고    scopus 로고
    • Dynamic prioritization of complex agents in distributed constraint satisfaction problems
    • Armstrong, A., & Durfee, E. F. (1997). Dynamic prioritization of complex agents in distributed constraint satisfaction problems. In Proceedings of 15th IJCAI.
    • (1997) Proceedings of 15th IJCAI
    • Armstrong, A.1    Durfee, E.F.2
  • 3
    • 67650005489 scopus 로고    scopus 로고
    • A complete distributed constraint optimization method for non-traditional pseudotree arrangements
    • Atlas, J., & Decker, K. (2007). A complete distributed constraint optimization method for non-traditional pseudotree arrangements. In AAMAS.
    • (2007) AAMAS
    • Atlas, J.1    Decker, K.2
  • 4
    • 67650012560 scopus 로고    scopus 로고
    • Examining dcsp coordination tradeoffs
    • Benisch, M., & Sadeh, N. (2006). Examining dcsp coordination tradeoffs. In AAMAS.
    • (2006) AAMAS
    • Benisch, M.1    Sadeh, N.2
  • 5
    • 10044279570 scopus 로고    scopus 로고
    • Asynchronous backtracking without adding links: A new member in the abt family
    • Bessiere, C., Brito, I., Maestre, A., & Meseguer, P. (2005) Asynchronous backtracking without adding links: A new member in the abt family. Artificial Intelligence, 161, 7-24.
    • (2005) Artificial Intelligence , vol.161 , pp. 7-24
    • Bessiere, C.1    Brito, I.2    Maestre, A.3    Meseguer, P.4
  • 8
    • 0003369786 scopus 로고    scopus 로고
    • Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
    • Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., & Fargier, H. (1999). Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints, 4(3), 199-240.
    • (1999) Constraints , vol.4 , Issue.3 , pp. 199-240
    • Bistarelli, S.1    Montanari, U.2    Rossi, F.3    Schiex, T.4    Verfaillie, G.5    Fargier, H.6
  • 9
    • 67650061500 scopus 로고    scopus 로고
    • Chechetka, A., & Sycara, K. (2005). A decentralized variable ordering method for distributed constraint optimization. In AAMAS.
    • Chechetka, A., & Sycara, K. (2005). A decentralized variable ordering method for distributed constraint optimization. In AAMAS.
  • 10
    • 69949130101 scopus 로고    scopus 로고
    • No-commitment branch and bound search for distributed constraint optimization
    • Chechetka, A., & Sycara, K. (2006). No-commitment branch and bound search for distributed constraint optimization. In AAMAS.
    • (2006) AAMAS
    • Chechetka, A.1    Sycara, K.2
  • 11
  • 12
    • 67650058314 scopus 로고    scopus 로고
    • Backtrack dynamique valué.
    • Dago, P. (1997). Backtrack dynamique valué. In JFPLC (pp. 133-148).
    • (1997) JFPLC , pp. 133-148
    • Dago, P.1
  • 13
    • 0030413604 scopus 로고    scopus 로고
    • Nogood recording for valued constraint satisfaction problems
    • Dago, P., & Verfaillie, G. (1996). Nogood recording for valued constraint satisfaction problems. In ICTAI.
    • (1996) ICTAI
    • Dago, P.1    Verfaillie, G.2
  • 14
    • 0025228149 scopus 로고
    • Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
    • Dechter, R. (1990). Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. AI'90.
    • (1990) AI , vol.90
    • Dechter, R.1
  • 17
    • 33750712579 scopus 로고    scopus 로고
    • Multi-agent meeting scheduling with preferences: Efficiency, privacy loss, and solution quality
    • Franzin, M., Rossi, F., B.C., F., & Wallace, R. (2004). Multi-agent meeting scheduling with preferences: Efficiency, privacy loss, and solution quality. Computational Intelligence, 20(2).
    • (2004) Computational Intelligence , vol.20 , Issue.2
    • Franzin, M.1    Rossi, F.B.C.F.2    Wallace, R.3
  • 18
    • 52249083812 scopus 로고    scopus 로고
    • Asynchronous forward-bounding for distributed constraints optimization
    • Gershman, A., Meisels, A., & Zivan, R. (2006). Asynchronous forward-bounding for distributed constraints optimization. In ECAI.
    • (2006) ECAI
    • Gershman, A.1    Meisels, A.2    Zivan, R.3
  • 21
    • 36348946542 scopus 로고    scopus 로고
    • Experimental analysis of privacy loss in dcop algorithms
    • Oreenstadt, R., Pearce, J., Bowring, E., & Tambe, M. (2006). Experimental analysis of privacy loss in dcop algorithms. In AAMAS (pp. 1024-1027).
    • (2006) AAMAS , pp. 1024-1027
    • Oreenstadt, R.1    Pearce, J.2    Bowring, E.3    Tambe, M.4
  • 22
    • 0001545454 scopus 로고    scopus 로고
    • Backtracking in distributed constraint networks
    • Hamadi, Y., & Bessière, C. (1998). Backtracking in distributed constraint networks. In ECAI'98 (pp. 219-223).
    • (1998) ECAI'98 , pp. 219-223
    • Hamadi, Y.1    Bessière, C.2
  • 23
    • 84948973649 scopus 로고    scopus 로고
    • Distributed partial constraint satisfaction problem
    • Proceedings of the Conference on Constraint Processing CP-97
    • Hirayama, K., & Yokoo, M. (1997). Distributed partial constraint satisfaction problem. In Proceedings of the Conference on Constraint Processing (CP-97), LNCS 1330 (pp. 222-236).
    • (1997) LNCS , vol.1330 , pp. 222-236
    • Hirayama, K.1    Yokoo, M.2
  • 25
    • 67650005487 scopus 로고    scopus 로고
    • Node and arc consistency in weighted csp
    • Edmonton
    • Larrosa, J. (2002). Node and arc consistency in weighted csp. In AAAI-2002, Edmonton.
    • (2002) AAAI-2002
    • Larrosa, J.1
  • 26
    • 0000762544 scopus 로고
    • Exploiting problem structure for distributed constraint optimization
    • Liu, J., & Sycara, K. P. (1995). Exploiting problem structure for distributed constraint optimization. In ICMAS.
    • (1995) ICMAS
    • Liu, J.1    Sycara, K.P.2
  • 27
    • 4544376849 scopus 로고    scopus 로고
    • Taking DCOP to the real world: Efficient complete solutions for distributed event scheduling
    • Maheswaran, R., Tambe, M., Bowring, E., Pearce, J., & Varakantham, P. (2004). Taking DCOP to the real world: Efficient complete solutions for distributed event scheduling. In AAMAS.
    • (2004) AAMAS
    • Maheswaran, R.1    Tambe, M.2    Bowring, E.3    Pearce, J.4    Varakantham, P.5
  • 28
    • 36349022287 scopus 로고    scopus 로고
    • The planning of the oil derivatives transportation by pipelines as a distributed constraint optimization problem
    • India
    • Marcellino, F. M., Omar, N., & Moura, A. V. (2007). The planning of the oil derivatives transportation by pipelines as a distributed constraint optimization problem. In IJCAI-DCR Workshop, India.
    • (2007) IJCAI-DCR Workshop
    • Marcellino, F.M.1    Omar, N.2    Moura, A.V.3
  • 29
    • 33645975765 scopus 로고    scopus 로고
    • Bumping strategies for the multiagent agreement problem
    • Modi, P., & Veloso, M. (2005). Bumping strategies for the multiagent agreement problem. In AAMAS.
    • (2005) AAMAS
    • Modi, P.1    Veloso, M.2
  • 30
    • 10044277219 scopus 로고    scopus 로고
    • ADOPT: Asynchronous distributed constraint optimization with quality guarantees
    • Modi, P. J., Shen, W.-M., Tambe, M., & Yokoo, M. (2005). ADOPT: Asynchronous distributed constraint optimization with quality guarantees. AIJ, 161.
    • (2005) AIJ , pp. 161
    • Modi, P.J.1    Shen, W.-M.2    Tambe, M.3    Yokoo, M.4
  • 34
    • 84880707137 scopus 로고    scopus 로고
    • A scalable method for multiagent constraint optimization
    • Petcu, A., & Faltings, B. (2005). A scalable method for multiagent constraint optimization. In IJCAI.
    • (2005) IJCAI
    • Petcu, A.1    Faltings, B.2
  • 36
    • 36348967937 scopus 로고    scopus 로고
    • ODPOP: An algorithm for open/distributed constraint optimization
    • Petcu, A., & Faltings, B. (2006). ODPOP: an algorithm for open/distributed constraint optimization. In AAAI.
    • (2006) AAAI
    • Petcu, A.1    Faltings, B.2
  • 37
    • 67650038039 scopus 로고    scopus 로고
    • Multi-directional distributed search with aggregation
    • Ringwelski, G., & Hamadi, Y. (2005). Multi-directional distributed search with aggregation. In IJCAI-DCR.
    • (2005) IJCAI-DCR
    • Ringwelski, G.1    Hamadi, Y.2
  • 38
    • 0002582645 scopus 로고
    • Valued constraint satisfaction problems: Hard and easy problems
    • Schiex, T., Fargier, H., & Verfaillie, G. (1995). Valued constraint satisfaction problems: Hard and easy problems. In Procs. IJCAI'95 (pp. 631-637).
    • (1995) Procs. IJCAI'95 , pp. 631-637
    • Schiex, T.1    Fargier, H.2    Verfaillie, G.3
  • 40
    • 67650014914 scopus 로고    scopus 로고
    • Asynchronous PFC-MRDAC ±ADOPT- consistency-maintenance in ADOPT-
    • Silaghi, M.-C. (2003). Asynchronous PFC-MRDAC ±ADOPT- consistency-maintenance in ADOPT-. In IJCAI-DCR.
    • (2003) IJCAI-DCR
    • Silaghi, M.-C.1
  • 41
    • 78649687004 scopus 로고    scopus 로고
    • Howto: Asynchronous PFC-MRDAC-optimization in distributed constraint problems +/-ADOPT-
    • Halifax
    • Silaghi, M.-C (2003). Howto: Asynchronous PFC-MRDAC-optimization in distributed constraint problems +/-ADOPT-. In IAT. Halifax.
    • (2003) IAT
    • Silaghi, M.-C.1
  • 42
    • 38949105158 scopus 로고    scopus 로고
    • Framework for modeling reordering heuristics for asynchronous backtracking
    • Silaghi, M.-C. (2006). Framework for modeling reordering heuristics for asynchronous backtracking. In IAT.
    • (2006) IAT
    • Silaghi, M.-C.1
  • 43
    • 10044262291 scopus 로고    scopus 로고
    • Asynchronous aggregation and consistency in distributed constraint satisfaction
    • Silaghi, M.-C., & Faltings, B. (2004). Asynchronous aggregation and consistency in distributed constraint satisfaction. Artificial, Intelligence, 161(1-2), 25-53.
    • (2004) Artificial, Intelligence , vol.161 , Issue.1-2 , pp. 25-53
    • Silaghi, M.-C.1    Faltings, B.2
  • 44
    • 67650029524 scopus 로고    scopus 로고
    • Silaghi, M.-C., Landwehr, J., & Larrosa, J. B. (2004). 112 of Frontiers in Artificial Intelligence and Applications, chapter Asynchronous Branch & Bound and A* for DisWCSPs with, heuristic function based on consistency-maintenance. IOS Press.
    • Silaghi, M.-C., Landwehr, J., & Larrosa, J. B. (2004). Vol. 112 of Frontiers in Artificial Intelligence and Applications, chapter Asynchronous Branch & Bound and A* for DisWCSPs with, heuristic function based on consistency-maintenance. IOS Press.
  • 49
    • 36348958711 scopus 로고    scopus 로고
    • Nogood-based asynchronous distributed optimization
    • Silaghi, M.-C., & Yokoo, M. (2006). Nogood-based asynchronous distributed optimization. In AAMAS.
    • (2006) AAMAS
    • Silaghi, M.-C.1    Yokoo, M.2
  • 50
    • 0017544789 scopus 로고
    • Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
    • Stallman, R. M., & Sussman, G. J. (1977). Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, 9, 135-193.
    • (1977) Artificial Intelligence , vol.9 , pp. 135-193
    • Stallman, R.M.1    Sussman, G.J.2
  • 51
    • 67650005479 scopus 로고    scopus 로고
    • Constraint propagation for domain bounding in distributed task scheduling
    • Sultanik, E., Modi, P. J., & Regli, W (2006). Constraint propagation for domain bounding in distributed task scheduling. In CP.
    • (2006) CP
    • Sultanik, E.1    Modi, P.J.2    Regli, W.3
  • 52
    • 67650027234 scopus 로고    scopus 로고
    • Walsh, T. (2007). Traffic light scheduling: a challenging distributed constraint optimization problem. In DCR, India.
    • Walsh, T. (2007). Traffic light scheduling: a challenging distributed constraint optimization problem. In DCR, India.
  • 53
  • 54
    • 0027867092 scopus 로고
    • Constraint relaxation in distributed constraint satisfaction problem
    • Yokoo, M. (1993). Constraint relaxation in distributed constraint satisfaction problem. In ICDCS'93 (pp. 56-63).
    • (1993) ICDCS'93 , pp. 56-63
    • Yokoo, M.1
  • 55
    • 85043435920 scopus 로고
    • Distributed constraint satisfaction for formalizing distributed problem solving
    • Yokoo, M., Durfee, E. H., Ishida, T., & Kuwabara, K. (1992) Distributed constraint satisfaction for formalizing distributed problem solving. In ICDCS (pp. 614-621).
    • (1992) ICDCS , pp. 614-621
    • Yokoo, M.1    Durfee, E.H.2    Ishida, T.3    Kuwabara, K.4
  • 56
    • 0032155668 scopus 로고    scopus 로고
    • The distributed constraint satisfaction problem: Formalization and algorithms
    • Yokoo, M., Durfee, E. H., Ishida, T., & Kuwabara, K. (1998). The distributed constraint satisfaction problem: Formalization and algorithms. IEEE TKDE, 10(5), 673-685.
    • (1998) IEEE TKDE , vol.10 , Issue.5 , pp. 673-685
    • Yokoo, M.1    Durfee, E.H.2    Ishida, T.3    Kuwabara, K.4
  • 57
    • 85017332139 scopus 로고    scopus 로고
    • Distributed constraint satisfaction algorithm for complex local problems
    • Yokoo, M., & Hirayama, K. (1998). Distributed constraint satisfaction algorithm for complex local problems. In Proceedings of 3rd ICMAS'98 (pp. 372-379).
    • (1998) Proceedings of 3rd ICMAS'98 , pp. 372-379
    • Yokoo, M.1    Hirayama, K.2
  • 58
    • 38949184717 scopus 로고    scopus 로고
    • Dynamic ordering for asynchronous backtracking on discsps
    • Zivan, R., & Meisels, A. (2005). Dynamic ordering for asynchronous backtracking on discsps. In CP (pp. 161-172).
    • (2005) CP , pp. 161-172
    • Zivan, R.1    Meisels, A.2


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