8 January 2019 in IEEE Transactions on Cybernetics
In this paper, the distributed set-membership filtering problem is dealt with for a class of time-varying multirate systems in sensor networks with the communication protocol. For relieving the communication burden, the round-Robin (RR) protocol is exploited to orchestrate the transmission order, under which each sensor node only broadcasts partial information to both the corresponding local filter and its neighboring nodes. In order to meet the practical transmission requirements as well as reduce communication cost, the multirate strategy is proposed to govern the sampling/update rate of the plant, the sensors, and the filters. By means of the lifting technique, the augmented filtering error system is established with a unified sampling rate. The main purpose of the addressed filtering problem is to design a set of distributed filters such that, in the simultaneous presence of the RR transmission protocol, the multirate mechanism, and the bounded noises, there exists a certain ellipsoid that includes all possible error states at each time instant. Then, the desired distributed filter gains are obtained by minimizing such an ellipsoid in the sense of the minimum trace of the weighted matrix. The proposed resource-efficient filtering algorithm is of a recursive form, thereby facilitating the online implementation. A numerical simulation example is given to demonstrate the effectiveness of the proposed protocol-based distributed filter design method.
19 July 2019 in IEEE Transactions on Automatic Control
In this paper, the unscented Kalman filtering (UKF) problem is investigated for a class of general nonlinear systems with stochastic uncertainties under communication protocols. A modified unscented transformation is put forward to account for stochastic uncertainties caused by modeling errors. For preventing data collisions and mitigating communication burden, the round-robin protocol and the weighted try-once-discard protocol are, respectively, introduced to regulate the data transmission order from sensors to the filter. Then, by employing two kinds of data-holding strategies (i.e., zero-order holder and zero input) for those nodes without transmission privilege, two novel protocol-based measurement models are formulated. Subsequently, by resorting to the sigma point approximation method, two resource-saving UKF algorithms are developed, where the impact from the underlying protocols on the filter design is explicitly quantified. Finally, compared with the protocol-based extended Kalman filtering algorithms, a simulation example is presented to demonstrate the effectiveness of the proposed protocol-based UKF algorithms.
2 April 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
In this article, recursive filtering is investigated for time-varying discrete sequential systems (DSSs) under weighted try-once-discard (WTOD) protocols, which are employed to govern the access authorization of a shared network in order to remit the communication burden. A transmission model, dependent on a Bernoulli distributed white sequence, is developed to describe the phenomenon of deception attacks. In light of the adopted protocol and the attack model, a recursive algorithm with the form of Riccati-like difference equations is developed to optimize the filtering performance in the mean square sense. Furthermore, by resorting to the mathematical induction, the convergence of the proposed recursive algorithm is discussed profoundly. Finally, a simulation example is presented to verify the availability of the designed recursive filter.
14 April 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
In this article, we investigate the set-membership state estimation problem for a class of time-varying systems with non-Gaussian noises over a FlexRay network. To mitigate the communication load and improve the flexibility of the data scheduling, the FlexRay protocol (FRP) governed by both the time-triggered and event-triggered rules is exploited to regulate the signal transmission in a cyclic fashion. A new expression of the input signal to the state estimator is formulated with intention to account for the effect of the FRP. Accordingly, a multirate model (orchestrating the sampling/updating rates of the target plant, sensors, and state estimator) is proposed and then transformed into a single-rate one with the help of the lifting technique and the vector augmentation method. Subsequently, sufficient conditions are provided for the true states to always reside in an ellipsoid at each time instant in the presence of the non-Gaussian noises, and such an ellipsoid is then minimized in the matrix-trace sense. An online optimization algorithm is developed to parameterize the estimator gains by means of the solution to certain recursive matrix inequalities. Numerical results demonstrate the validity of the proposed protocol-based set-membership state estimator design scheme.
12 March 2020 in IEEE Transactions on Control of Network Systems
In this article, a distributed method based on set-membership filtering is developed to solve the fault detection problem over sensor networks, where each sensor consists of multiple sensing units. In order to prevent data collisions and reduce the energy cost, the weighted try-once-discard (WTOD) scheduling, which allows only a sensor unit to send its measurement data at each transmission instant, is considered to govern the disseminated information between the sensor units and a filter. The aim of the presented problem is to propose a novel fault detection method to determine whether there exist faults in discrete time-varying networked systems. To this end, in the presence of the WTOD protocol, two ellipsoids are obtained, which include all possible prediction states and measurement updated states. Then, the sensor fault occurs when there is no intersection between the prediction set and the update set. Furthermore, two recursive optimization methods are scheduled to look for minimal ellipsoids in order to improve fault detection performance. At last, the effectiveness and the applicability of our proposed fault detection method are demonstrated via a practical example.
21 August 2018 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
This paper is concerned with the N-step model predictive control (MPC) problem for a class of constrained systems with persistent bounded disturbances under the stochastic communication protocol (SCP). The control signals are transmitted to the plant via a shared network subject to a prescribed SCP for the purpose of avoiding data collisions. The SCP scheduling, which is governed by a Markov chain, is applied to orchestrate the transmission order of the controller nodes. Under the SCP, only one control node is allowed to update the control signal sent to the plant at each communication instant. Our aim is to design a set of desired controllers in the framework of N-step MPC such that the mean-square input-to-state stability of the closed-loop system is guaranteed. An optimization algorithm consisting of both off-line and online parts is developed to cope with the design problem of the N-step controller. Finally, a numerical example is utilized to illustrate the validity of the proposed N-step MPC strategy.