Asynchronous partial overlay: A new algorithm for solving distributed constraint satisfaction problems

Journal of Artificial Intelligence Research

Volumn 25, Issue , 2006, Pages 529-576

  Mailler, Roger ^a   Lesser, Victor R ^b  

^a SRI INTERNATIONAL   (United States)

^b The Manning College of Information and Computer Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SUPPORTED COOPERATIVE WORK; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; MULTI AGENT SYSTEMS; PROBLEM SOLVING;

ASYNCHRONOUS PARTIAL OVERLAY (APO); CENTRALIZED SUBPROBLEMS OVERLAP; CONSTRAINT SATISFACTION; DISTRIBUTED CONSTRAINT SATISFACTION (DCSP);

ARTIFICIAL INTELLIGENCE;

EID: 33744462868     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1786     Document Type: Article

References (31)

1. Bejar, R., Krishnamachari, B., Gomes, C., & Selman, B. (2001). Distributed constraint satisfaction in a wireless sensor tracking system. In Workshop on Distributed Constraint Reasoning, International Joint Conference on Artificial Intelligence, Seattle, Washington.
2. Cammarata, S., McArthur, D., & Steeb, R. (1983). Strategies of cooperation in distributed problem solving. In Proceedings of the 8th International Joint Conference on Artificial Intelligence (IJCAI-83), Vol. 2, pp. 767-770.
3. Cha, B., & Iwana, K. (1996). Adding new clauses for faster local search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI), pp. 332-337.
4. Cheeseman, P., Kanefsky, B., & Taylor, W. (1991). Where the really hard problems are. In Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI-91), pp. 331-337.
5. Conry, S. E., Kuwabara, K., Lesser, V. R., & Meyer, R. A. (1991). Multistage negotiation for distributed constraint satisfaction. IEEE Transactions on Systems, Man, and Cybernetics, 21(6).
6. Cormen, T. H., Leiserson, C. E., & Rivest, R. L. (1999). Introduction to Algorithms. McGraw-Hill.
7. Culberson, J., & Gent, I. (2001). Frozen development in graph coloring. Theoretical Computer Science, 265(1-2), 227-264.
8. Fernandez, C., Bejar, R., Krishnamachari, B., Gomes, C., & Selman, B. (2003). Distributed Sensor Networks: A Multiagent Perspective, chap. Communication and Computation in Distributed CSP Algorithms, pp. 299-317. Kluwer Academic Publishers.
9. Ford, L. R., & Fulkerson, D. (1962). Flows in Networks. Princeton University Press.
10. Freuder, E. C., & Wallace, R. J. (1992). Partial constraint satisfaction. Artificial Intelligence, 58(1-3), 21-70.
11. Frost, D., & Dechter, R. (1994). Dead-end driven learning. In Proceedings of the Twelfth Natioanl Conference on Artificial Intelligence, pp. 294-300.
12. Ginsberg, M. L. (1993). Dynamic backtracking. Journal of Artificial Intelligence Research, 1, 25-46.
13. Hayden, S., Carrick, C., & Yang, Q. (1999). Architectural design patterns for multi-agent coordination. In Proceedings of the International Conference on Agent Systems, Seattle, WA.
14. Hirayama, K., & Yokoo, M. (2000). The effect of nogood learning in distributed constraint satisfaction. In The 20th International Conference on Distributed Computing Systems (ICDCS), pp. 169-177.
15. Krishnamachari, B., Bejar, R., & Wicker, S. (2002). Distributed problem solving and the boundaries of self-configuration in multi-hop wireless networks. In Hawaii International Conference on System Sciences (HICSS-35).
16. Krishnamachari, B. (2002). Phase Transitions, Structure, and Compleixty in Wireless Networks. Ph.D. thesis, Cornell University, Ithaca, NY.
17. Mammen, D. L., & Lesser, V. R. (1998). Problem Structure and Subproblem Sharing in Multi-Agent Systems. Third International Conference on Multi-Agent Systems, 174-181.
18. Merriam-Webster (Ed.). (1995). The Merriam-Webster Dictionary (Home and Office edition). Springfield, IL.
19. Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992). Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 55(1-3), 161-205.
20. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., & Troyansky, L. (1999). Determining computational complexity from characteristic 'phase transitions'. Nature, 400, 133-137.
21. Rao, V. N., & Kumar, V. (1993). On the efficiency of parallel backtracking. IEEE Transactions on Parallel and Distributed Systems, 4(4), 427-437.
22. Sycara, K., Roth, S., Sadeh, N., & Fox, M. (1991). Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21(6), 1446-1461.
23. Sycara, K. (1988). Resolving goal conflicts via negotiation. In Proceedings of the Seventh National Conference on Artificial Intelligence, pp. 245-250.
24. Wellman, M., & Walsh, W. (1999). Distributed quiescence detection in multiagent negotiation. In In AAAI-99 Workshop on Negotiation: Settling Conflicts and Identifying Opportunities.
25. Werkman, K. J. (1990). Knowledge-based model of negotiation using shared perspectives. In Proceedings of the 10th International Workshop on Distributed Artificial intelligence, Bandera, TX.
26. Yokoo, M. (1994). Weak-commitment search for solving constraint satisfaction problems. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94); Vol. 1, pp. 313-318, Seattle, WA, USA. AAAI Press, 1994.
27. Yokoo, M. (1995). 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, pp. 88-102. Springer-Verlag.
28. Yokoo, M., Durfee, E. H., Ishida, T., & Kuwabara, K. (1992). Distributed constraint satisfaction for formalizing distributed problem solving. In International Conference on Distributed Computing Systems, pp. 614-621.
29. Yokoo, M., & Hirayama, K. (1996). Distributed breakout algorithm for solving distributed constraint satisfaction problems.. In International Conference on Multi-Agent Systems (ICMAS).
30. Yokoo, M., & Hirayama, K. (2000). Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems, 5(2), 198-212.
31. Yokoo, M., Suzuki, K., & Hirayama, K. (2002). Secure distributed constraint satisfaction: Reaching agreement without revealing private information. In Proceeding of the Eighth International Conference on Principles and Practice of Constraint Programming (CP).