Solving the abstract planning problem using genetic algorithms

DSpace/Manakin Repository

Show full item record

Title Solving the abstract planning problem using genetic algorithms
Autor: Skaruz, Jarosław; Niewiadomski, Artur; Penczek, Wojciech
URI: http://hdl.handle.net/11331/3452
Date: 2013
Źródło: Studia Informatica : systemy i technologie informacyjne. Nr 17 (2013), s. 29-48
Abstract: The paper presents a new approach based on genetic algorithms to the abstract planning problem, which is the first stage of the web service composition problem. An abstract plan is defined as an equivalence class of sequences of service types that satisfy a user query. Intuitively, two sequences are equivalent if they are com-posed of the same service types, but not necessarily occurring in the same order. The objective of our genetic algorithm (GA) is to return representatives of abstract plans without generating all the equivalent sequences. The paper presents experimental re-sults compared with the results obtained from SMT-solver, which show that GA finds solutions for very large sets of service types in a reasonable time.

Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s)

Uznanie autorstwa-Na tych samych warunkach 3.0 Polska Except where otherwise noted, this item's license is described as Uznanie autorstwa-Na tych samych warunkach 3.0 Polska

Search DSpace


Advanced Search

Browse

My Account

Statistics