Improvement algorithms for discrete-time control systems based on the extension and localization principles

In this paper, we present iterative improvement algorithms for free-end and constrained discrete-time systems. These algorithms are based on the extension and localization principles. In the case of constrained end problem, a method based on approximation of reachable set is proposed. Algorithm procedures are illustrated with examples.