Publication | Closed Access
Composite Antidisturbance Control for Hidden Markov Jump Systems With Multi-Sensor Against Replay Attacks
169
Citations
26
References
2023
Year
Disturbance ObserverStochastic Hybrid SystemEngineeringHidden Markov ModelRobust ControlStochastic ProcessesMarkov KernelComposite Antidisturbance ControlSystems EngineeringComplex SystemsResilient Control SystemComputer ScienceHidden StateStochastic ControlAsynchronous SystemsMarkov Decision Process
This article discusses the problem of composite <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {H}_{\infty }$</tex-math></inline-formula> control for hidden Markov jump systems subject to replay attacks. Since it is difficult to obtain the mode information of the system directly in practice, a hidden Markov model is adopted to facilitate subsequent works. The hidden state represents the actual system dynamics that cannot be known exactly, but can be observed by the detector. Considering the multi-disturbance phenomenon, one of which is norm bounded and another is produced by an exogenous system, a composite <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {H}_{\infty }$</tex-math></inline-formula> control scheme based on disturbance observer is designed to improve the antidisturbance ability of the system. In addition, with the help of multi-sensor approach, a detection scheme, revealing the attacker's tactics and determining which sensor is assaulted, is presented to withstand replay attacks. Then, a composite disturbance observer-based controller, ensuring that the resulting system is stochastically stable with an expected <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$\mathcal {H}_{\infty }$</tex-math></inline-formula> performance under replay attacks, is designed by solving convex optimization problems. Finally, the effectiveness and superiority of the developed method are verified by an example.
| Year | Citations | |
|---|---|---|
Page 1
Page 1