Holonification of a network of agents based on graph theory

Authors:
Monireh Abdoos;Ahmad Esmaeili;Nasser Mozayani
Affiliations:
Computer Engineering Department, Iran University of Science and Technology, Tehran, Iran;Computer Engineering Department, Iran University of Science and Technology, Tehran, Iran;Computer Engineering Department, Iran University of Science and Technology, Tehran, Iran
Venue:
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Year:
2012

Citing 7
Cited 2

Multiagent systems: a modern approach to distributed artificial intelligence

Multiagent systems: a modern approach to distributed artificial intelligence
Overlay networks for task allocation and coordination in dynamic large-scale networks of cooperative agents

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A behavioral multi-agent model for road traffic simulation

Engineering Applications of Artificial Intelligence
Learning of coordination: exploiting sparse interactions in multiagent systems

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
On finding graph clusterings with maximum modularity

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Formal specification of holonic multi-agent systems framework

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Survey: Graph clustering

Computer Science Review

Holonic multi-agent system for traffic signals control

Engineering Applications of Artificial Intelligence
Hierarchical control of traffic signals using Q-learning with tile coding

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A multi-agent system consists of a group of interacting autonomous agents. The key problem in such a system is coordination and cooperation, i.e. how to ensure that individual decisions of the agents result in jointly optimal decisions for the overall system. This problem becomes even more serious when the number of the agents is large. Holonic model is an effective method to manage large scale problems. In holonic approaches, the formation of the initial holons is very critical and has a great influence on their performance and effectiveness. In this paper, we use a graph based modelling approach to group a population of agents with a greedy method, driven by a very simple and effective quality measure. The proposed method is evaluated by applying it to an urban traffic problem as a case study and it is shown the proposed method produces better results.