Heuristic Web service combination method based on graph planning

• Main Authors: YIN GUISHENG, DONG YUXIN, LIU JIE, YAO ZHEN, HAN QILONG, ZHANG LIGUO, ZOU ZIJING, ZHANG YANPING, WANG YAN
• Format: Patent
• Language: Chinese; English
• Published: 29.08.2017
• Subjects: ELECTRIC COMMUNICATION TECHNIQUE; ELECTRICITY; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION

The invention provides a heuristic Web service combination method based on graph planning. Firstly, a service combination problem is modeled to illustrate a corresponding relation with an intelligent planning problem; in order to solve the defect of blind search of the service combination algorithm based on graph planning, a concept of state distance is proposed, the function of the state distance in accessibility analysis is analyzed and proved, and a construction method of a state distance matrix is proposed; and in accordance with the state distance matrix, the accessibility of a heuristic function to the service is estimated, unnecessary services are trimmed, the scale of the planed graph is reduced, and the solution efficiency of the algorithm is improved. 本发明提供的是种基于图规划的启发式Web服务组合方法。首先对服务组合问题进行建模，阐述了其与智能规划问题的对应关系；为了解决基于图规划的服务组合算法的盲目搜索的缺点，提出了状态距离的概念，分析和证明了其在可达性分析中的作用，给出了状态距离矩阵的构建方法；依据状态距离矩阵，设计启发函数对服务的可达性进行估计，修剪不必要的服务，减小规划图的规模，提高算法的求解效率。