Add like
Add dislike
Add to saved papers

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

In this paper, the near-optimal resilient control strategy design problem is investigated for a class of discrete time-varying system in simultaneous presence of stochastic communication protocols (SCPs), gain perturbations, state saturations, and additive nonlinearities. In the sensor-to-controller network, only one sensor is permitted to get access to the communication media so as to avoid possible data collisions. Described by a Markov chain, the SCP is employed to determine which sensor should obtain the access to the network at a certain time. Furthermore, two kinds of well-recognized complexities (i.e., state saturations and additive nonlinearities) are considered in the system model and the phenomenon of controller gain perturbation is also taken into special consideration. Accordingly, the resilient control strategy is designed by: 1) deriving a certain upper bound on the associate cost function of underlying systems and 2) minimizing such an upper bound through the utilization of the completing-the-square technique and the Moore-Penrose pseudo inverse. The resilient control strategy is obtained in an iterative manner by solving a set of coupled backward Riccati-like recursions. Furthermore, based on the proposed control strategies, the infinite horizon case is considered and the corresponding upper bound of the cost function is explicitly provided. Finally, numerical simulations are carried out on power systems in order to verify the validity of the proposed resilient control algorithms.

Full text links

We have located links that may give you full text access.
Can't access the paper?
Try logging in through your university/institutional subscription. For a smoother one-click institutional access experience, please use our mobile app.

Related Resources

For the best experience, use the Read mobile app

Mobile app image

Get seemless 1-tap access through your institution/university

For the best experience, use the Read mobile app

All material on this website is protected by copyright, Copyright © 1994-2024 by WebMD LLC.
This website also contains material copyrighted by 3rd parties.

By using this service, you agree to our terms of use and privacy policy.

Your Privacy Choices Toggle icon

You can now claim free CME credits for this literature searchClaim now

Get seemless 1-tap access through your institution/university

For the best experience, use the Read mobile app