Algorithm of an optimization route for collaborative 2 swarm robots

This paper presents the algorithm of an optimization route for collaborative 2 swarm robots. The target is to pick up four blocks at given points randomly and bring them to the target places which are certainly assigned. The problem space is divided into two areas; inner and outer. The inner is defined as a square matrix of 6 × 6, whereas the outer is outside that area. The robots are started at inner space together with the four blocks. They have to work collaboratively in order to bring the blocks to the target places as fast as possible or the shortest distances. The algorithm is divided into two parts. One is used for individual robot control, whereas another is used for two robots´ collaboration. The case study is tested on MATLAB.