A New Approach for Guaranteed State Estimation by Zonotopes

18th World CongressThe International Federation of Automatic ControlMilano (Italy) August 28 - September 2This paper proposes a methodology for guaranteed state estimation of linear discrete-time systems in the presence of bounded disturbances and noises. This aims at computing an outer approximation of the state estimation domain represented by a zonotope. A new criterion is used to reduce the size of the zonotope at each sample time. An illustrative example is analyzed in order to highlight the advantages of the proposed algorithm

A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding

Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by employing sets of probability measures. Inference in set-membership estimation is thus carried out by computing expectations with respect to the updated set of probability measures P as in the probabilistic case. In particular, it is shown that inference can be performed by solving a particular semi-infinite linear programming problem, which is a special case of the truncated moment problem in which only the zero-th order moment is known (i.e., the support). By writing the dual of the above semi-infinite linear programming problem, it is shown that, if the nonlinearities in the measurement and process equations are polynomial and if the bounding sets for initial state, process and measurement noises are described by polynomial inequalities, then an approximation of this semi-infinite linear programming problem can efficiently be obtained by using the theory of sum-of-squares polynomial optimization. We then derive a smart greedy procedure to compute a polytopic outer-approximation of the true membership-set, by computing the minimum-volume polytope that outer-bounds the set that includes all the means computed with respect to P

Zonotopic set-membership state estimation for discrete-time descriptor LPV systems

© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This technical note proposes a novel set-membership state estimation approach based on zonotopes for discrete-time descriptor linear parameter-varying systems. The consistency test between the system model and measured outputs is implemented to construct a parameterized intersection zonotope with respect to a correction matrix. With a defined zonotope minimization criterion, we propose a novel offline optimization problem to obtain the optimal correction matrix. In addition, with the proposed approach, an adaptive bound of the radius of the intersection zonotope is also provided. Finally, a case study with a truck-trailer system is shown to illustrate the proposed approach.Peer ReviewedPostprint (author's final draft

Finite-time average consensus in a Byzantine environment using Set-Valued Observers

This paper addresses the problem of consensus in the presence of Byzantine faults, modeled by an attacker injecting a perturbation in the state of the nodes of a network. It is firstly shown that Set-Valued Observers (SVOs) attain finite-time consensus, even in the case where the state estimates are not shared between nodes, at the expenses of requiring large horizons, thus rendering the computation problem intractable in the general case. A novel algorithm is therefore proposed that achieves finite-time consensus, even if the aforementioned requirement is dropped, by intersecting the set-valued state estimates of neighboring nodes, making it suitable for practical applications and enabling nodes to determine a stopping time. This is in contrast with the standard iterative solutions found in the literature, for which the algorithms typically converge asymptotically and without any guarantees regarding the maximum error of the final consensus value, under faulty environments. The algorithm suggested is evaluated in simulation, illustrating, in particular, the finite-time consensus property

Robust MPC for actuator-fault tolerance using set-based passive fault detection and active fault isolation

In this paper, an actuator fault-tolerant control (FTC) scheme is proposed, which is based on tube-based model predictive control (MPC) and set-theoretic fault detection and isolation (FDI). As a robust MPC technique, tube-based MPC, can effectively deal with system constraints and uncertainties with relatively low computational complexity. Set-based FDI can robustly detect and isolate actuator faults. Here, fault detection (FD) is passive by invariant sets, while fault isolation (FI) is active by tubes. Using the constraint-handling ability of MPC controllers, an active FI approach is implemented. A numerical example illustrates the effectiveness of the proposed approach.Postprint (author’s final draft

Zonotopic fault detection observer design for Takagi–Sugeno fuzzy systems

This paper considers zonotopic fault detection observer design in the finite-frequency domain for discrete-time Takagi–Sugeno fuzzy systems with unknown but bounded disturbances and measurement noise. We present a novel fault detection observer structure, which is more general than the commonly used Luenberger form. To make the generated residual sensitive to faults and robust against disturbances, we develop a finite-frequency fault detection observer based on generalised Kalman–Yakubovich–Popov lemma and P-radius criterion. The design conditions are expressed in terms of linear matrix inequalities. The major merit of the proposed method is that residual evaluation can be easily implemented via zonotopic approach. Numerical examples are conducted to demonstrate the proposed methodPeer ReviewedPostprint (author's final draft

Self-Triggered and Event-Triggered Set-Valued Observers

This paper addresses the problem of reducing the required network load and computational power for the implementation of Set-Valued Observers (SVOs) in Networked Control System (NCS). Event- and self-triggered strategies for NCS, modeled as discrete-time Linear Parameter-Varying (LPV) systems, are studied by showing how the triggering condition can be selected. The methodology provided can be applied to determine when it is required to perform a full (``classical'') computation of the SVOs, while providing low-complexity state overbounds for the remaining time, at the expenses of temporarily reducing the estimation accuracy. As part of the procedure, an algorithm is provided to compute a suitable centrally symmetric polytope that allows to find hyper-parallelepiped and ellipsoidal overbounds to the exact set-valued state estimates calculated by the SVOs. By construction, the proposed triggering techniques do not influence the convergence of the SVOs, as at some subsequent time instants, set-valued estimates are computed using the \emph{conventional} SVOs. Results are provided for the triggering frequency of the self-triggered strategy and two interesting cases: distributed systems when the dynamics of all nodes are equal up to a reordering of the matrix; and when the probability distribution of the parameters influencing the dynamics is known. The performance of the proposed algorithm is demonstrated in simulation by using a time-sensitive example

Interval observer versus set-membership approaches for fault detection in uncertain systems using zonotopes

This paper presents both analysis and comparison of the interval observer–based and set-membership approaches for the state estimation and fault detection (FD) in uncertain linear systems. The considered approaches assume that both state disturbance and measurement noise are modeled in a deterministic context following the unknown but bounded approach. The propagation of uncertainty in the state estimation is bounded through a zonotopic set representation. Both approaches have been mathematically related and compared when used for state estimation and FD. A case study based on a two-tanks system is employed for showing the relationship between both approaches while comparing their performancePeer ReviewedPostprint (author's final draft