Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Towards a conversation-driven composition of web services
Web Intelligence and Agent Systems
Composing Business Processes with Partial Observable Problem Space in Web Services Environments
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Planning and monitoring the execution of web service requests
International Journal on Digital Libraries - Special issue on Service-Oriented Computing
Automated Web Service Composition Using Extended Representation of Planning Domain
ICWS '08 Proceedings of the 2008 IEEE International Conference on Web Services
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
STRIPS: a new approach to the application of theorem proving to problem solving
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Automated Web Service Composition: A Decentralised Multi-agent Approach
WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Planning as model checking for extended goals in non-deterministic domains
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
s slGolog: When conditional compositions of web services meet semantic links and causal laws
Web Intelligence and Agent Systems
A formal model for semantic web service composition
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Hi-index | 0.00 |
The ability to automatically answer a request that requires the composition of a set of web services has received much interest in the last decade, as it supports B2B applications. It aims at selecting and inter-connecting services provided by different partners in response to client requests. Planning techniques are used widely in the literature to describe web services composition problem. However, since web services proliferate day after day, classical planners are no longer well suited to compose web services in a reasonable time. This weakness is due to the explosion of the search space caused by the large number of services and the broad range of data exchanged among services. Therefore it is more interesting to use a decentralized planner to distribute the search space and the computing load taking into account the distributed nature of the problem. In this paper, we propose a distributed multi-agent approach to solving the web services composition problem at runtime. Our approach consists of a set of web services agents where each agent has a set of services organised in a graph. To respond to a request, agents propose their best local partial plans which are partial paths in the graph. They then coordinate their partial plans to provide the best global plan for the submitted request. The analysis of the complexity and the results of the implementation show the ability of our approach to scaling up when compared to the state-of-the-art techniques for automated web services composition.