Skip to main content
SpringerLink
Log in

Automated Service Composition Using Heuristic Search

  • Conference paper
Business Process Management (BPM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 4102))

Included in the following conference series:

Abstract

Automated service composition is an important approach to automatically aggregate existing functionality. While different planning algorithms are applied in this area, heuristic search is currently not used. Lacking features like the creation of compositions with parallel or alternative control flow are preventing its application. The prospect of using heuristic search for composition with quality of service properties motivated the extension of existing heuristic search algorithms.

In this paper we present a heuristic search algorithm for automated service composition. Based on the requirements for automated service composition, shortcomings of existing algorithms are identified, and solutions for them presented.

This paper presents results of the Adaptive Services Grid (ASG) project (contract number 004617, call identifier FP6-2003-IST-2) funded by the Sixth Framework Program of the European Commission.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Zeng, L., Benatallah, B., Lei, H., Ngu, A., Flaxer, D., Chang, H.: Flexible Composition of Enterprise Web Services. Electronic Markets – Web Services 13, 141–152 (2003)

    Google Scholar 

  2. Pistore, M., Barbon, F., Bertoli, P., Shaparau, D., Traverso, P.: Planning and monitoring web service composition. In: Workshop on Planning and Scheduling for Web and Grid Services, held in conjunction with The 14th International Conference on Automated Planning and Scheduling, pp. 70–71 (2004)

    Google Scholar 

  3. Sirin, E., Parsia, B., Wu, D., Hendler, J., Nau, D.: HTN planning for web service composition using shop2. Journal of Web Semantics 1, 377–396 (2004)

    Article  Google Scholar 

  4. Berardi, D., Calvanese, D., Giacomo, G.D., Mecella, M.: Composition of services with nondeterministic observable behaviour. In: Benatallah, B., Casati, F., Traverso, P. (eds.) ICSOC 2005. LNCS, vol. 3826, pp. 520–526. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Hoffmann, J.: Metric-FF planning system: Translating ”ignoring delete lists” to numeric state variables. Journal Of Artificial Intelligence Research 20, 291–341 (2003)

    MATH  Google Scholar 

  6. Meyer, H., Kuropka, D.: Requirements for automated service composition. In: Eder, J., Dustdar, S. (eds.) BPM Workshops 2006. LNCS, vol. 4103, pp. 447–458. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Boddy, M.: Imperfect match: PDDL 2.1 and real applications. Journal Of Artificial Intelligence Research 20, 133–137 (2003)

    MATH  Google Scholar 

  8. W3C: Web Services Description Language (WSDL) 1.1 (2001)

    Google Scholar 

  9. Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14, 253–302 (2001)

    MATH  Google Scholar 

  10. Chapman, D.: Planning for conjunctive goals. Artificial Intelligence 32, 333–377 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  11. Erol, K., Nau, D.S., Subrahamnian, V.: Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence 76, 75–88 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Blum, A., Furst, M.: Fast planning through planning graph analysis. Artificial Intelligence 90, 281–300 (1997)

    Article  MATH  Google Scholar 

  13. Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research 20, 239–290 (2003)

    MATH  Google Scholar 

  14. Do, M., Kambhampati, S.: Sapa: A multi-objective metric temporal planner. Journal Of Artificial Intelligence Research 20, 155–194 (2003)

    MATH  Google Scholar 

  15. Brafman, R., Hoffmann, J.: Conformant planning via heuristic forward search: A new approach. In: Koenig, S., Shlomo Zilbe Koenig, S.Z. (eds.) Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 355–364. Morgan-Kaufmann, San Francisco (2004)

    Google Scholar 

  16. Hoffmann, J., Brafman, R.: Contingent planning via heuristic forward search with implicit belief states. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS 2005). Morgan Kaufmann, San Francisco (2005)

    Google Scholar 

  17. McDermott, D.: A heuristic estimator for means-ends analysis in planning. In: Proceedings of the International Conference on Artificial Intelligence Planning Systems, pp. 142–149 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hasso-Plattner-Institute for IT-Systems-Engineering at the University of Potsdam, Prof.-Dr.-Helmert-Strasse 2-3, 14482, Potsdam, Germany

    Harald Meyer & Mathias Weske

Authors
  1. Harald Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mathias Weske
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Distributed Systems Group, Information Systems Institute, Vienna University of Technology, Austria

    Schahram Dustdar

  2. Department of Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    José Luiz Fiadeiro

  3. Kno.e.sis Center, Dept. of Computer Science & Engineering, Wright State University, 3640 Colonel Glenn Hwy, Dayton, Ohio

    Amit P. Sheth

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meyer, H., Weske, M. (2006). Automated Service Composition Using Heuristic Search. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds) Business Process Management. BPM 2006. Lecture Notes in Computer Science, vol 4102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11841760_7

Download citation

  • DOI: https://doi.org/10.1007/11841760_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38901-9

  • Online ISBN: 978-3-540-38903-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation