Abstract:
We propose a method for choosing the order in which a nonlinear third-order system approaches a group of moving points in a minimum time and a method for constructing a shortest polygonal path for the sequential connection of rectangles in the case of obstacles. connecting rectangles if there are restrictions.