Skip to main content
Log in

Problem decomposition in distributed problem-solving systems

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Distributed Problem Solving (DPS) is defined as the cooperative solution of problems by a decentralized and loosely coupled collection of problem solvers (agents), each of them knowing how to execute only some of the necessary tasks. This approach considers the problem-solving process as occurring in three phases: problem decomposition, subproblem solution, and answer synthesis. In the problem decomposition phase, one has to determine which tasks will be executed by each agent and when. One of the key research questions in the problem decomposition process is how to decompose a problem in order to minimize the cost of resources needed for its solution. In this article, we construct mathematical programming models in order to describe the decomposition process under the above criterion, study its complexity, and present exact and heuristic algorithms for its solution. Our work was motivated by the operation of an actual system that can be considered as a distributed problem solver for the assessment of irrigation projects design.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Kelemen, “Syntactical models of distributed cooperative systems,”J. Exp. Theor. Artif. Intell. vol. 3, pp. 1–10, 1991.

    Google Scholar 

  2. E. Kiountouzis and C. Papatheodorou, “A knowledge based system to evaluate the design of irrigation projects,” inOperational Research '90 edited by H. E. Bradley, Pergamon Press: Oxford, pp. 313–321, 1991.

    Google Scholar 

  3. R. G. Smith and R. Davis, “Frameworks for cooperation in distributed problem solving,”IEEE Trans. Syst. Man Cybernet. vol. SMC-11, pp. 61–70, 1981.

    Google Scholar 

  4. W. T. McCormick, Jr.; P. J. Schweitzer; and T. W. White, “Problem decomposition and data reorganization by a clustering technique,”Oper. Res. vol. 20, pp. 993–1009, 1972.

    Google Scholar 

  5. S. Niizuma and T. Kitahashi, “A problem decomposition method using differences or equivalence relations between states,”Artif. Intell. vol. 25, pp. 117–151, 1985.

    Google Scholar 

  6. P. S. Ow and S. F. Smith, “Viewing scheduling as an opportunistic problem-solving process,”Ann. Oper. Res. vol. 12, pp. 85–108, 1988.

    Google Scholar 

  7. S. F. Smith, M. S. Fox, and P. S. Ow, “Constructing and maintaining detailed production plans: Investigations into the development of knowledge-based factory scheduling systems,”AI Mag., pp. 45–61, Fall 1986.

  8. S. F. Smith and P. S. Ow, “The use of multiple problem decompositions in time constrained planning tasks,” Intelligent Systems Laboratory, the Robotics Institute, Carnegie-Mellon University, Pittsburgh, PA, CMU-RITR-85-11, 1985.

    Google Scholar 

  9. A. Bond and L. Gasser (eds.),Reading in Distributed Artificial Intelligence Morgan Kaufmann, San Mateo, CA, 1988.

    Google Scholar 

  10. V. R. Lesser and D. D. Corkill, “Functionally accurate cooperative distributed systems,”IEEE Trans. Syst. Man Cybernet. vol. SMC-11, pp. 81–96, 1981.

    Google Scholar 

  11. S. Cammarata, D. McArthur, and R. Steeb, “Strategies of cooperation in distributed problem solving,” inProc. IJCAI-83, Karlsruhe, Germany, 1983, pp. 767–770.

  12. E. H. Durfee, V. R. Lesser, and D. D. Corkill, “Coherent cooperation among communicating problem solvers,”IEEE Trans. Comp., vol. C-36, pp. 1275–1291, 1987.

  13. E. H. Durfee and V. R. Lesser, “Negotiating task decomposition and allocation using partial global planning,” inDistributed Artificial Intelligence, Volume II edited by L. Gasser and M. N. Huhns, Pitman: London, pp. 229–243, 1988.

    Google Scholar 

  14. E. Hudlica and V. Lesser, “Modeling and diagnosing problem-solving system behavior,”IEEE Trans. Syst. Man Cybernet. vol. SMC-17, pp. 407–419, 1987.

    Google Scholar 

  15. T. Gyires, “A heuristic algorithm for distributed control in manufacturing systems,”J. Appl. Intell. vol. 1, pp. 145–155, 1991.

    Google Scholar 

  16. H. P. Williams,Model Building in Mathematical Programming second edition, John Wiley & Sons: New York, NY, 1985.

    Google Scholar 

  17. M. R. Garey and D. S. Johnson,Computers and Intractability A Guide to the Theory of NP-Completeness W. H. Freeman: New York, 1979.

    Google Scholar 

  18. J. C. Bean, J. R. Birge, and R. L. Smith, “Aggregation in dynamic programming,”Oper. Res. vol. 35, pp. 215–220, 1987.

    Google Scholar 

  19. G. Cornuejols, G. Nemhouser, and L. Wolsey, “The uncapacitated facility location problem,” Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, Management Science Research Report No. MSRR 493. 1983.

    Google Scholar 

  20. M. R. Genesereth, M. L. Ginsberg, and J. S. Rosenschein, “Cooperation without communication,” inReading in Distributed Artificial Intelligence edited by A. Bond and L. Gasser, Morgan Kaufmann: San Mateo, CA, pp. 220–226, 1988.

    Google Scholar 

  21. J. S. Rosenschein and M. R. Genesereth, “Deals among rational agents,” inThe Ecology of Computation edited by B. A. Huberman, North Holland: Amsterdam, pp. 117–132, 1988.

    Google Scholar 

  22. J. Dassow and J. Kelemen, “Cooperating/distributed grammar systems: a link between formal languages and artificial intelligence,” inGrammar Systems and Colonies edited by J. Kelemen, Comenius University, Faculty of Mathematics and Physics, Bratislava, Czechoslovakia, CS4-91, pp. 5–20, October 1991.

    Google Scholar 

  23. J. S. Rosenschein, “Synchronization of multi-agent plans,” inReading in Distributed Artificial Intelligence edited by A. Bond and L. Gasser, Morgan Kaufmann: San Mateo, CA, pp. 187–191, 1988.

    Google Scholar 

  24. K. Konolige, “Belief and incompleteness,” inFormal Theories of Commonsense World edited by J. Hobbs and R. Moore, Ablex Publishing Co., Norwood, NJ, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Papatheodorou, C., Magirou, V. & Kiountouzis, V. Problem decomposition in distributed problem-solving systems. Appl Intell 3, 301–315 (1993). https://doi.org/10.1007/BF00872134

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00872134

Key words

Navigation