An approach to over-constrained distributed constraint satisfaction problems: Distributed hierarchical constraint satisfaction

Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000

Volumn , Issue , 2000, Pages 135-142

  Hirayama, K ^a   Yokoo, M ^b  

^a KOBE UNIVERSITY OF MERCANTILE MARINE   (Japan)

^b Nippon Telegraph and Telephone Corporation   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; MULTI AGENT SYSTEMS; OPTIMIZATION;

3-COLORING PROBLEM; CONSISTENT VARIABLES; CONSTRAINT SATISFACTION; DISTRIBUTED CONSTRAINT SATISFACTION; DISTRIBUTED CONSTRAINT SATISFACTION PROBLEM; OPTIMAL SOLUTIONS; OVER-CONSTRAINED; REAL-LIFE PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84962118508     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMAS.2000.858445     Document Type: Conference Paper

References (16)

1. K. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Transaction on Computer Systems, 3(1):63-75, 1985.
2. S. E. Conry, K. Kuwabara, V. R. Lesser, and R. A. Meyer. Multistage negotiation for distributed constraint satisfaction. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1462-1477, 1991.
3. E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1-3):21-70, 1992.
4. K. Hirayama and M. Yokoo. Distributed partial constraint satisfaction problem. In G. Smolka, editor, Principles and Practice of Constraint Programming - CP97, volume 1330 of Lecture Notes in Computer Science, pages 222-236. Springer-Verlag, 1997.
5. M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1437-1445, 1991.
6. V. R. Lesser and D. D. Corkill. The distributed vehicle monitoring testbed: A tool for investigating distributed problem solving networks. AI Magazine, 4(3):15-33, 1983.
7. 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.
8. P. Morris. The breakout method for escaping from local minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pages 40-45, 1993.
9. K. P. Sycara, S. Roth, N. Sadeh, and M. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man and Cybernetics, 21(6):1446-1461, 1991.
10. M. Yokoo. Constraint relaxation in distributed constraint satisfaction problem. In Proceedings of the 5th International Conference on Tools with Artificial Intelligence, pages 56-63, 1993.
11. M. Yokoo. Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In Principles and Practice of Constraint Programming -CP95, volume 976 of Lecture Notes in Computer Science, pages 88-102. Springer-Verlag, 1995.
12. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. Distributed constraint satisfaction for formalizing distributed problem solving. In Proceedings of the 12th IEEE International Conference on Distributed Computing Systems, pages 614-621, 1992.
13. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. The distributed constraint satisfaction problem: formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 10(5):673-685, 1998.
14. M. Yokoo and K. Hirayama. Distributed breakout algorithm for solving distributed constraint satisfaction problems. In Proceedings of the Second International Conference on Multi-Agent Systems, pages 401-408, 1996.
15. M. Yokoo and K. Hirayama. Distributed constraint satisfaction algorithm for complex local problems. In Proceedings of the Third International Conference on Multi-Agent Systems, pages 372-379, 1998.
16. M. Yokoo and K. Hirayama. Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-agent Systems, 3(2):189-211, 2000.