Abstract
Meta-level agents and intelligent agents in multi-agent systems can be used to search for solutions in networks and graphs where the meta-agents provide paths between nodes based on properties of the graph elements given at the time. A challenge with network problems is finding these search paths while extracting information in the network within an acceptable time bound. Moreover, this is especially difficult when information is extracted and combined from several different sources. Reducing time and making the agents work together requires a plan or an effective algorithm. In this paper we propose an approach to an event-driven algorithm that can search for information in networks using meta-agents in multi-agent systems. The metaagents monitor the agents using event-driven communication, acting as a search method and extract the searching for information in networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have