A scalable method for multiagent constraint optimization

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 266-271

  Petcu, Adrian ^a   Faltings, Boi ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BACKTRACKING ALGORITHM; CONSTRAINT NETWORKS; CONSTRAINT OPTIMIZATIONS; DISTRIBUTED CONSTRAINT OPTIMIZATIONS; OPTIMIZATION PROBLEMS; ORDERS OF MAGNITUDE; SATISFACTION PROBLEM; SUM-PRODUCT ALGORITHM;

ALGORITHMS; MULTI AGENT SYSTEMS; SCALABILITY; TOPOLOGY;

TREES (MATHEMATICS);

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

References (19)

1. S. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 25(1):2-23, 1985.
2. Valmir Barbosa. An Introduction to Distributed Algorithms. The MIT Press, 1996.
3. Roberto Bayardo and Daniel Miranker. On the space-time trade-off in solving constraint satisfaction problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, IJCAI- 95, Montreal, Canada, 1995.
4. Ramon Bejar, Cesar Fernandez, Magda Valls, Carmel Domshlak, Carla Gomes, Bart Selman, and Bhaskar Krishnamachari. Sensor networks and distributed CSP: Communication, computation and complexity. Artificial Intelligence, 161(1-2):117-147, 2005.
5. Rina Dechter and Yousri El Fattah. Topological parameters for time-space tradeoff. Artificial Intelligence, 125(1-2):93-118, 2001.
6. Rina Dechter. Constraint Processing. Morgan Kaufmann, 2003.
7. Eugene C. Freuder and Michael J. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, IJCAI-85, pages 1076-1078, Los Angeles, CA, 1985.
8. Eugene C. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32(14):755-761, 1985.
9. Y. Hamadi, C. Bessière, and J. Quinqueton. Backtracking in distributed constraint networks. In ECAI-98, pages 219-223, 1998.
10. Simon Kasif. On the parallel complexity of some constraint satisfaction problems. In Proceedings of the National Conference on Artificial Intelligence, AAAI-86, pages 349-353, Philadelphia, PA, 1986.
11. Frank R. Kschischang, Brendan Frey, and Hans Andrea Loeliger. Factor graphs and the sum-product algorithm. IEEE Transactions On Information Theory, 47(2):498-519, FEBRUARY 2001.
12. Rajiv T. Maheswaran, Milind Tambe, Emma Bowring, Jonathan P. Pearce, and Pradeep Varakantham. Taking DCOP to the realworld: Efficient complete solutions for distributed multi-event scheduling. In AAMAS-04, 2004.
13. Amnon Meisels and Roie Zivan. Asynchronous forward-checking on DisCSPs. In Proceedings of the Distributed Constraint Reasoning Workshop, IJCAI 2003, Acapulco, Mexico, 2003.
14. P. J. Modi, W. M. Shen, and M. Tambe. An asynchronous complete method for distributed constraint optimization. In Proc. AAMAS, 2003.
15. Adrian Petcu and Boi Faltings. A distributed, complete method for multi-agent constraint optimization. In CP 2004 - Fifth International Workshop on Distributed Constraint Reasoning (DCR2004) in Toronto, Canada, September 2004.
16. Thomas Schiex. A note on CSP graph parameters. Technical Report 03, INRA, 07 1999.
17. Marius-Calin Silaghi, Djamila Sam-Haroud, and Boi Faltings. Asynchronous search with aggregations. In AAAI/IAAI, pages 917-922, Austin, Texas, 2000.
18. Makoto Yokoo, Edmund H. Durfee, Toru Ishida, and Kazuhiro Kuwabara. Distributed constraint satisfaction for formalizing distributed problem solving. In International Conference on Distributed Computing Systems, pages 614-621, 1992.
19. Makoto Yokoo, Edmund H. Durfee, Toru Ishida, and Kazuhiro Kuwabara. The distributed constraint satisfaction problem - formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 10(5):673-685, 1998.