Algorithm for Constructing a Guaranteeing Program Package in a Control Problem with Incomplete Information

Аннотация

A package control problem is considered for a target set at a moment of time. The dynamic system under control is described by linear differential equations, the control area is a convex compact, and the target set is convex and closed. A version of the subsequent approximations method in extended space is proposed for constructing elements of a guaranteeing program package in the case of regular clusters.