The paper is devoted to comparison of the efficiency of information exchange by autonomous mobile agents when searching in a limited coverage area. The special feature of the problem is to consider the case of operation within the prohibition of usage of radio, light, and acoustic communication channels at a great distance, as well as without surfacing. The paper compares the following algorithms for the work of groups of autonomous robots, based on a preliminary division of area into sectors and survey of robots in their sectors using the "breadth-first search" method.