Research of the Algorithms of Individual and Group Movement Strategies of Autonomous Mobile Robots on a Dynamic Map

Simulations of Computer, Telecommunications, Control and Social Systems

The paper considers the solution to the problem of two robots moving towards the target using the algorithm of individual and group strategy motion on a dynamic terrestrial map with variable parameters of the wireless connection radius and the visibility radius. The authors offer a distribution algorithm of path selection which helps robots using limited information to solve the problem of moving towards the target together. MatLab was used for programming and analyzing the algorithms. The results of the simulation show that the group strategy is more effective with a high density of the obstacles on the map and a high dynamic. The results can be used for simulating the individual and group strategies of movement in the conditions of limited radio and visual radius in a dynamically changing environment.