Information diffusion by local communication of multiple mobile robots

For robot cooperation in a large system with many mobile robots, the locality and concurrence of communication must be taken into account. The time-delay in communication becomes important for task planning in such a robot environment. We analyzed the information diffusion among many mobile robots, and proposed a method to evaluate the time-delay and to control the diffusion using the logistic equation. The model is verified and the effectiveness of our method is verified by simulation which implements many mobile robots. Another simulation of cooperative task execution shows that the analysis allows us to make task planning more efficient. Utilizing this simple logistic function, the time-delay required so that the task information is transmitted to the necessary number of robots is computed, and unnecessary diffusion of the information can be avoided.<<ETX>>

[1]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[2]  Fabrice R. Noreils,et al.  An architecture for cooperative and autonomous mobile robots , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[3]  Hajime Asama,et al.  Design Of An Autonomous And Distributed Robot System: Actress , 1989, Proceedings. IEEE/RSJ International Workshop on Intelligent Robots and Systems '. (IROS '89) 'The Autonomous Mobile Robots and Its Applications.

[4]  Maja J. Mataric,et al.  Minimizing complexity in controlling a mobile robot population , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[5]  Jing Wang.  Establish a globally consistent order of discrete events in distributed robotic systems , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.