2010
DOI: 10.1007/s10489-010-0238-z
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic planning approach to automated web service composition

Abstract: In this paper, novel ideas are presented for solving the automated web service composition problem. Some of the possible real world problems such as partial observability of the environment, nondeterministic effects of web services and service execution failures are solved through a dynamic planning approach. The proposed approach is based on a novel AI planner that is designed for working in highly dynamic environments under time constraints, namely Simplanner. World altering service calls are done according … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
57
0
2

Year Published

2012
2012
2023
2023

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 54 publications
(59 citation statements)
references
References 20 publications
0
57
0
2
Order By: Relevance
“…Automated web service composition supported by agents has been widely studied, from considering semantic aspects of web services [10,28] through supporting service interaction [8,39] and handling failures [29] to verifying and validating service compositions [35]. However, this section is only centered on automated web service composition approaches where agents show self-organization capabilities, reaction to environment's changes, and/or make use of cost-based service selection mechanisms, given their close relation with the present work.…”
Section: Related Workmentioning
confidence: 99%
“…Automated web service composition supported by agents has been widely studied, from considering semantic aspects of web services [10,28] through supporting service interaction [8,39] and handling failures [29] to verifying and validating service compositions [35]. However, this section is only centered on automated web service composition approaches where agents show self-organization capabilities, reaction to environment's changes, and/or make use of cost-based service selection mechanisms, given their close relation with the present work.…”
Section: Related Workmentioning
confidence: 99%
“…However, this research focuses on preparing and classifying the web services before composition to fasten the search process. [14] the research proposes an algorithm for anytime planning that is based on overlapping between planning and execution. The tasks in anytime planning are executed ones it entered the plan.…”
Section: The Comparative Studymentioning
confidence: 99%
“…Many inmemory approaches based on different techniques have been successfully employed in solving service composition problem. These include Integer Linear programming [1], beam-stack search [2] and the planning model [3]- [5]. For each user request, in-memory approaches construct a search graph and search this graph for a solution.…”
Section: Introductionmentioning
confidence: 99%