Computing Algorithm of Robot Distributed 3D Graphic Simulation System

Abstract

In view of the shortcomings of current multi-robot path planning strategies, such as high path coupling, long total path, and long waiting time for collision avoidance, as well as the resulting problems of low system robustness and low robot utilization, the paper proposes Multi-robot path planning particle swarm algorithm based on distributed three-dimensional space-time graphics and motion decomposition. We first generate a dynamic temporary obstacle in the time dimension according to the existing path set and the current robot position, and expand it together with the static obstacle into a three-dimensional search graphics space. Secondly, in the three-dimensional image space, the total path movement time is divided into three parameters: movement time, turning time and staying time in place, and using the conditional depth-first search strategy to calculate all the matching parameters from the starting node to the target node the required path collection. The experimental results show that the path of distributed 3D graphics planning by our proposed particle swarm algorithm has the advantages of total length, less running time, system collision-free, and high robustness, which solves the problem of multi-robot systems completing continuous random tasks.