ИСТИНА

This paper is devoted to building distributed swarm robotic control algorithms on the example of the maze traversal problem. As a modeling tool is proposed to use the stochastic block cellular automata with Markov neighborhood. Several search algorithms solving the maze are considered, the results of their numerical comparison are described, the degree of parallelism and efficiency with respect to solving the maze by single robot are analyzied. This work was supported by RFBR (grant №14-07-00628 A).