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
Distributed ant colony clustering using mobile agents and its effects
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part I
Ant colony clustering using mobile agents as ants and pheromone
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part I
IEEE Computational Intelligence Magazine
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Making autonomous robots form lines
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part I
| Hi-index | 0.00 |
This paper presents effective extensions of our previously proposed algorithm for controlling multiple robots. The robots are connected by communication networks, and the controlling algorithm is based on a specific Ant Colony Clustering (ACC) algorithm. In traditional ACC, imaginary ants convey imaginary objects for classifying them based on some similarities, but in our algorithm, we implemented the ants as actual mobile software agents that control the mobile robots which are corresponding to objects. The ant agent as a software agent guides the mobile robot (object) to which direction it should move. In the previous approach, we implemented not only the ant but also the pheromone as mobile software agents to assemble the mobile robots with as little energy consumption as possible. In our new approach, we take advantage of the pheromone agents not only to assemble the robots but also to serialize them. The serializing property is desirable for particular applications such as gathering carts in airports. We achieve the property by allowing each ant agent to alternatively receive a pheromone agent. We have built a simulator based on our algorithm, and conducted numerical experiments to demonstrate the feasibility of our approach. The experimental results show the effectiveness of our algorithm.