Automated service composition using heuristic search

Authors:
Harald Meyer;Mathias Weske
Affiliations:
Hasso-Plattner-Institute for IT-Systems-Engineering at the University of Potsdam, Potsdam, Germany;Hasso-Plattner-Institute for IT-Systems-Engineering at the University of Potsdam, Potsdam, Germany
Venue:
BPM'06 Proceedings of the 4th international conference on Business Process Management
Year:
2006

Citing 11
Cited 9

Planning for conjunctive goals

Artificial Intelligence
Complexity, decidability and undecidability results for domain-independent planning

Artificial Intelligence - Special volume on planning and scheduling
Fast planning through planning graph analysis

Artificial Intelligence
The FF planning system: fast plan generation through heuristic search

Journal of Artificial Intelligence Research
Imperfect match: PDDL 2.1 and real applications

Journal of Artificial Intelligence Research
Sapa: a multi-objective metric temporal planner

Journal of Artificial Intelligence Research
Planning through stochastic local search and temporal action graphs in LPG

Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables

Journal of Artificial Intelligence Research
HTN planning for Web Service composition using SHOP2

Web Semantics: Science, Services and Agents on the World Wide Web
Composition of services with nondeterministic observable behavior

ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
Requirements for automated service composition

BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops

A novel graph based approach for automatic composition of high quality grid workflows

Proceedings of the 18th ACM international symposium on High performance distributed computing
Message-based web service composition, integrity constraints, and planning under uncertainty: a new connection

Journal of Artificial Intelligence Research
Resolution of Compliance Violation in Business Process Models: A Planning-Based Approach

OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
On the semantics of service compositions

RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Modeling alternatives in exception executions

BPM'07 Proceedings of the 2007 international conference on Business process management
Fast forward planning by guided enforced hill climbing

Engineering Applications of Artificial Intelligence
A semi-automated orchestration tool for service-based business processes

ICSOC'06 Proceedings of the 4th international conference on Service-oriented computing
SAP speaks PDDL: exploiting a software-engineering model for planning in business process management

Journal of Artificial Intelligence Research
Web service execution model for cloud environment

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

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.