Jaroslaw Skaruz
ABSTRACT
The paper presents a new approach based on nature inspired algorithms to an abstract planning problem, which is a part of the web service composition problem. An abstract plan is defined as an equivalence class of sequences of the same service types that satisfy a user query. The objective of our genetic algorithm (GA) is to return representatives of abstract plans without generating all the equivalent sequences.
- M. Blake, T. Weise, and S. Bleul. Wsc-2010: Web services composition and evaluation. In Proc. of SOCA, pages 1--4, 2010.Google Scholar
Cross Ref
- C. A. C. Coello. Constraint-handling using an evolutionary multiobjective optimization technique. Civil Engineering and Environmental Systems, 17:319--346, 2000.Google ScholarCross Ref
- D. Doliwa, W. Horzelski, M. Jarocki, A. Niewiadomski, W. Penczek, A. Polrola, and J. Skaruz. Harmonics - a tool for composing medical services. In Proc. of ZEUS 2012, pages 25--33, 2012.Google Scholar
- D. Kalyanmoy. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 186:311--338, 2000.Google ScholarCross Ref
- A. Niewiadomski, W. Penczek, and J. Skaruz. Towards automated abstract planning based on a genetic algorithm. Technical Report 1026, ICS PAS, 2012. http://artur.ii.uph.edu.pl/papers/rep1026.pdf.Google Scholar
- J. Peer. A pop-based replanning agent for automatic web service composition. In Proc. of Conf. on the Semantic Web: Research and Application, volume 3532 of LNCS, pages 189--198, 2005. Google ScholarDigital Library
- J. Rao and X. Su. A survey of automated web service composition methods. In Proc. of the Int. Workshop on Semantic Web Services and Web Process Composition, volume 3387 of LNCS, pages 43--54, 2004. Google ScholarDigital Library
- A. Wu and I. Garibay. The proportional genetic algorithm: Gene expression in a genetic algorithm. Genetic Programming and Evolvable Machines, 3(2):157--192, 2002. Google ScholarDigital Library
Index Terms
- Automated abstract planning with use of genetic algorithms
Recommendations
QoS-based Web Service Composition Applying an Improved Genetic Algorithm (IGA) Method
In recent years, it has been made possible to compose exiting services when a user's request cannot be satisfied by a single web service. Web service composition is faced with several challenges among which is the rapid growth in the number of ...
Combining ontology reductions with new approaches to automated abstract planning of Planics
Graphical abstractDisplay Omitted HighlightsWe deal with abstract planning as the first stage of web service composition.We give theoretical foundations and three algorithms for abstract planning.Our algorithms are based on genetic algorithms and ...
GP-genetic planning algorithm based on planning graph
AIAP'07: Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applicationsIn recent years, a new planning algorithm, graph plan, is presented and has a great impact on the development of intelligent planning. In graph planning, the algorithm has two main phases: Firstly, a directed, leveled graph with two kinds of nodes and ...
Comments