1
|
Zou L, Wang Z, Dong H, Yi X, Han QL. Recursive Filtering Under Probabilistic Encoding-Decoding Schemes: Handling Randomly Occurring Measurement Outliers. IEEE TRANSACTIONS ON CYBERNETICS 2024; 54:3378-3391. [PMID: 37021986 DOI: 10.1109/tcyb.2023.3234452] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/19/2023]
Abstract
This article focuses on the recursive filtering problem for networked time-varying systems with randomly occurring measurement outliers (ROMOs), where the so-called ROMOs denote a set of large-amplitude perturbations on measurements. A new model is presented to describe the dynamical behaviors of ROMOs by using a set of independent and identically distributed stochastic scalars. A probabilistic encoding-decoding scheme is exploited to convert the measurement signal into the digital format. For the purpose of preserving the filtering process from the performance degradation induced by measurement outliers, a novel recursive filtering algorithm is developed by using the active detection-based method where the "problematic" measurements (i.e., the measurements contaminated by outliers) are removed from the filtering process. A recursive calculation approach is proposed to derive the time-varying filter parameter via minimizing such the upper bound on the filtering error covariance. The uniform boundedness of the resultant time-varying upper bound is analyzed for the filtering error covariance by using the stochastic analysis technique. Two numerical examples are presented to verify the effectiveness and correctness of our developed filter design approach.
Collapse
|
2
|
Wen J, Shi P, Li R, Luan X. Distributed Filtering for Semi-Markov-Type Sensor Networks With Hybrid Sojourn-Time Distributions-A Nonmonotonic Approach. IEEE TRANSACTIONS ON CYBERNETICS 2023; 53:3075-3088. [PMID: 35298390 DOI: 10.1109/tcyb.2022.3152859] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/14/2023]
Abstract
This article examines the distributed filtering problem for a general class of filtering systems consisting of distributed time-delayed plant and filtering networks with semi-Markov-type topology switching (SMTTS). The SMTTS implies the topology sojourn time can be a hybrid function of different types of probabilistic distributions, typically, binomial distribution used to model unreliable communication links between the filtering nodes and Weibull distribution employed to depict the cumulative abrasion failure. First, by properly constructing a sojourn-time-dependent Lyapunov-Krasovski function (STDLKF), both time-varying topology-dependent filter and topology-dependent filter are designed. Second, a novel nonmonotonic approach with less design conservatism is developed by relaxing the monotonic requirement of STDLKF within each topology sojourn time. Moreover, an algorithm with less computational effort is proposed to generate a semi-Markov chain from a given Markov renewal chain. Simulation examples, including a microgrid islanded system, are presented to testify the generality and elucidate the practical potential of the nonmonotonic approach.
Collapse
|
3
|
Liu C, Wang Z, Lu R, Huang T, Xu Y. Finite-Time Estimation for Markovian BAM Neural Networks With Asymmetrical Mode-Dependent Delays and Inconstant Measurements. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2023; 34:344-354. [PMID: 34270434 DOI: 10.1109/tnnls.2021.3094551] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
The issue of finite-time state estimation is studied for discrete-time Markovian bidirectional associative memory neural networks. The asymmetrical system mode-dependent (SMD) time-varying delays (TVDs) are considered, which means that the interval of TVDs is SMD. Because the sensors are inevitably influenced by the measurement environments and indirectly influenced by the system mode, a Markov chain, whose transition probability matrix is SMD, is used to describe the inconstant measurement. A nonfragile estimator is designed to improve the robustness of the estimator. The stochastically finite-time bounded stability is guaranteed under certain conditions. Finally, an example is used to clarify the effectiveness of the state estimation.
Collapse
|
4
|
Xu H, Wang J, Wang B, Brahmia I. Distributed Observer Design for Linear Systems to Achieve Omniscience Asymptotically Under Jointly Connected Switching Networks. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:13383-13394. [PMID: 34793317 DOI: 10.1109/tcyb.2021.3125675] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/13/2023]
Abstract
The distributed observer problem is motivated by the case where the output information of the system is decentralized in different subsystems. In this scene, all the subsystems form an observer network, and each of them has access to only a part of output information and the information exchanged via the given communication networks. Due to the limitation of communication conditions among subsystems, the communication network is often time varying and disconnected. However, the existing research about the aforementioned scene is still not enough to solve this problem. To this end, this article is concerned with the challenge of the distributed observer design for linear systems under time-variant disconnected communication networks. The design method is successfully established by fixing both completely decentralized output information and incompletely decentralized output information into account. Our work overcomes the limitation of the existing results that the distributed observer can only reconstruct the full states of the underlying systems by means of fast switching. In the case of completely decentralized output information, a group of sufficient conditions is put forward for the system matrix, and it is proved that the asymptotical omniscience of the distributed observer could be achieved as long as anyone of the developed conditions is satisfied. Furthermore, unlike similar problems in multiagent systems, the systems that can meet the proposed conditions are not only stable and marginally stable systems but also some unstable systems. As for the case where the output information is not completely decentralized, the results show with the observable decomposition and states reorganization technology that the distributed observer could achieve omniscience asymptotically without any constraints on the system matrix. The validity of the proposed design method is emphasized in two numerical simulations.
Collapse
|
5
|
Zou L, Wang Z, Dong H, Han QL. Energy-to-Peak State Estimation With Intermittent Measurement Outliers: The Single-Output Case. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:11504-11515. [PMID: 33750719 DOI: 10.1109/tcyb.2021.3057545] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
This article is concerned with the energy-to-peak state estimation problem for a class of linear discrete-time systems with energy-bounded noises and intermittent measurement outliers (IMOs). In order to capture the intermittent nature, two sequences of step functions are introduced to model the occurrence of the IMOs. Furthermore, two special indices (i.e., minimum and maximum interval lengths) are adopted to describe the "occurrence frequency" of IMOs. Different from the considered energy-bounded noises, the outliers are assumed to have their magnitudes larger than certain thresholds. In order to achieve a satisfactory performance constraint on the energy-to-peak state estimation under the addressed kind of measurement outliers, a novel parameter-dependent (PD) state estimation strategy is developed to guarantee that the measurements contaminated by outliers would be removed in the estimation process. The proposed PD state estimation method is essentially a two-step process, where the first step is to examine the appearing and disappearing moments for each IMO by using a dedicatedly constructed outlier detection scheme, and the second step is to implement the state estimation task according to the outlier detection results. Sufficient conditions are obtained to ensure the existence of the desired estimator, and the gain matrix of the desired estimator is then derived by solving a constrained optimization problem. Finally, a simulation example is presented to illustrate the effectiveness of our developed PD state estimation strategy.
Collapse
|
6
|
Liu Y, Yang GH. Resilient Event-Triggered Distributed State Estimation for Nonlinear Systems Against DoS Attacks. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:9076-9089. [PMID: 33635811 DOI: 10.1109/tcyb.2021.3051963] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
This article investigates the resilient event-triggered (ET) distributed state estimation problem for nonlinear systems under denial-of-service (DoS) attacks. Different from the existing results mainly considering linear or specified nonlinear systems, more general nonlinear systems are considered in this study. Moreover, the considered DoS attacks are able to compromise different communication links among estimators independently. In this context, by resorting to the techniques of incremental homogeneity, a nonlinear ET distributed estimation scheme is designed to estimate the states and regulate the data transmission. Under this scheme, the resilient state estimation is achieved by employing a multimode switching estimator, and the problem of efficiency loss of the ET mechanism caused by DoS attacks is solved by designing a dynamic trigger threshold with switched update laws. Then, based on the decay rates of the Lyapunov function corresponding to different communication modes, sufficient conditions are given to guarantee the stability of the estimation error system under DoS attacks. Finally, simulation results are provided to verify the effectiveness of the proposed method.
Collapse
|
7
|
Wang Y, Xiong J, Ho DWC. Distributed LMMSE Estimation for Large-Scale Systems Based on Local Information. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:8528-8536. [PMID: 33760746 DOI: 10.1109/tcyb.2021.3057769] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
This article studies the distributed linear minimum mean square error (LMMSE) estimation problem for large-scale systems with local information (LSLI). Large-scale systems are composed of numerous subsystems. Each subsystem only transmits information to its neighbors. Thus, only the local information is available to each subsystem. This implies that the information available to different subsystems is different. Using local information to design an LMMSE estimator, the gains of the estimator must satisfy the sparse structure constraint, which makes the estimator design challenging and complicates the boundedness analysis of the estimation error covariance (EEC). In this article, a framework of the distributed LMMSE estimation for LSLI is established. The gains of the LMMSE estimator are effectively constructed by solving linear matrix equations. A gradient descent algorithm is exploited to design the gains of the LMMSE estimator numerically. Sufficient conditions are derived to ensure the boundedness of the EEC. Also, a gradient-based search algorithm is developed to verify whether the sufficient conditions hold or not. Finally, an example is used to illustrate the effectiveness of the proposed results.
Collapse
|
8
|
Gu Z, Ahn CK, Yue D, Xie X. Event-Triggered H ∞ Filtering for T-S Fuzzy-Model-Based Nonlinear Networked Systems With Multisensors Against DoS Attacks. IEEE TRANSACTIONS ON CYBERNETICS 2022; 52:5311-5321. [PMID: 33151891 DOI: 10.1109/tcyb.2020.3030028] [Citation(s) in RCA: 6] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
This article focuses on the problem of resilient H∞ filtering for Takagi-Sugeno fuzzy-model-based nonlinear networked systems with multisensors. A weighted fusion approach is adopted before information from multisensors is transmitted over the network. A novel event-triggered mechanism is proposed, which allows us not only to reduce the data-releasing rate but also to prevent abnormal data being potentially transmitted over the network due to sensor measurement or other practical factors. The problem of denial-of-service (DoS) attacks, which often occurs in a communication network, is also considered, where the DoS attack model is based on an assumption that the periodic attack includes active periods and sleeping periods. By employing the idea of the switching model for filtering error systems to deal with DoS attacks, sufficient conditions are derived to guarantee that the filtering error system is exponentially stable. Simulation results are given to demonstrate the effectiveness of the theoretical analysis and design method.
Collapse
|
9
|
Electric vehicle charging station planning with dynamic prediction of elastic charging demand: a hybrid particle swarm optimization algorithm. COMPLEX INTELL SYST 2022. [DOI: 10.1007/s40747-021-00575-8] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/19/2022]
Abstract
AbstractThis paper is concerned with the electric vehicle (EV) charging station planning problem based on the dynamic charging demand. Considering the dynamic charging behavior of EV users, a dynamic prediction method of EV charging demand is proposed by analyzing EV users’ travel law via the trip chain approach. In addition, a multi-objective charging station planing problem is formulated to achieve three objectives: (1) maximize the captured charging demands; (2) minimize the total cost of electricity and the time consumed for charging; and (3) minimize the load variance of the power grid. To solve such a problem, a novel method is proposed by combining the hybrid particle swarm optimization (HPSO) algorithm with the entropy-based technique for order preference by similarity to ideal solution (ETOPSIS) method. Specifically, the HPSO algorithm is used to obtain the Pareto solutions, and the ETOPSIS method is employed to determine the optimal scheme. Based on the proposed method, the siting and sizing of the EV charging station can be planned in an optimal way. Finally, the effectiveness of the proposed method is verified via the case study based on a test system composed of an IEEE 33-node distribution system and a 33-node traffic network system.
Collapse
|
10
|
Fuzzy matching algorithm of network information retrieval based on discrete mathematics. APPLIED NANOSCIENCE 2022. [DOI: 10.1007/s13204-021-02190-y] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/26/2022]
|
11
|
Shen Y, Wang Z, Shen B, Dong H. Outlier-Resistant Recursive Filtering for Multisensor Multirate Networked Systems Under Weighted Try-Once-Discard Protocol. IEEE TRANSACTIONS ON CYBERNETICS 2021; 51:4897-4908. [PMID: 33001816 DOI: 10.1109/tcyb.2020.3021194] [Citation(s) in RCA: 7] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
In this article, a new outlier-resistant recursive filtering problem (RF) is studied for a class of multisensor multirate networked systems under the weighted try-once-discard (WTOD) protocol. The sensors are sampled with a period that is different from the state updating period of the system. In order to lighten the communication burden and alleviate the network congestions, the WTOD protocol is implemented in the sensor-to-filter channel to schedule the order of the data transmission of the sensors. In the case of the measurement outliers, a saturation function is employed in the filter structure to constrain the innovations contaminated by the measurement outliers, thereby maintaining satisfactory filtering performance. By resorting to the solution to a matrix difference equation, an upper bound is first obtained on the covariance of the filtering error, and the gain matrix of the filter is then characterized to minimize the derived upper bound. Furthermore, the exponential boundedness of the filtering error dynamics is analyzed in the mean square sense. Finally, the usefulness of the proposed outlier-resistant RF scheme is verified by simulation examples.
Collapse
|
12
|
Song J, Wang Z, Niu Y, Dong H. Genetic-Algorithm-Assisted Sliding-Mode Control for Networked State-Saturated Systems Over Hidden Markov Fading Channels. IEEE TRANSACTIONS ON CYBERNETICS 2021; 51:3664-3675. [PMID: 32248142 DOI: 10.1109/tcyb.2020.2980109] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/11/2023]
Abstract
The sliding-mode control (SMC) problem is studied in this article for state-saturated systems over a class of time-varying fading channels. The underlying fading channels, whose channel fading amplitudes (characterized by the expectation and variance) are allowed to be different, are modeled as a finite-state Markov process. A key feature of the problem addressed is to use a hidden Markov mode detector to estimate the actual network mode. The novel model of hidden Markov fading channels (HMFCs) is shown to be more general yet practical than the existing fading channel models. Based on a linear sliding surface, a switching-type SMC law is dedicatedly constructed by just using the estimated network mode. By exploiting the concept of stochastic Lyapunov stability and the approach of hidden Markov models, sufficient conditions are obtained for the resultant SMC systems that ensure both the mean-square stability and the reachability with a sliding region. With the aid of the Hadamard product, a binary genetic algorithm (GA) is developed to solve the proposed SMC design problem subject to some nonconvex constraints induced by the state saturations and the fading channels, where the proposed GA is based on the objective function for optimal reachability. Finally, a numerical example is employed to verify the proposed GA-assisted SMC scheme over the HMFCs.
Collapse
|
13
|
Wu Q, Song Q, Hu B, Zhao Z, Liu Y, Alsaadi FE. Robust stability of uncertain fractional order singular systems with neutral and time-varying delays. Neurocomputing 2020. [DOI: 10.1016/j.neucom.2020.03.015] [Citation(s) in RCA: 10] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/25/2022]
|
14
|
Distributed Robust Filtering for Wireless Sensor Networks with Markov Switching Topologies and Deception Attacks. SENSORS 2020; 20:s20071948. [PMID: 32244323 PMCID: PMC7181283 DOI: 10.3390/s20071948] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.6] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 02/03/2020] [Revised: 03/16/2020] [Accepted: 03/29/2020] [Indexed: 11/24/2022]
Abstract
This paper is concerned with the distributed full- and reduced-order l2-l∞ state estimation issue for a class of discrete time-invariant systems subjected to both randomly occurring switching topologies and deception attacks over wireless sensor networks. Firstly, a switching topology model is proposed which uses homogeneous Markov chain to reflect the change of filtering networks communication modes. Then, the sector-bound deception attacks among the communication channels are taken into consideration, which could better characterize the filtering network communication security. Additionally, a random variable obeying the Bernoulli distribution is used to describe the phenomenon of the randomly occurring deception attacks. Furthermore, through an adjustable parameter E, we can obtain full- and reduced-order l2-l∞ state estimator over sensor networks, respectively. Sufficient conditions are established for the solvability of the addressed switching topology-dependent distributed filtering design in terms of certain convex optimization problem. The purpose of solving the problem is to design a distributed full- and reduced-order filter such that, in the presence of deception attacks, stochastic external interference and switching topologies, the resulting filtering dynamic system is exponentially mean-square stable with prescribed l2-l∞ performance index. Finally, a simulation example is provided to show the effectiveness and flexibility of the designed approach.
Collapse
|
15
|
Ge X, Han QL, Zhang XM, Ding L, Yang F. Distributed Event-Triggered Estimation Over Sensor Networks: A Survey. IEEE TRANSACTIONS ON CYBERNETICS 2020; 50:1306-1320. [PMID: 31199279 DOI: 10.1109/tcyb.2019.2917179] [Citation(s) in RCA: 112] [Impact Index Per Article: 22.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/09/2023]
Abstract
An event-triggered mechanism is of great efficiency in reducing unnecessary sensor samplings/transmissions and, thus, resource consumption such as sensor power and network bandwidth, which makes distributed event-triggered estimation a promising resource-aware solution for sensor network-based monitoring systems. This paper provides a survey of recent advances in distributed event-triggered estimation for dynamical systems operating over resource-constrained sensor networks. Local estimates of an unavailable state signal are calculated in a distributed and collaborative fashion based on only invoked sensor data. First, several fundamental issues associated with the design of distributed estimators are discussed in detail, such as estimator structures, communication constraints, and design methods. Second, an emphasis is laid on recent developments of distributed event-triggered estimation that has received considerable attention in the past few years. Then, the principle of an event-triggered mechanism is outlined and recent results in this subject are sorted out in accordance with different event-triggering conditions. Third, applications of distributed event-triggered estimation in practical sensor network-based monitoring systems including distributed grid-connected generation systems and target tracking systems are provided. Finally, several challenging issues worthy of further research are envisioned.
Collapse
|
16
|
Li Q, Wang Z, Sheng W, Alsaadi FE, Alsaadi FE. Dynamic event-triggered mechanism for H∞ non-fragile state estimation of complex networks under randomly occurring sensor saturations. Inf Sci (N Y) 2020. [DOI: 10.1016/j.ins.2019.08.063] [Citation(s) in RCA: 57] [Impact Index Per Article: 11.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/29/2022]
|