Comparing two approaches to dynamic, distributed Constraint Satisfaction

Proceedings of the International Conference on Autonomous Agents

Volumn , Issue , 2005, Pages 1173-1180

  Mailler, Roger ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

Cooperative Mediation; Distributed Constraint Satisfaction; Dynamic; Dynamic Partial Centralization

Indexed keywords

COOPERATIVE MEDIATION; DISTRIBUTED CONSTRAINT SATISFACTION; DYNAMIC; DYNAMIC PARTIAL CENTRALIZATION;

ALGORITHMS; PROBLEM SOLVING;

CONSTRAINT THEORY;

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

References (15)

1. J. Culberson and I. Gent. Frozen development in graph coloring. Theoretical Computer Science, 265(1-2):227-264, 2001.
2. R. Dechter and A. Dechter. Belief maintenance in dynamic constraint networks. In Proceedings of the 6th National Conference on Artificial Intelligence (AAAI-88), pages 37-42, 1988.
3. S. Fitzpatrick and L. Meertens. Distributed Sensor Networks: A Multiagent Perspective, chapter Distributed Coordination Through Anarchic Optimization, pages 257-294. Kluwer Academic Publishers, 2003.
4. E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1-3):21-70, 1992.
5. R. Mailler and V. Lesser. Solving Distributed Constraint Optimization Problems Using Cooperative Mediation. In Proceedings of Third International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2004), pages 438-445. IEEE Computer Society, 2004.
6. R. Mailler and V. Lesser. Using Cooperative Mediation to Solve Distributed Constraint Satisfaction Problems. In Proceedings of Third International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2004), volume 1, pages 446-453, New York, 2004. IEEE Computer Society.
7. R. Mailler, R. Vincent, V. Lesser, J. Shen, and T. Middlekoop. Soft real-time, cooperative negotiation for distributed resource allocation. In Procceedings of the 2001 AAAI Fall Symposium on Negotiation, 2001.
8. S. Minton, M. D. Johnston, A. B. Philips, and P. Laird. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1-3):161-205, 1992.
9. P. J. Modi, H. Jung, M. Tambe, W.-M. Shen, and S. Kulkarni. Dynamic distributed resource allocation: A distributed constraint satisfaction approach. In J.-J. Meyer and M. Tambe, editors, Pre-proceedings of the Eighth International Workshop on Agent Theories, Architectures, and Languages (ATAL-2001), pages 181-193, 2001.
10. P. Morris. The breakout method for escaping local minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 40-45, 1993.
11. T. Schiex and G. Verfaillie. Nogood recording for static and dynamic csp. In Proceedings pf the Fifth IEEE International Conference on Tools with Artificial Intelligence, 1993.
12. B. Selman, H. J. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In P. Rosenbloom and P. Szolovits, editors, Proceedings of the Tenth National Conference on Artificial Intelligence, pages 440-446, Menlo Park, California, 1992. AAAI Press.
13. G. Verfaillie and T. Schiex. Solution reuse in dynamic constraint satisfaction problems. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), pages 307-312, 1994.
14. M. Yokoo. Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming (CP-95), Lecture Notes in Computer Science 976, pages 88-102. Springer-Verlag, 1995.
15. M. Yokoo and K. Hirayama. Distributed breakout algorithm for solving distributed constraint satisfaction problems. In International Conference on Multi-Agent Systems (ICMAS), 1996.