Abstract:
The problem of movement trajectories formation of a vehicle robots group, functioning in the two-dimensional environment with motionless obstacles, is considered. For the solution of this task, it is possible to use graphic-analytical methods. These methods are based on Dijkstra's algorithms, Bellman–Ford and A$^*$. We carry out experiment including 100 iterations of computer modeling. The results of modeling are data on time of vehicle robots group movement on trajectories developed by means of the algorithms. On the basis of the modeling results was made a comparison of methods. This comparison has allowed revealing the most optimum of methods.