A formalization of autonomous dynamic reconfiguration in distributed constraint satisfaction

Fundamenta Informaticae

Volumn 43, Issue 1-4, 2000, Pages 129-151

  Hannebauer, Markus ^a  

^a FRAUNHOFER FIRST   (Germany)

Author keywords

Agent melting; Agent splitting; Autonomous dynamic reconfiguration; Distributed constraint satisfaction; Multi agent systems; Partitioning

Indexed keywords

EID: 0041703904     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-2000-43123407     Document Type: Article

References (43)

1. S. T. Barnard and H. D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6:101-107, 1994.
2. E. R. Barnes. An algorithm for partitioning the nodes of a graph. SIAM Journal on Algebraic and Discrete Methods, 3(4):541-550, 1982.
3. P. Berlandier and B. Neveu. Problem partition and solvers coordination in distributed constraint satisfaction. In Proceedings of the Workshop on Parallel Processing in Artificial Intelligence (PPAI-95), Montréal, Canada, 1995.
4. R. B. Boppana. Eigenvalues and graph bisection: An average-case analysis. In Proceedings of the twenty eighth Annual Symposium on Foundations of Computer Science, pages 280-285, Los Angeles, USA, 1987.
5. T. N. Bui. Graph Bisection Algorithms. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 1986.
6. K. Decker and V. Lesser. A one-shot dynamic coordination algorithm for distributed sensor networks. In Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI-93), pages 210-216, 1993.
7. K. Decker, K. P. Sycara, and M. Williamson. Cloning for intelligent adaptive information agents. In C. Zhang and D. Lukose, editors, Multi-Agent Systems: Methodologies and Applications, volume 1286 of LNAI, pages 63-75. Springer, 1997.
8. E. H. Durfee. Distributed problem solving and planning. In G. Weiss, editor, Multiagent Systems - A Modern Approach to Distributed Artificial Intelligence, pages 121-163. MIT Press, 1999.
9. S. Franklin and A. Graesser. Is it an Agent, or just a Program: A Taxonomy for Autonomous Agents. In Proceedings of the Third International Workshop on Agent Theories, Architectures, and Languages (ATAL-96), pages 193-206, Budapest, Hungary, 1996.
10. M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1(3):237-267, 1976.
11. I. P. Gent, E. MacIntyre, P. Prosser, and T. Walsh. The constrainedness of search. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 246-252. AAAI Press, 1996.
12. M Hannebauer. Multi-phase consensus communication in collaborative problem solving. In Communication-based Systems (CBS-2000), pages 131-146. Kluwer, 2000.
13. M Hannebauer. Transforming object-oriented domain models into declarative CLP expressions. In Proceedings of the 14th Workshop on Logic Programming (WLP-99), Würzburg, Germany, 2000.
14. M. Hannebauer and U. Geske. Coordinating distributed CLP-solvers in medical appointment scheduling. In Proceedings of the Twelfth International Conference on Applications of Prolog (INAP-99), pages 117-125, Tokyo, Japan, 1999.
15. M. Hannebauer and R. Kühnel. Dynamic reconfiguration in collaborative problem solving. In H.-D. Burkhard, L. Czaja, H.-S. Nguyen, and P. Starke, editors, Proceedings of the Eighth Workshop on Concurrency, Specification and Programming (CSandP-99), pages 71-82, Warsaw, Poland, 1999.
16. B. Hayes. Can't get no satisfaction. American Scientist, 85(2):108-112, 1997.
17. B. Hendrickson and K. Devine. Dynamic load balancing in computational mechanics. Comp. Meth. Applied Mechanics & Engineering (to appear), 1999.
18. B. Hendrickson and R. Leland. An empirical study of static load balancing algorithms. In Proceedings of the Scalable High Performance Computing Conference, pages 682-685. IEEE Press, 1994.
19. B. Hendrickson and R. Leland. The chaco user's guide version 2.0. Technical Report SAND95-2344, Sandia National Laboratories, Albuquerque, USA, 1995.
20. T. Hogg, B. A. Huberman, and C. P. Williams. Phase transitions and the search problem. Artificial Intelligence, 81:1-15, 1996.
21. T. Ishida, L. Gasser, and M. Yokoo. Organization self-design of distributed production systems. IEEE Transactions on Knowledge and Data Engineering, DKE4(2):123-134, 1992.
22. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. Technical Report 95-035, Department of Computer Science, University of Minnesota, Minneapolis, USA, 1995.
23. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49(2):291-307, 1970.
24. Q. Y. Luo, P. G. Hendry, and J. T. Buchanan. Heuristic search for distributed constraint satisfaction problems. Research Report KEG-6-92, Department of Computer Science, University of Strathclyde, Glasgow G1 1XH, UK, 1992.
25. Q. Y. Luo, P. G. Hendry, and J. T. Buchanan. A hybrid algorithm for distributed constraint satisfaction problems. Research Report RR-92-62, Department of Computer Science, University of Strathclyde, Glasgow G1 1XH, UK, 1992.
26. Q. Y. Luo, P. G. Hendry, and J. T. Buchanan. A new algorithm for dynamic constraint satisfaction problems. Research Report RR-92-63, Department of Computer Science, University of Strathclyde, Glasgow G1 1XH, UK, 1992.
27. Q. Y. Luo, P. G. Hendry, and J. T. Buchanan. Comparison of different approaches for solving distributed constraint satisfaction problems. Research Report RR-93-74, Department of Computer Science, University of Strathclyde, Glasgow G1 1XH, UK, 1993.
28. A. K. Mackworth. Constraint satisfaction. In S. C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 285-293. Wiley-Interscience Publication, second edition, 1992.
29. D. L. Mammen and V. R. Lesser. Problem structure and subproblem sharing in multi-agent systems. In Proceedings of the Third International Conference on Multi-Agent Systems (ICMAS-98), Paris, France, 1998.
30. F. Maturana, W. Shen, and D. H. Norrie. Metamorph: An adaptive agent-based architecture for intelligent manufacturing. International Journal of Production Research, 1998.
31. F. P. Maturana and D. H. Norrie. Multi-agent mediator architecture for distributed manufacturing. Journal of Intelligent Manufacturing, 7:257-270, 1996.
32. H. Müller, T. Hilbrich, and R. Kühnel. An assistant agent. Fundamenta Informaticae, 39(3):327-336, 1999.
33. M. V. N. Prasad, K. Decker, A. Garvey, and V. Lesser. Exploring organizational designs with TAEMS: A case study of distributed data processing. In Proceedings of the Second International Conference on Multi-Agent Systems (ICMAS-96), pages 283-290, 1996.
34. F. Rossi, C. Petrie, and V. Dhar. On the Equivalence of Constraint Satisfaction Problems. In Proceedings of the Ninth European Conference on Artificial Intelligence (ECAI-90), pages 550-556, 1990.
35. T. Sandholm, K. Larson, M. Andersson, O. Shehory, and F. Thomé. Coalition structure generation with worst case guarantees. Artificial Intelligence, 111(1-2):209-238, 1999.
36. O. Shehory, K. P. Sycara, P. Chalasani, and S. Jha. Increasing resource utilization and task performance by agent cloning. In Proceedings of the Fifth International Workshop on Agent Theories, Architectures and Languages (ATAL-98), pages 305-318, Paris, France, 1998.
37. W. Shen and D. H. Norrie. A hybrid agent-oriented infrastructure for modeling manufacturing enterprises. In Proceedings of the Knowledge Acquisition Workshop (KAW-98), Banff, Canada, 1998.
38. G. Solotorevsky, E. Gudes, and A. Meisels. Modeling and solving distributed constraint satisfaction problems (DCSPs). In Proceedings of the Conference on Constraint-Processing (CP-96), 1996.
39. K. P. Sycara, S. F. Roth, N. Sadeh, and M. S. Fox. Distributed constrained heuristic search. IEEE Transactions on Systems, Man, and Cybernetics, 21(6):1446-1461, 1991.
40. C. Walshaw, M. Cross, and M. Everett. Mesh partitioning and load-balancing for distributed memory parallel systems. In Proceedings of Parallel and Distributed Computing for Computational Mechanics, Lochinver, Scotland, UK, 1998.
41. 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), 1998.
42. M. Yokoo and K. Hirayama. Distributed constraint satisfaction algorithm for complex local problems. In Proceedings of the Third International Conference on Multi-Agent Systems (ICMAS-98), pages 372-379, Paris, France, 1998.
43. M. Yokoo and T. Ishida. Search algorithms for agents. In G. Weiss, editor, Multiagent Systems - A Modern Approach to Distributed Artificial Intelligence, pages 165-199. MIT Press, 1999.