Distributed constraint satisfaction algorithm for complex local problems

Proceedings - International Conference on Multi Agent Systems, ICMAS 1998

Volumn , Issue , 1998, Pages 372-379

  Yokoo, Makoto ^a   Hirayama, Katsutoshi ^b  

^a NTT Communication Science Laboratories   (Japan)

^b KOBE UNIVERSITY OF MERCANTILE MARINE   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; DISTRIBUTED COMPUTER SYSTEMS; MULTI AGENT SYSTEMS; PROBLEM SOLVING;

APPLICATION PROBLEMS; DISTRIBUTED CONSTRAINT SATISFACTION; DISTRIBUTED CONSTRAINT SATISFACTION PROBLEM; EXPERIMENTAL EVALUATION; LOCAL CONSTRAINTS; LOCAL VARIABLES; SEARCH ALGORITHMS; SIMPLE MODIFICATIONS;

SOFTWARE AGENTS;

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

References (15)

1. A. Armstrong and E. Durfee. Dynamic prioritization of complex agents in distributed constraint satisfaction problems. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pages 620-625, 1997.
2. K. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Trans, on Computer Systems, 3(1):63-75, 1985.
3. P. Cheeseman, B. Kanefsky, and W. Taylor. Where the really hard problems are. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 331-337, 1991.
4. Z. Collin, R. Dechter, and S. Katz. On the feasibility of distributed constraint satisfaction. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, pages 318-324, 1991.
5. 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.
6. K. Hirayama and J. Toyoda. Forming coalitions for breaking deadlocks. In Proceedings of the First international Conference on Multiagent Systems, pages 155-162, 1995.
7. M. N. Huhns and D. M. Bridgeland. Multiagent truth maintenance. IEEE Transactions on Systems, Man and Cybernetics, 21(6): 1437-1445, 1991.
8. A. K. Mackworth. Constraint satisfaction. In S. C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 285-293. Wiley-Interscience Publication, New York, 1992.
9. C. Miason and R. Johnson. DATMS: A framework for distributed assumption based reasoning. In L. Gasser and M. Huhns, editors, Distributed Artificial Intelligence vol.11, pages 293-318. Morgan Kaufmann, 1989.
10. 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.
11. 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.
12. M. Yokoo. Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In Proceedings of the First International Conference on Principles andPractice of Constraint Programming (Lecture Notes in Computer Science 976), pages 88-102. Springer-Verlag, 1995.
13. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. Distributed constraint satisfaction for formalizing distributed problem solving. In Proceedings of the Twelfth IEEE International Conference on Distributed Computing Systems, pages 614-621, 1992.
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. MIT Press, 1996.
15. Y. Zhang and A. Mackworth. Parallel and distributed algorithms for finite constraint satisfaction problems. In Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, pages 394-397, 1991.