SYSTEM FOR TROUBLE-FREE CONTROL OF A ROBOTS GROUP
The problem of simultaneous control of robots group is considered. For each of robots the start and end points of the path are set. Feature the problem is that it is impossible to move robots in a straight line from the starting point to the end point due to the presence of obstacles. It is assumed that obstacles have a circular shape. The presence of obstacles makes it very problematic the use of classical methods of optimal control synthesis or mathematical programming due to non-convexity region of admissible trajectories of the robots. The proposed approach is based on is the segregation of the desired trajectories of robots in certain areas each of which has no obstacles. Search for different options such as the trajectory is based on graph theory, and the movement on each of the sections without obstacles it is reduced to the problem of optimal control synthesizing with phase restrictions. In addition, an algorithm, eliminates the possibility of robots colliding while driving is proposed.