The problem of determining maximal safe sets and hybrid controllers is computationally intractable because of the mathematical generality of hybrid system models. Given the practical and theoretical relevance of the problem, finding implementable procedures that could at least approximate the maximal safe set is important. To this end, we begin by restricting our attention to a special class of hybrid systems: switching systems. We exploit the structural properties of the graph describing the discrete part of a switching system to develop an efficient procedure for the computation of the safe set. This procedure requires the computation of a maximal controlled invariant set. We then restrict our attention to linear discrete-time systems for which there is a wealth of results available in the literature for the determintation of maximal controlled invariant sets. However, even for this class of systems, the computation may not converge in a finite number of steps. We then propose to compute inner approximations that are controlled invariant and for which a procedure that terminates in a finite number of steps can be obtained. A tight bound on the error can be given by comparing the inner approximation with the classical outer approximation of the maximal controlled invariant set. Our procedure is applied to the idle-speed regulation problem in engine control to demonstrate its efficiency.

Computation of maximal safe sets for switching systems

DE SANTIS, Elena;DI BENEDETTO, MARIA DOMENICA;
2004

Abstract

The problem of determining maximal safe sets and hybrid controllers is computationally intractable because of the mathematical generality of hybrid system models. Given the practical and theoretical relevance of the problem, finding implementable procedures that could at least approximate the maximal safe set is important. To this end, we begin by restricting our attention to a special class of hybrid systems: switching systems. We exploit the structural properties of the graph describing the discrete part of a switching system to develop an efficient procedure for the computation of the safe set. This procedure requires the computation of a maximal controlled invariant set. We then restrict our attention to linear discrete-time systems for which there is a wealth of results available in the literature for the determintation of maximal controlled invariant sets. However, even for this class of systems, the computation may not converge in a finite number of steps. We then propose to compute inner approximations that are controlled invariant and for which a procedure that terminates in a finite number of steps can be obtained. A tight bound on the error can be given by comparing the inner approximation with the classical outer approximation of the maximal controlled invariant set. Our procedure is applied to the idle-speed regulation problem in engine control to demonstrate its efficiency.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11697/4911
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 82
  • ???jsp.display-item.citation.isi??? 67
social impact