Optimal response of plants with canonical vectorgrams

The paper is concerned with speed-optimal moving of the plant to the origin of coordinates with the plant vectorgrams being strictly convex compact with a smooth boundary. Its properties are established from the viewpoint of using both the maximum principle and the method of dynamic programming. An analogous problem is solved for particular classes of such plants has been considered in [1-4].