Core data schedule in single-operator multi-agent network robot system

In single-operator multi-agent (SOMR) network robots system, the data congestion on the network is the key bottleneck of the whole system. The core CPU acts as the operator and processes all the information transferred from subordinate robots. The core CPU plays the most important role as a coordinator, so its working efficiency is the key factor of the whole system. In order to overcome these problems, a new optimum data schedule for the core CPU of SOMR network robot system is presented in this paper on the base of queue theory. By contrasting with the CSMA/CD and token-passing manners, the new manner is proved to be more efficient.