Skip to main content

A Distributed Generative CSP Framework for Multi-site Product Configuration

  • Conference paper
Cooperative Information Agents XII (CIA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5180))

Included in the following conference series:

Abstract

Today’s configuration systems are centralized and do not allow manufacturers to collaborate online for offer-generation or sales-configuration activities. However, the integration of configurable products into the supply-chain of a business requires the cooperation of the various manufacturers’ configuration systems to jointly offer valuable solutions to customers. As a consequence, there is a need for methods that enable independent specialized agents to compute such configurations. Several approaches to centralized configuration are based on constraint satisfaction problem (CSP) solving. Most of them extend traditional CSP approaches in order to comply to the specific expressivity and dynamism requirements of configuration and similar synthesis tasks.

The distributed generative CSP (DisGCSP) framework proposed here builds on a CSP formalism that encompasses the generative aspect of variable creation and extensible domains of problem variables. It also builds on the distributed CSP (DisCSP) framework, supporting configuration tasks where knowledge is distributed over a set of agents. Notably, the notions of constraint and nogood are further generalized, adding an additional level of abstraction and extending inferences to types of variables. An example application of the new framework describes modifications to the ABT algorithms and furthermore our evaluation indicates that the DisGCSP framework is superior to classic DisCSP for typical configuration task problem encoding.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Armstrong, A., Durfee, E.F.: Dynamic prioritization of complex agents in distributed constraint satisfaction problems. In: Proc. of the 15th Int. Joint Conf. on Artificial Intelligence (IJCAI), Nagoya, Japan (1997)

    Google Scholar 

  2. Barker, V.E., O’Connor, D.E., Bachant, J.D., Soloway, E.: Expert systems for configuration at Digital: XCON and beyond. Communications of the ACM 32(3), 298–318 (1989)

    Article  Google Scholar 

  3. Bessière, C., Maestre, A., Meseguer, P.: Distributed dynamic backtracking. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, p. 772. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Dechter, R., Dechter, A.: Belief Maintenance in Dynamic Constraint Networks. In: Proc. 7th National Conf. on Artificial Intelligence (AAAI), St. Paul, MN, pp. 37–42 (1988)

    Google Scholar 

  5. Fleischanderl, G., Friedrich, G., Haselböck, A., Schreiner, H., Stumptner, M.: Configuring Large Systems Using Generative Constraint Satisfaction. In: Freuder, E., Faltings, B. (eds.) IEEE Intelligent Systems, Special Issue on Configuration, vol. 13(4), pp. 59–68 (1998)

    Google Scholar 

  6. Haselböck, A.: Knowledge-based configuration and advanced constraint technologies. PhD thesis, Technische Universität Wien (1993)

    Google Scholar 

  7. Havens, W.: Nogood caching for multiagent backtrack search. In: Proc. of 14th National Conf. on Artificial Intelligence (AAAI), Agents Workshop, Providence, Rhode Island (1997)

    Google Scholar 

  8. Junker, U.: Preference-based programming for Configuration. In: Proc. of IJCAI 2001 Workshop on Configuration, Seattle, WA (2001)

    Google Scholar 

  9. Junker, U.: QuickXPlain: Conflict Detection for Arbitrary Constraint Propagation Algorithms. In: Proc. of IJCAI 2001 Workshop on Modelling and Solving problems with constraint, Seattle, WA (2001)

    Google Scholar 

  10. Mailharro, D.: A classification and constraint-based framework for configuration. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 12(4), 383–397 (1998)

    Google Scholar 

  11. McGuiness, D.L., Wright, J.R.: Conceptual Modeling for Configuration: A Description Logic-based Approach. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 12(4), 333–344 (1998)

    Article  Google Scholar 

  12. Mittal, S., Falkenhainer, B.: Dynamic Constraint Satisfaction Problems. In: Proc. of 8th National Conf. on Artificial Intelligence (AAAI), Boston, MA, pp. 25–32 (1990)

    Google Scholar 

  13. Sabin, D., Freuder, E.C.: Configuration as Composite Constraint Satisfaction. In: Proc. of AAAI Fall Symposium on Configuration, AAAI Press, Cambridge (1996)

    Google Scholar 

  14. Silaghi, M.-C., Sam-Haroud, D., Faltings, B.: Asynchronous search with aggregations. In: Proc. of 17th National Conf. on Artificial Intelligence (AAAI), Austin, TX, pp. 917–922 (2000)

    Google Scholar 

  15. Silaghi, M.-C., Sam-Haroud, D., Faltings, B.: ABT with asynchronous reordering. In: Proc. of Intelligent Agent Technology (IAT), Maebashi, Japan, pp. 54–63 (October 2001)

    Google Scholar 

  16. Silaghi, M.-C., Sam-Haroud, D., Faltings, B.V.: Maintaining hierarchically distributed consistency. In: Proc. of 7th Int. Conf. on Principles and Practice of Constraint Programming (CP), DCS Workshop, Singapore, pp. 15–24 (2000)

    Google Scholar 

  17. Silaghi, M.-C., Sam-Haroud, D., Faltings, B.V.: Consistency maintenance for ABT. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 271–285. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Stumptner, M.: An overview of knowledge-based configuration. AI Communications 10(2) (June 1997)

    Google Scholar 

  19. Stumptner, M., Friedrich, G., Haselböck, A.: Generative constraint-based configuration. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 12(4), 307–320 (1998)

    Google Scholar 

  20. Yokoo, M.: Asynchronous weak-commitment search for solving large-scale distributed constraint satisfaction problems. In: Proc. of 1st Int. Conf. on Multi-Agent Sytstems (ICMAS), San Francisco, CA, pp. 318–467 (1995)

    Google Scholar 

  21. Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: Distributed constraint satisfaction for formalizing distributed problem solving. In: Proc. of 12th Int. Conf. on Distributed Computing Systems (ICDCS), Yokohama, Japan, pp. 614–621 (1992)

    Google Scholar 

  22. Yokoo, M., Hirayama, K.: Distributed constraint satisfaction algorithm for complex local problems. In: Proc. of the 3rd Int. Conf. on Multi-Agent Systems (ICMAS), Paris, France, pp. 372–379 (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Matthias Klusch Michal Pěchouček Axel Polleres

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zanker, M., Jannach, D., Silaghi, M.C., Friedrich, G. (2008). A Distributed Generative CSP Framework for Multi-site Product Configuration. In: Klusch, M., Pěchouček, M., Polleres, A. (eds) Cooperative Information Agents XII. CIA 2008. Lecture Notes in Computer Science(), vol 5180. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85834-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85834-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85833-1

  • Online ISBN: 978-3-540-85834-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics