Calculating optimal decision using Meta-level agents for Multi-Agents in Networks
2007 (English)In: Knowledge-Based Intelligent Information and Engineering Systems: KES 2007 - WIRN 2007, Pt I, Proceedings, Springer Berlin/Heidelberg, 2007, 180-188 p.Conference paper (Refereed)
In spatial graphs with a vast number of nodes, it is difficult tocompute a solution to graph optimisation problems. We propose an approachusing meta-level agents for multi-agents in a network to calculate an optimaldecision. The network contains nodes and arcs wherein the agents areinformation carriers between the nodes and, since there is one agent per arc, theagents are statically located. These agents, operating at a ground level,communicate with a comprehensive agent, operating at a meta-level. The agentsat the meta-level hold information computed by the ground-level agents, butalso include ground-level agents’ special conditions. As an example, we applythe work to the travelling salesman problem and use a map, with cities androads, constituting the network where the information about the roads is carriedin the meta-level agents. For multi-agents in maps, we use parallel computing.The parallel computing is at the ground-level agents’ level and simulatesgeographical information systems to provide the agents with environmentalinformation.
Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2007. 180-188 p.
, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 3-540-74817-2 ; 4692
Intelligent agents; Meta-agents; Multi-agent systems; Undirected graphs
IdentifiersURN: urn:nbn:se:kth:diva-44436ISI: 000250338500023ScopusID: 2-s2.0-38049127176OAI: oai:DiVA.org:kth-44436DiVA: diva2:450461
QC 201609292011-10-202011-10-202016-09-29Bibliographically approved