Distributed ant colony clustering using mobile agents and its effects

Authors:
Ryotaro Oikawa;Masashi Mizutani;Munehiro Takimoto;Yasushi Kambayashi
Affiliations:
Department of Information Sciences, Tokyo University of Science, Japan;Department of Information Sciences, Tokyo University of Science, Japan;Department of Information Sciences, Tokyo University of Science, Japan;Department of Computer and Information Engineering, Nippon Institute of Technology, Japan
Venue:
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Year:
2010

Citing 6
Cited 1

The dynamics of collective sorting robot-like ants and ant-like robots

Proceedings of the first international conference on simulation of adaptive behavior on From animals to animats
Diversity and adaptation in populations of clustering ants

SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
Saving Energy Consumption of Multi-robots Using Higher-Order Mobile Agents

KES-AMSTA '07 Proceedings of the 1st KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Suppressing the Total Costs of Executing Tasks Using Mobile Agents

HICSS '09 Proceedings of the 42nd Hawaii International Conference on System Sciences
Ant colony optimization

IEEE Computational Intelligence Magazine
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

A serialization algorithm for mobile robots using mobile agents with distributed ant colony clustering

KES'11 Proceedings of the 15th international conference on Knowledge-based and intelligent information and engineering systems - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new approach for controlling mobile multiple robots connected by communication networks. The control mechanism is based on a specific Ant Colony Clustering (ACC) algorithm. In traditional ACC, an ant convey an object, but in our approach, the ant is implemented as a mobile software agent that controls the robot which is corresponding to an object, so that the object moves to the direction ordered by the ant agent. In this time, the process in which an ant searches an object corresponds to a sequence of migrations of the ant agent, which is much more efficient than the search by a mobile robot. In our approach, not only the ant but also the pheromone is implemented as a mobile software agent. The mobile software agents can migrate from one robot to another, so that they can diffuse over robots within their scopes. In addition, since they have their strengths as vector values, they can represent mutual intensification as synthesis of vectors. We have been developing elemental techniques for controlling multiple robots using mobile software agents, and showed effectiveness of applying them to the previous ACC approach which requires a host computer that centrally controls mobile robots. The new ACC approach decentralizes the mobile robot system, and makes the system free from special devices for checking locations.