Admissible sets for slowly-varying discrete-time systems

• Autores: Magnus Nilsson, Emily Klineberg, Philipp Rumschinski, Lars Johannesson Mårdh
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Nº. 112, 2020
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • This note describes a method to calculate admissible sets for dynamical systems with slowly-varying parameters. A set of initial states is said to be admissible if all state trajectories starting within this set respect safety-critical constraints for all future time instances. For many classes of systems, the Maximal Admissible Set (MAS) equals the Maximal Robust Positive Invariant (MRPI) set. Therefore, much of the literature focus on algorithms that produce (approximations of) the MRPI set. However, for slowly-varying systems it turns out that the MAS can be larger than the MRPI set. A property referred to as the M-proximal contraction property is defined for such systems to state sufficient conditions for sets to be admissible. It is then shown that Algorithm 2 produces an admissible set that is a superset of the MRPI set.