Extended Formulation of the Problem of Terrain Exploration using a Multi-agent System

this study presents an experimental analysis of the comparison of route planning algorithms for multi-agent systems in the terrain exploration task. The criterion of the traveled distance to full coverage of the terrain is chosen as the main criterion of the algorithms' performance quality. The developed imitation environment of the terrain under study is used to compare the algorithms. Tests have been conducted using a group with two to four agents. In addition to comparing existing algorithms, a new route planning algorithm is developed. As a result of the comparative analysis, different scenarios of using each of the algorithms in practice are proposed.