Switching control of constrained linear systems

From MaRDI portal





Given a linear dynamical discrete time system subject to input disturbance, with hard constraints on both states and controls, the paper addresses the problem of computing a control law which steers any initial state in a specified set to a target robust, controlled invariant set in minimum time, despite the disturbances. The state is assumed accessible. The disturbance vector is unknown, but it is assumed to belong to a known set at each time. All the involved sets are polyhedra. Two nonlinear controllers are proposed: the first one requires the solution of a linear programming problem at each step of time. The second requires the partition (to be computed off-line) of a nested sequence of polytopes in state space into simplices: a precomputed affine controller can be associated to each simplex, so that a supervisor selects the current controller to be the one corresponding to the simplex in which the current state resides. In my opinion the paper is a bit lacking in references: in fact to the best of my knowledge, it seems that some papers in the literature solved similar problems, with techniques akin to the one proposed here (see in particular \textit{P. O. Gutman} and \textit{M. Cwikel} [IEEE Trans. Autom. Control AC-31, 373-376 (1986; Zbl 0589.93048)] and \textit{F. Blanchini} [IEEE Trans. Autom. Control 39, 428-433 (1994; Zbl 0800.93754)]). In the former paper the control at vertices was used, which leads to a linear variable-structure control. In the latter, the technique of decomposing a given set into simplices was adopted. For the entire collection see [Zbl 0864.00080].











This page was built for publication: Switching control of constrained linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353656)