Near-Optimal Resilient Control Strategy Design for State-Saturated Networked Systems Under Stochastic Communication Protocol

Output-Feedback Control for Fuzzy Singularly Perturbed Systems: A Nonhomogeneous Stochastic Communication Protocol Approach

In this study, the output-feedback control (OFC) strategy design problem is explored for a type of Takagi-Sugeno fuzzy singular perturbed system. To alleviate the communication load and improve the reliability of signal transmission, a novel stochastic communication protocol (SCP) is proposed. In particular, the SCP is scheduled based on a nonhomogeneous Markov chain, where the time-varying transition probability matrix is characterized by a polytope-structure-based set. Different from the existing homogeneous Markov SCP, a nonhomogeneous Markov SCP depicts the data transmission in a more reasonable manner. To detect the actual network mode, a hidden Markov process observer is addressed. By virtue of the hidden Markov model with partly unidentified detection probabilities, an asynchronous OFC law is formulated. By establishing a novel Lyapunov-Krasovskii functional with a singular perturbation parameter and a nonhomogeneous Markov process, a sufficient condition is exploited to guarantee the stochastic stability of the resulting system, and the solution for the asynchronous controller is portrayed. Eventually, the validity of the attained methodology is expressed through a practical example.

Input-to-State Stabilization of Stochastic Markovian Jump Systems Under Communication Constraints: Genetic Algorithm-Based Performance Optimization

This work investigates the stabilization problem of uncertain stochastic Markovian jump systems (MJSs) under communication constraints. To reduce the bandwidth usage, a discrete-time Markovian chain is employed to implement the stochastic communication protocol (SCP) scheduling of the sensor nodes, by which only one sensor node is chosen to access the network at each transmission instant. Moreover, due to the effect of amplitude attenuation, time delay, and random interference/noise, the transmission may be inevitably subject to the Rice fading phenomenon. All of these constraints make the controller only receive the fading signal from one activated sensor node at each instant. A merge approach is first used to deal with two Markovian chains; meanwhile, a compensator is designed to provide available information for the controller. By a compensator and mode-based sliding-mode controller, the resulting closed-loop system is ensured to be input-to-state stable in probability (ISSiP), and the quasisliding mode is attained. Moreover, an iteration optimizing algorithm is provided to reduce the convergence domain around the sliding surface via searching a desirable sliding gain, which constitutes an effective GA-based sliding-mode control strategy. Finally, the proposed control scheme is verified via the simulation results.

A Novel Resilient Control Scheme for a Class of Markovian Jump Systems With Partially Unknown Information

In the complex practical engineering systems, many interferences and attacking signals are inevitable in industrial applications. This article investigates the reinforcement learning (RL)-based resilient control algorithm for a class of Markovion jump systems with completely unknown transition probability information. Based on the Takagi-Sugeno logical structure, the resilient control problem of the nonlinear Markovion systems is converted into solving a set of local dynamic games, where the control policy and attacking signal are considered as two rival players. Combining the potential learning and forecasting abilities, the new integral RL (IRL) algorithm is designed via system data to compute the zero-sum games without using the information of stationary transition probability. Besides, the matrices of system dynamics can also be partially unknown, and the new architecture requires less transmission and computation during the learning process. The stochastic stability of the system dynamics under the developed overall resilient control is guaranteed based on the Lyapunov theory. Finally, the designed IRL-based resilient control is applied to a typical multimode robot arm system, and implementing results demonstrate the practicality and effectiveness.

Recursive State Estimation for Networked Multirate Multisensor Systems With Distributed Time-Delays Under Round-Robin Protocol

This article is concerned with the problem of recursive state estimation for a class of multirate multisensor systems with distributed time delays under the round-robin (R-R) protocol. The state updating period of the system and the sampling period of the sensors are allowed to be different so as to reflect the engineering practice. An iterative method is presented to transform the multirate system into a single-rate one, thereby facilitating the system analysis. The R-R protocol is introduced to determine the transmission sequence of sensors with the aim to alleviate undesirable data collisions. Under the R-R protocol scheduling, only one sensor can get access to transmit its measurement at each sampling time instant. The main purpose of this article is to develop a recursive state estimation scheme such that an upper bound on the estimation error covariance is guaranteed and then locally minimized through adequately designing the estimator parameter. Finally, simulation examples are provided to show the effectiveness of the proposed estimator design scheme.

