Set computation for nonlinear control (Q1424800)

The paper discusses, for a nonlinear discrete-time system, the problem to determine a control sequence which has to satisfy given set-membership specifications for the state and output vectors, and which (sometimes) has to be robust under some type of perturbations. A basic tool are constraint propagation methods, which are used under the additional assumptions that the constraints always relate to only two variables, and that the corresponding constraint-relatedness graph is a tree. The authors design corresponding algorithms, linear in the length of the control sequence, which solve the problem. These methods are illustrated with two examples.