When developing algorithms for planning the paths of robots forming a group, the problem of ensuring that they do not collide with each other and with possible obstacles arises. In addition, the group may be required to maintain a given formation template in those sections of the group's movement where this is possible taking into account obstacles. However, a narrow spatial corridor of permissible movement of the group is often formed, which can be caused by both the initial requirements for the trajectory (for example, the condition of its location in a certain vicinity of a given point), and the presence of obstacles and other interference effects. The presence of such a restrictive corridor can lead to a forced convergence and even intersection of the spatial trajectories of movement of individual robots in the group. One possible solution to this problem is to specify or adjust the time parametric representations of these individual trajectories so that two robots with spatial trajectories approaching each other are at their closest points at different times. Moreover, the time interval separating the moments of these two robots being at these points should be selected depending on the speed of the robots and their dimensions. The developed method of space-time separation of the trajectories of individual robots in a group is based on this idea. The method involves the formation and solution of a special linear programming problem relative to the target moments of time of previously selected nodes of the spatial trajectory of each slave robot. The limiting factor for changing these moments is the maximum possible speed of the robot. For each robot, a preliminary selection of a set of trajectories of other robots in the group is made, from which it is then necessary to detach in space-time. This occurs depending on the priority of the robots in the group. Examples of numerical implementation of the algorithm based on the proposed method are given, confirming its effectiveness
