Shuang Yuan
Research Subjects
Shuang Yuan has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Xinsong Yang
College of Electronics and Information Engineering, Sichuan University, Chengdu, China
3 shared publications - Peng Shi
Adelaide University
2 shared publications - Guanghui Wen
School of Automation, Southeast University, Nanjing, China
1 shared publication Qihan Qi
College of Electronics and Information Engineering, Sichuan University, Chengdu, China
1 shared publication- Wei Xing Zheng
Western Sydney University
1 shared publication - Xingxing Ju
College of Electronics and Information Engineering, Sichuan University, Chengdu 610065, China
1 shared publication
Latest Publications
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (4) , 2833-2843
$H_{\infty }$ Pinning Synchronization of Switched Coupled Neural Networks With Attack Decomposition Technique: A Strictly Monotonic Decreasing LKF Approach
This paper investigates the $H_{\infty }$ pinning global exponential synchronization almost surely (GES a.s.) for switched coupled neural networks (SCNNs) with bounded time-varying delay under output injection attacks. By proposing attack decomposition technique (ADT), the output signal under injection attacks is split into attack-eliminated signal and attack-related signal. For reducing control costs and saving communication resources, the quantized pinning control (QPC) is designed to synchronize the SCNNs by using attack-eliminated signal. Moreover, the attack-related signal is also used to accurately estimate unknown cyber-attacks. A new discretized Lyapunov-Krasovskii functional (LKF) approach is designed to guarantee the value of LKF strictly monotonic decreasing no matter whether switching happened or not, which reduces the conservativeness of obtained results. To guarantee the $H_{\infty }$ pinning GES a.s. with minimal non-weighted $\mathcal {L}_{2}$-gain, sufficient conditions formulated by linear matrix inequalities (LMIs) are established. Finally, numerical example is provided to verify the effectiveness of theoretical analysis.
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (4) , 2833-2843
$H_{\infty }$ Pinning Synchronization of Switched Coupled Neural Networks With Attack Decomposition Technique: A Strictly Monotonic Decreasing LKF Approach
This paper investigates the $H_{\infty }$ pinning global exponential synchronization almost surely (GES a.s.) for switched coupled neural networks (SCNNs) with bounded time-varying delay under output injection attacks. By proposing attack decomposition technique (ADT), the output signal under injection attacks is split into attack-eliminated signal and attack-related signal. For reducing control costs and saving communication resources, the quantized pinning control (QPC) is designed to synchronize the SCNNs by using attack-eliminated signal. Moreover, the attack-related signal is also used to accurately estimate unknown cyber-attacks. A new discretized Lyapunov-Krasovskii functional (LKF) approach is designed to guarantee the value of LKF strictly monotonic decreasing no matter whether switching happened or not, which reduces the conservativeness of obtained results. To guarantee the $H_{\infty }$ pinning GES a.s. with minimal non-weighted $\mathcal {L}_{2}$-gain, sufficient conditions formulated by linear matrix inequalities (LMIs) are established. Finally, numerical example is provided to verify the effectiveness of theoretical analysis.
- 8 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (9) , 6482-6489
Positive Effect of Switching on Input-to-State Stability of Nonlinear Systems
This paper considers the input-to-state stability (ISS) problem of nonlinear switched systems under stochastic switching governed by both transition probability and stochastic dwell time. A novel analysis framework of ISS with respect to switched systems is proposed in the sense of Lyapunov. It is shown that the stochastic switching exhibits a positive effect on the ISS issue, and uniform ISS can be achieved even though all subsystems are non-ISS. In addition, the proposed Lyapunov results are applied to linear switched systems by using the linear matrix inequality method, and a novel dynamic feedback control strategy is designed to realize the input-to-state stabilization. Finally, two examples are presented to show the positive effect of stochastic switching and the capability of the proposed dynamic control strategy.
- 8 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (9) , 6482-6489
Positive Effect of Switching on Input-to-State Stability of Nonlinear Systems
This paper considers the input-to-state stability (ISS) problem of nonlinear switched systems under stochastic switching governed by both transition probability and stochastic dwell time. A novel analysis framework of ISS with respect to switched systems is proposed in the sense of Lyapunov. It is shown that the stochastic switching exhibits a positive effect on the ISS issue, and uniform ISS can be achieved even though all subsystems are non-ISS. In addition, the proposed Lyapunov results are applied to linear switched systems by using the linear matrix inequality method, and a novel dynamic feedback control strategy is designed to realize the input-to-state stabilization. Finally, two examples are presented to show the positive effect of stochastic switching and the capability of the proposed dynamic control strategy.
- 11 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (5) , 2171-2181
Fixed-Time Neurodynamic Optimization Algorithms and Application to Circuits Design
In this article, several fixed-time (FT) neurodynamic algorithms with time-varying coefficients are introduced for composite optimization problems. The remarkable features of neurodynamic algorithms are FT convergence from arbitrary initial conditions with faster convergence rate by choosing different time-varying coefficients. The FT convergence of neurodynamic algorithms can be proved by the Polyak- ${\L}$ ojasiewicz condition, which is beyond strong convexity condition. The upper bounds of the settling time for time-varying neurodynamic algorithms are explicitly given. The robustness of neurodynamic algorithms under bounded noises are further studied. In addition, the proposed neurodynamic algorithms are also utilized for dealing with absolute value equations and sparse signal reconstruction problems. The circuit framework for FT neurodynamic algorithms is subsequently introduced, and an example simulated in Multisim 14.3 is provided to verify the practicability of the proposed analog circuits. Numerical experiments on image recovery and sparse logistic regression are conducted to validate the superiority of the proposed algorithms.
- 11 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 71 (5) , 2171-2181
Fixed-Time Neurodynamic Optimization Algorithms and Application to Circuits Design
In this article, several fixed-time (FT) neurodynamic algorithms with time-varying coefficients are introduced for composite optimization problems. The remarkable features of neurodynamic algorithms are FT convergence from arbitrary initial conditions with faster convergence rate by choosing different time-varying coefficients. The FT convergence of neurodynamic algorithms can be proved by the Polyak- ${\L}$ ojasiewicz condition, which is beyond strong convexity condition. The upper bounds of the settling time for time-varying neurodynamic algorithms are explicitly given. The robustness of neurodynamic algorithms under bounded noises are further studied. In addition, the proposed neurodynamic algorithms are also utilized for dealing with absolute value equations and sparse signal reconstruction problems. The circuit framework for FT neurodynamic algorithms is subsequently introduced, and an example simulated in Multisim 14.3 is provided to verify the practicability of the proposed analog circuits. Numerical experiments on image recovery and sparse logistic regression are conducted to validate the superiority of the proposed algorithms.