Group search in a maze (the atlas of computational cases for a problem of information blocking)

The problem of information blocking for a distributed mobile system (DMS) is encompass byed volume, that the mobile robots (МR), included in a structure DMS, execute information circumvention of some restricted environment so that any object (including driving) has not remained unnoticed. The examples of the solution of this problem for seven types of environments are adduced. The relation of efficiency of the solution of a problem to number МR in a structure DMS and structural characteristics of environment is investigated.