CORE DATA SCHEDULE IN SOMR NETWORK ROBOT SYSTEM

In single operator multi agent network robot system, the data congestion in the network is the key bottleneck of the whole system. The core CPU acts as the operator and processes all the informations transferred from subordinate robots. As the coordinator, the working efficiency of the core CPU is the key factor for the whole system. The purpose of this paper is to solve the data schedule in SOMR system. A new optimum data schedule manner for the core CPU is presented on the basis of operational research. The mathematic analysis results suggest it is more efficient than CSMA/CD and token passing manners.