Mirko Fiacchini

SY
4papers
150citations
Novelty45%
AI Score23

4 Papers

DSJun 8, 2016
Observer-Based Feedback Stabilization of Linear Systems with Event-triggered Sampling and Dynamic Quantization

Aneel Tanwani, Christophe Prieur, Mirko Fiacchini

We consider the problem of output feedback stabilization in linear systems when the measured outputs and control inputs are subject to event-triggered sampling and dynamic quantization. A new sampling algorithm is proposed for outputs which does not lead to accumulation of sampling times and results in asymptotic stabilization of the system. The approach for output sampling is based on defining an event function that compares the difference between the current output and the most recently transmitted output sample not only with the current value of the output, but also takes into account a certain number of previously transmitted output samples. This allows us to reconstruct the state using an observer with sample-and-hold measurements. The estimated states are used to generate a control input, which is subjected to a different event-triggered sampling routine; hence the sampling times of inputs and outputs are asynchronous. Using Lyapunov-based approach, we prove the asymptotic stabilization of the closed-loop system and show that there exists a minimum inter-sampling time for control inputs and for outputs. To show that these sampling routines are robust with respect to transmission errors, only the quantized (in space) values of outputs and inputs are transmitted to the controller and the plant, respectively. A dynamic quantizer is adopted for this purpose, and an algorithm is proposed to update the range and the centre of the quantizer that results in an asymptotically stable closed-loop system.

SYAug 24, 2018
LMI-Based Reset Unknown Input Observer for State Estimation of Linear Uncertain Systems

Iman Hosseini, Alireza Khayatian, Paknoush Karimaghaee et al.

This paper proposes a novel kind of Unknown Input Observer (UIO) called Reset Unknown Input Observer (R-UIO) for state estimation of linear systems in the presence of disturbance using Linear Matrix Inequality (LMI) techniques. In R-UIO, the states of the observer are reset to the after-reset value based on an appropriate reset law in order to decrease the $L_2$ norm and settling time of estimation error. It is shown that the application of the reset theory to the UIOs in the LTI framework can significantly improve the transient response of the observer. Moreover, the devised approach can be applied to both SISO and MIMO systems. Furthermore, the stability and convergence analysis of the devised R-UIO is addressed. Finally, the efficiency of the proposed method is demonstrated by simulation results.

SYOct 23, 2018
Computing control invariant sets in high dimension is easy

Mirko Fiacchini, Mazen Alamir

In this paper we consider the problem of computing control invariant sets for linear controlled high-dimensional systems with constraints on the input and on the states. Set inclusions conditions for control invariance are presented that involve the N-step sets and are posed in form of linear programming problems. Such conditions allow to overcome the complexity limitation inherent to the set addition and vertices enumeration and can be applied also to high dimensional systems. The efficiency and scalability of the method are illustrated by computing approximations of the maximal control invariant set, based on the 10-step operator, for a system whose state and input dimensions are 30 and 15, respectively.

SYAug 16, 2017
Computing control invariant sets is easy

Mirko Fiacchini, Mazen Alamir

In this paper we consider the problem of computing control invariant sets for linear controlled systems with constraints on the input and on the states. We focus in particular on the complexity of the computation of the N-step operator, given by the Minkowski addition of sets, that is the basis of many of the iterative procedures for obtaining control invariant sets. Set inclusions conditions for control invariance are presented that involve the N-step sets and are posed in form of linear programming problems. Such conditions are employed in algorithms based on LP problems that allow to overcome the complexity limitation inherent to the set addition and can be applied also to high dimensional systems. The efficiency and scalability of the method are illustrated by computing in less than two seconds an approximation of the maximal control invariant set, based on the 15-step operator, for a system whose state and input dimensions are 20 and 10 respectively.