On the computation of invariant sets for constrained nonlinear systems: An interval arithmetic approach

  • Authors:

  • J. M. Bravo;D. Limon;T. Alamo;E. F. Camacho

  • Affiliations:

  • Departamento de Ingeniería Electrónica, Sistemas Informáticos y Automática, Universidad de Huelva, Carretera Huelva-La Rábida, Palos de la Frontera, 21071 Huelva, Spain;Departamento de Ingeniería de Sistemas y Automática, Universidad de Sevilla, Avda Camino de los Descubrimientos s/n. 41092 Sevilla, Spain;Departamento de Ingeniería de Sistemas y Automática, Universidad de Sevilla, Avda Camino de los Descubrimientos s/n. 41092 Sevilla, Spain;Departamento de Ingeniería de Sistemas y Automática, Universidad de Sevilla, Avda Camino de los Descubrimientos s/n. 41092 Sevilla, Spain

  • Venue:
  • Automatica (Journal of IFAC)
  • Year:
  • 2005

Quantified Score

Hi-index 22.15

Visualization

Abstract

This paper deals with the computation of control invariant sets for constrained nonlinear systems. The proposed approach is based on the computation of an inner approximation of the one step set, that is, the set of states that can be steered to a given target set by an admissible control action. Based on this procedure, control invariant sets can be computed by recursion. We present a method for the computation of the one-step set using interval arithmetic. The proposed specialized branch and bound algorithm provides an inner approximation with a given bound of the error; this makes it possible to achieve a trade off between accuracy of the computed set and computational burden. Furthermore an algorithm to approximate the one step set by an inner bounded polyhedron is also presented; this allows us to relax the complexity of the obtained set, and to make easier the recursion and storage of the sets.