A pheromone based mobile agent migration strategy for servicing networked robots

Abstract

In this paper we describe how mobile agents carrying a resource as a payload can prove to be useful in searching networked robots that require their services. While the agents migrate within the network in a conscientious manner, robots requiring their services diffuse pheromones to attract and guide them through the shortest path. The bidirectional and parallel search on part of the robot and the agent culminates in a faster convergence. The paper also compares the results derived by using this method with those obtained using two other algorithms. The results and discussions clearly indicate that this pheromone based algorithm is better suited for both static and dynamic networked robotics scenarios. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.