Multi-Robot Forest Coverage for Unweighted Terrain

Different planning problems for mobile robots are of considerable interest for many years. Frequently, such problems require to solve different hard computational problems. Multi-robot forest coverage is one of such computational problems. In this paper, we consider an efficient approach to solve the problem of multi-robot forest coverage for unweighted terrain. In particular, we consider an explicit reduction from the decision version of the problem of multi-robot forest coverage for unweighted terrain to the satisfiability problem. For different satisfiability algorithms, the results of computational experiments are presented.