This paper proposes a novel grouping algorithm for mobile robots to perform a specific work. The concepts of mobile ad hoc network and entropy are adapted to analyze the grouping of mobile robots. The performance metrics such as the number of message ...
This paper proposes a novel grouping algorithm for mobile robots to perform a specific work. The concepts of mobile ad hoc network and entropy are adapted to analyze the grouping of mobile robots. The performance metrics such as the number of message in order to make a robot group and the average number of robots in a logical robot group are newly derived. A logical robot group is created based on the exchange of request and reply messages in a robot group that depends on a transmission range. When a robot tries to a specific work in a robot group, it broadcasts a request message with a certain level of entropy threshold. After receiving the request message, each robot in a robot group checks the threshold value with its threshold value whether the requested value is greater than its value. If it is, the robot responses by sending a reply message to the requested robot, otherwise the robot discards the request message. Whenever, a robot in a robot group sends a reply message, it will become one of member of logical robot group. The proposed algorithm has been verified based on the computer-based simulation.