Automated abstract planning with use of genetic algorithms

Authors:
Jaroslaw Skaruz;Artur Niewiadomski;Wojciech Penczek
Affiliations:
ICS, University of Natural Sciences and Humanities, Siedlce, Poland;ICS, University of Natural Sciences and Humanities, Siedlce, Poland;Institute of Computer Science Polish Academy of Sciences, Warsaw, Poland
Venue:
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Year:
2013

Citing 3
Cited 0

The Proportional Genetic Algorithm: Gene Expression in a Genetic Algorithm

Genetic Programming and Evolvable Machines
A POP-Based replanning agent for automatic web service composition

ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
A survey of automated web service composition methods

SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition

Quantified Score

Hi-index	0.00

Visualization

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.