Adaptive Resilient Event-Triggered Control Design of Autonomous Vehicles With an Iterative Single Critic Learning Framework

This article investigates the adaptive resilient event-triggered control for rear-wheel-drive autonomous (RWDA) vehicles based on an iterative single critic learning framework, which can effectively balance the frequency/changes in adjusting the vehicle's control during the running process. According to the kinematic equation of RWDA vehicles and the desired trajectory, the tracking error system during the autonomous driving process is first built, where the denial-of-service (DoS) attacking signals are injected into the networked communication and transmission. Combining the event-triggered sampling mechanism and iterative single critic learning framework, a new event-triggered condition is developed for the adaptive resilient control algorithm, and the novel utility function design is considered for driving the autonomous vehicle, where the control input can be guaranteed into an applicable saturated bound. Finally, we apply the new adaptive resilient control scheme to a case of driving the RWDA vehicles, and the simulation results illustrate the effectiveness and practicality successfully.

Fault-Tolerant Optimal Control for Discrete-Time Nonlinear System Subjected to Input Saturation: A Dynamic Event-Triggered Approach

This paper investigates the dynamic event-triggered fault-tolerant optimal control strategy for a class of output feedback nonlinear discrete-time systems subject to actuator faults and input saturations. To save the communication resources between the sensor and the controller, the so-called dynamic event-triggered mechanism is adopted to schedule the measurement signal. A neural network-based observer is first designed to provide both the system states and fault information. Then, with consideration of the actuator saturation phenomenon, the adaptive dynamic programming (ADP) algorithm is designed based on the estimates provided by the observer. To reduce the computational burden, the optimal control strategy is implemented via the single network adaptive critic architecture. The sufficient conditions are provided to guarantee the boundedness of the overall closed-loop systems. Finally, the numerical simulations on a two-link flexible manipulator system are provided to verify the validity of the proposed control strategy.

An Event-Triggering Approach to Recursive Filtering for Complex Networks With State Saturations and Random Coupling Strengths

In this article, the recursive filtering problem is investigated for a class of time-varying complex networks with state saturations and random coupling strengths under an event-triggering transmission mechanism. The coupled strengths among nodes are characterized by a set of random variables obeying the uniform distribution. The event-triggering scheme is employed to mitigate the network data transmission burden. The purpose of the problem addressed is to design a recursive filter such that in the presence of the state saturations, event-triggering communication mechanism, and random coupling strengths, certain locally optimized upper bound is guaranteed on the filtering error covariance. By using the stochastic analysis technique, an upper bound on the filtering error covariance is first derived via the solution to a set of matrix difference equations. Next, the obtained upper bound is minimized by properly parameterizing the filter parameters. Subsequently, the boundedness issue of the filtering error covariance is studied. Finally, two numerical simulation examples are provided to illustrate the effectiveness of the proposed algorithm.

State-Saturated Recursive Filter Design for Stochastic Time-Varying Nonlinear Complex Networks Under Deception Attacks

This article tackles the recursive filtering problem for a class of stochastic nonlinear time-varying complex networks (CNs) suffering from both the state saturations and the deception attacks. The nonlinear inner coupling and the state saturations are taken into account to characterize the nonlinear nature of CNs. From the defender's perspective, the randomly occurring deception attack is governed by a set of Bernoulli binary distributed white sequence with a given probability. The objective of the addressed problem is to design a state-saturated recursive filter such that, in the simultaneous presence of the state saturations and the randomly occurring deception attacks, a certain upper bound is guaranteed on the filtering error covariance, and such an upper bound is then minimized at each time instant. By employing the induction method, an upper bound on the filtering error variance is first constructed in terms of the solutions to a set of matrix difference equations. Subsequently, the filter parameters are appropriately designed to minimize such an upper bound. Finally, a numerical simulation example is provided to demonstrate the feasibility and usefulness of the proposed filtering scheme.

