Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/6567
Title: WEB SERVICES COMPOSITION VIA AUTOMATED PLANNING
Authors: Das, Mithu
Keywords: ELECTRONICS AND COMPUTER ENGINEERING;WEB SERVICES COMPOSITION;AUTOMATED PLANNING;PLANNING PREFERENCES
Issue Date: 2011
Abstract: Planning with preferences finds solution by considering user preferences. Since obtaining optimal plan is computational intensive, most of the planers try to find single solution which satisfies the user preferences. In this thesis planner will generate multiple solutions, to provide choice of selecting a plan from the set of solution plans. Those plans will be generated using preferences given by the user. Here two methods of finding solution plans are proposed, one without heuristics and another with heuristics, and those are compared. Modifications to depth first search technique for planner without heuristic and modifications to hill climbing algorithm for planner with heuristic are proposed to search the state space. The heuristic value required to select successive node and for deriving multiple solutions is computed using user preferences, To extract multiple solutions from the relaxed planning graph an algorithm is proposed which is modification to single solution extraction algorithm for relaxed planning graph, in which all possible solutions are extracted, by considering all possible actions to achieve goal predicates, there by computing heuristic value which can guide in obtaining multiple solutions. Even though the state space is limited by the user preferences, it is normally large compared to solution length. Thus heuristic planner is faster.
URI: http://hdl.handle.net/123456789/6567
Other Identifiers: M.Tech
Research Supervisor/ Guide: Niyogi, Rajdeep
metadata.dc.type: M.Tech Dessertation
Appears in Collections:MASTERS' DISSERTATIONS (E & C)

Files in This Item:
File Description SizeFormat 
ECED G20948.pdf2.33 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.