Web service combination method

Abstract

The invention discloses a Web service combination method. According to the method, aiming at the problems of long time consumption, poor flexibility and the like of the traditional service combination method, the Agent technology, the game theory and a reinforcement learning method are introduced into a service combination process which is converted into Markov Games or Stochastic Games. On the basis, a Q-learning method and a Team Markov Game theory are further blended in, so that the method can be suitable for a multi-Agent cooperative learning environment, and a final service combination result is obtained through an iteration solution mode. The Web service combination method has the advantages that the solution speed can be increased effectively, the Agents can adapt to the environment autonomously and perform dynamic service combination during efficient cooperation, and the flexibility and self-adaption of service combination are improved effectively.

Description

technical field [0001] The invention belongs to the field of computers and relates to a Web service combination method. Background technique [0002] With the rapid development of the field of Web services in recent years and the rapid increase of service-oriented software development methods, Web service composition has attracted the attention of many researchers. Due to the limited capability of a single Web service, how to effectively integrate various services according to requirements and provide better services has become the core issue of Web service application integration. From the initial function-driven to the later QoS (Quality of Service, Quality of Service)-driven, relevant researchers have done a lot of research work in the field of Web service composition. However, due to the randomness of Web services and the uncertainty of the Internet environment, the field of Web service composition still faces some challenges, such as how to reduce the time spent in the...

AI Technical Summary

Problems solved by technology

However, these methods have the following problems: First, the modeling strategy of these methods is still a Markov decision process in essence, but it is simply extended to each Agent, that is, an MDP model is established for each Agent, It does not take all agents into consideration through a global model; secondly, it does not take into account the possible game and cooperation relationships that each agent may encounter during the learning process, so it cannot be called a complete multi-agent collaborative reinforcement learning

However, since the goals of learning in a collaborative environment are different from those in a competitive environment, these methods cannot be solved as a general method, and they all have their own scope of application. Therefore, different multi-agent collaborative learning methods need to be designed for different scenarios

Images