Web Services Composition Based on Weighted Planning Graph

For the sake of fulfilling a more complex and more powerful service function, a method of web service composition (WSC-WPG), which is based on weighted planning graph is proposed. The method using AI Graph-plan consists of two phases. The first one is to construct the planning graph, which can find a service composition in a polynomial time in distributed and heterogeneous web services. The second one uses reserved iterative method to search the optimal composition solution in planning graph. Experiments show that, WSC-WPG has greatly improved the efficiency of combination.