Multi-agent based internet search
by Fabricio Enembreck, Jean-Paul Barthes
International Journal of Product Lifecycle Management (IJPLM), Vol. 2, No. 2, 2007

Abstract: In this paper, we present a multi-agent system for searching the internet. The search for interesting documents on the internet is becoming more and more difficult. The main problem is not that we do not have the needed information to build or use knowledge, the problem is that we have too much information, mostly irrelevant. A proof of this is that inference engines are largely outperformed by the expansion of the internet and the results of queries are often of very poor quality. To improve the search process, intelligent individual agents were developed. We believe that multi-agent systems can give more accurate results than the individual agents because in a multi-agent system, agents can be specialised in different tasks and can share information. We implemented such an approach using an open multi-agent system containing personal assistants, library agents, filter agents, and search agents. In this paper, we study the models of internet multi-agent systems and propose an architecture to do intelligent web search. The application is based on an AUML protocol (slightly extended) to allow interoperability and yields more accurate results than standard search engines.

Online publication date: Thu, 28-Jun-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Product Lifecycle Management (IJPLM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email