This chapter describes how meta-agents in a multi-agent system can be used to effectively search for services in networks with an event-driven algorithm. These services can be attained in a range of different ways, including a simultaneous combination of several services in order to optimize costs and time. A challenge with a network is finding and extracting an optimal combination of the different services to implement a complex requested service. To solve this problem, it is possible to develop multi-agent systems in which the task steers the agents. While finding information on the web, the search path becomes an event-driven algorithm. The algorithm acts as a search method to extract information from several different services. Once built up, the algorithm can guide future search and optimize the searching. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Håkansson, A. (2009). An event-driven algorithm for agents on the web. Studies in Computational Intelligence, 170, 147–174. https://doi.org/10.1007/978-3-540-88049-3_7
Mendeley helps you to discover research relevant for your work.