No-commitment branch and bound search for distributed constraint optimization

Proceedings of the International Conference on Autonomous Agents

Volumn 2006, Issue , 2006, Pages 1427-1429

  Chechetka, Anton ^a   Sycara, Katia ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Cooperative distributed problem solving in agent systems

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COST EFFECTIVENESS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

COOPERATIVE DISTRIBUTED PROBLEM SOLVING IN AGENT SYSTEMS; EXPONENTIAL MEMORY; POLYNOMIAL MEMORY; POLYNOMIAL SPACE ALGORITHMS;

MULTI AGENT SYSTEMS;

EID: 34247252464     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160900     Document Type: Conference Paper

References (8)

1. S. Ali, S. Koenig, and M. Tambe. Preprocessing techniques for accelerating the DCOP algorithm ADOPT. In Proc. of AAMAS, 2005.
2. K. Hirayama and M. Yokoo. Distributed partial constraint satisfaction problem. In Principles and Practice of Constraint Programming, pages 222-236, 1997.
3. E. L. Lawler and D. E. Wood. Branch-and-bound methods: A survey. Operations Research, 14(4):699-719, 1966.
4. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1996.
5. R. Mailler and V. Lesser. Solving distributed constraint optimization problems using cooperative mediation. In Proc. of AAMAS, 2004.
6. A. Meisels, E. Kaplansky, I. Razgon, and R. Zivan. Comparing performance of distributed constraints processing algorithms. In Proc. of DCR Workshop, AAMAS, 2002.
7. P. J. Modi, W.-M. Shen, M. Tambe, and M. Yokoo. Adopt: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 16(1-2):149-180, 2005.
8. A. Petcu and B. Faltings. An efficient constraint optimization method for large multiagent systems. In Proc. of the LSMAS Workshop, AAMAS, 2005.