Distributed State-Saturated Recursive Filtering Over Sensor Networks Under Round-Robin Protocol

This article is concerned with the distributed recursive filtering issue for stochastic discrete time-varying systems subjected to both state saturations and round-robin (RR) protocols over sensor networks. The phenomenon of state saturation is considered to better describe practical engineering. The RR protocol is introduced to mitigate a network burden by determining which component of the sensor node has access to the network at each transmission instant. The purpose of the issue under consideration is to construct a distributed recursive filter such that a certain filtering error covariance's upper bound can be found and the corresponding filter parameters' explicit expression is given with both state saturations and RR protocols. By taking advantage of matrix difference equations, a filtering error covariance's upper bound can be presented and then be minimized by appropriately designing filter parameters. In particular, by using a matrix simplification technique, the sensor network topology's sparseness issue can be tackled. Finally, the feasibility for the addressed filtering scheme is demonstrated by an example.

Event-Triggered Recursive Filtering for Shift-Varying Linear Repetitive Processes

This paper addresses the recursive filtering problem for shift-varying linear repetitive processes (LRPs) with limited network resources. To reduce the resource occupancy, a novel event-triggered strategy is proposed where the concern is to broadcast those necessary measurements to update the innovation information only when certain events appear. The primary goal of this paper is to design a recursive filter rendering that, under the event-triggered communication mechanism, an upper bound (UB) on the filtering error variance is ensured and then optimized by properly determining the filter gains. As a distinct kind of 2-D systems, the LRPs are cast into a general Fornasini-Marchesini model by using the lifting technique. A new definition of the triggering-shift sequence is introduced and an event-triggered rule is then constructed for the transformed system. With the aid of mathematical induction, the filtering error variance is guaranteed to have a UB which is subsequently optimized with appropriate filter parameters via solving two series of Riccati-like difference equations. Theoretical analysis further reveals the monotonicity of the filtering performance with regard to the event-triggering threshold. Finally, an illustrative simulation is given to show the feasibility of the designed filtering scheme.

Observer-Based Consensus Control for Discrete-Time Multiagent Systems With Coding-Decoding Communication Protocol

In this paper, the consensus control problem is investigated for a class of discrete-time networked multiagent systems (MASs) with the coding-decoding communication protocol (CDCP). Under a directed communication topology, an observer-based control scheme is proposed for each agent by utilizing the relative measurement outputs between the agent itself and its neighboring ones. The signal delivery is in a digital manner, which means that only the sequence of finite coded signals is sent from the observer to the controller. To be specific, the observed data is encoded to certain codewords by a designed coder via the CDCP, and the received codewords are then decoded by the corresponding decoder at the controller side. The purpose of the addressed problem is to design an observer-based controller such that the close-loop MAS achieves the expected consensus performance. First, with the help of the input-to-state stability theory, a theoretical framework for the detectability is established for analyzing and designing the CDCP. Then, under such a communication protocol, some sufficient conditions for the existence of the proposed observer-based controller are derived to guarantee the asymptotic consensus of the MASs. In addition, the controller parameter is explicitly determined in terms of the solution to certain matrix inequalities associated with the information of the communication topology. Finally, a simulation example is given to demonstrate the effectiveness of the developed control strategy.

Near-Nash Equilibrium Control Strategy for Discrete-Time Nonlinear Systems With Round-Robin Protocol

In this paper, the near-Nash equilibrium (NE) control strategies are investigated for a class of discrete-time nonlinear systems subjected to the round-robin protocol (RRP). In the studied systems, three types of complexities, namely, the additive nonlinearities, the RRP, and the output feedback form of controllers, are simultaneously taken into consideration. To tackle these complexities, an approximate dynamic programing (ADP) algorithm is first developed for NE control strategies by solving the coupled Bellman's equation. Then, a Luenberger-type observer is designed under the RRP scheduling to estimate the system states. The near-NE control strategies are implemented via the actor-critic neural networks. More importantly, the stability analysis of the closed-loop system is conducted to guarantee that the studied system with the proposed control strategies is bounded stable. Finally, simulation results are provided to demonstrate the validity of the proposed method.