BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm

Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

Volumn 1, Issue , 2008, Pages 582-589

  Yeoh, William ^a   Feiner, Ariel ^b   Koenig, Sven ^a  

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

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Agent cooperation; Distributed problem solving

Indexed keywords

ALGORITHMS; AUTONOMOUS AGENTS; MULTI AGENT SYSTEMS;

AGENT COOPERATION; ASYNCHRONOUS ALGORITHMS; BEST FIRST SEARCH; BRANCH AND BOUNDS; COMMUNICATION FRAMEWORK; DISTRIBUTED CONSTRAINT OPTIMIZATIONS; DISTRIBUTED PROBLEM SOLVING; SEARCH STRATEGIES;

PROBLEM SOLVING;

EID: 84899934858     PISSN: 15488403     EISSN: 15582914     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. S. Ali. S. Koenig, and M. Tambe. Preprocessing techniques for accelerating the DCOP algorithm ADOPT. In Proceedings of AAMAS, pages 1041-1048, 2005.
2. C. Bessiere, A. Maestre, and P. Messeguer. Distributed dynamic backtracking. In Proceedings of the Distributed Constraint Reasoning Workshop, pages 9-16, 2001.
3. A. Chechetka and K. Sycara. No-commitment branch and bound search for distributed constraint optimization. In Proceedings of AAMAS, pages 1427-1429, 2006.
4. A. Gershman, A. Meisels, and R. Zivan. Asynchronous forward-bounding for distributed constraints optimization. In Proceedings of ECAI, pages 103-107, 2006.
5. P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SSC 4 (2): 100-107, 1968.
6. K. Hirayama and M. Yokoo. Distributed partial constraint satisfaction problem. In Principles and Practice of Constraint Programming, pages 222-236, 1997.
7. R. Korf. Linear-space best-first search. Artificial Intelligence, 62(l):41-78, 1993.
8. R. Maheswaran, M. Tambe, E. Bowring, J. Pearce. and P. Varakantham. Taking DCOP to the real world: Efficient complete solutions for distributed event scheduling. In Proceedings of AAMAS, pages 310-317, 2004.
9. R. Mailler and V. Lesser. Solving distributed constraint optimization problems using cooperative mediation. In Proceedings of AAMAS, pages 438-445, 2004.
10. R. Marinescu and R. Dechter. AND/OR branch-and-bound for graphical models. In Proceedings of IJCAI, pages 224-229, 2005.
11. A. Meisels, E. Kaplansky, I. Razgon, and R. Zivan. Comparing performance of distributed constraints processing algorithms. In Proceedings of the Distributed Constraint Reasoning Workshop, pages 86-93, 2002.
12. P. Modi, W. Shen, M. Tambe, and M. Yokoo. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1-2):149-180, 2005.
13. A. Petcu and B. Faltings. A scalable method for multiagent constraint optimization. In Proceedings of IJCAI, pages 1413-1420, 2005.
14. N. Schurr, S. Okamoto, R. Maheswaran, P. Scerri, and M. Tambe. Evolution of a teamwork model. In R. Sun, editor, Cognition and Multi-Agent Interaction: From Cognitive Modeling to Social Simulation, pages 307-327. Cambridge University Press, 2005.
15. W. Yeoh, A. Feiner, and S. Koenig. BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm. In Proceedings of the Distributed Constraint Reasoning Workshop, 2007.
16. W. Zhang and R. Korf. Performance of linear-space search algorithms. Artificial Intelligence, 79(2):241-292, 1995.