Incremental DCOP search algorithms for solving dynamic DCOPs

10th International Conference on Autonomous Agents and Multiagent Systems 2011, AAMAS 2011

Volumn 2, Issue , 2011, Pages 1003-1004

  Yeoh, William ^a   Varakantham, Pradeep ^b   Sun, Xiaoxun ^c   Koenig, Sven ^c  

^a University of Massachusetts Amherst   (United States)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^c Computer Science Department University of Southern California ^*  (United States)

Author keywords

ADOPT; BnB ADOPT; DCOP; Dynamic DCOP

Indexed keywords

AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS;

ADOPT; BNB-ADOPT; DCOP; DISTRIBUTED CONSTRAINT OPTIMIZATIONS; LOWER AND UPPER BOUNDS; MODEL DYNAMICS; MULTI-AGENT COORDINATIONS; SEARCH ALGORITHMS;

ALGORITHMS;

EID: 84899454339     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. Y. Hamadi, C. Bessière, and J. Quinqueton. Distributed intelligent backtracking. In Proceedings of ECAI, pages 219-223, 1998.
2. P. Modi, W.-M. Shen, M. Tambe, and M. Yokoo. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1-2):149-180, 2005.
3. W. Yeoh, A. Feiner, and S. Koenig. BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm. Journal of Artificial Intelligence Research, 38:85-133, 2010.
4. W. Yeoh, P. Varakantham, and S. Koenig. Caching schemes for DCOP search algorithms. In Proceedings of AAMAS, pages 609-616, 2009.