Heuristic resource search in a self-organised distributed multi agent system

Authors:
Muntasir Al-Asfoor;Brendan Neville;Maria Fasli
Affiliations:
School of Computer Science and Electronic Engineering, University of Essex, Colchester, UK;School of Computer Science and Electronic Engineering, University of Essex, Colchester, UK;School of Computer Science and Electronic Engineering, University of Essex, Colchester, UK
Venue:
IWSOS'12 Proceedings of the 6th IFIP TC 6 international conference on Self-Organizing Systems
Year:
2012

Citing 7
Cited 0

AgentSpeak(L): BDI agents speak out in a logical computable language

MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
Efficient search in unstructured peer-to-peer networks

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
MASON: A Multiagent Simulation Environment

Simulation
Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology)

Programming Multi-Agent Systems in AgentSpeak using Jason (Wiley Series in Agent Technology)
Web ontology language (OWL) and semantic web

Ubiquity
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks

IEEE Transactions on Parallel and Distributed Systems
PRESAGE: A Programming Environment for the Simulation of Agent Societies

Programming Multi-Agent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The work presented in this paper has addressed the issue of resource sharing in dynamic heterogeneous Multi Agent Systems as a search problem. When performing a random search, this might lead to traverse the whole network and increase the failure ratio. This paper has introduced heuristic directed search based on the usage of an approximate matching mechanism to overcome this problem. Our implementation of search algorithms differs from traditional algorithms by using semantically guided technique for resource search as well as a dynamically re-organisable network of agents. The experimental results have shown that using directed search techniques is better than random search in terms of number of hops to find the match. Furthermore, network re-organisation has improved the system performance by directing the search based on resources information, especially when high accuracy is required.