AN APPROACH TO SORTING SWARM ROBOTS TO OPTIMIZE PERFORMANCE

摘要

Swarm robotic systems can offer many advantages including robustness, flexibility and scalability. However one of the issues relating to overall swarm performance that needs to be considered is hardware variations inherent in the implementation of individual swarm robots. This variation can bring behavioral diversity within the swarm, resulting in uncontrollable swarm behaviors, low efficiency, etc. If swarm robots could be separated by behaviors, operational advantages could be obtained. In this paper we report an approach to the sorting of large robotic swarms using an approach inspired by chromatography. Hence the tedious and expensive calibration process can be avoided. The results investigate the influence of the internal control parameters, together with environmental effects on the robotic behavioral sorting. We concluded that if the robot has knowledge of previous events coupled with a specific arena pattern density will offer improved behavioral sorting.