Jun-Yi Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jun-Yi Li has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Yong Xu
Engineering Research Center of Low-Altitude Perception and Detection Technology & Intelligent IoT, Ministry of Education, School of Automation, Guangdong University of Technology, Guangzhou, China
17 shared publications - Renquan Lu
School of Automation, Guangdong University of Technology, Guangzhou, China
8 shared publications - Zidong Wang
Brunel University London
7 shared publications - Chang Liu
GuangdongHong Kong Joint Laboratory for Intelligent Decision and Cooperative Control, Guangdong Provincial Key Laboratory of Intelligent Decision and Cooperative Control, School of Automation, Guangdong University of Technology, Guangzhou, China
4 shared publications - Tingwen Huang
Shenzhen University of Advanced Technology
4 shared publications - Yuru Guo
Guangdong-Hong Kong Joint Laboratory for Intelligent Decision and Cooperative Control, Guangdong Provincial Key Laboratory of Intelligent Decision and Cooperative Control, School of Automation, Guangdong University of Technology, Guangzhou, China
4 shared publications
Latest Publications
- 7 November 2026
- Published by Elsevier in Neural Networks
- Vol. 206
Cluster synchronization control for time-varying coupled neural networks with actuator faults and bit rate constraints
- 7 November 2026
- Published by Elsevier in Neural Networks
- Vol. 206
Cluster synchronization control for time-varying coupled neural networks with actuator faults and bit rate constraints
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (11) , 7126-7138
Intermittent Asynchronous Impulsive Control for Quasi-Consensus of Heterogeneous Multiagent Systems: Time/Event-Triggered Mechanism
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (11) , 7126-7138
Intermittent Asynchronous Impulsive Control for Quasi-Consensus of Heterogeneous Multiagent Systems: Time/Event-Triggered Mechanism
- 12 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Cyber-Physical Systems
- Vol. 4, 25-33
Distributed Set-Membership Estimation Over Delayed and Attacked Sensor Networks
This work proposes a novel distributed set-membership estimation for the locally observable system state with random delays and false data injection (FDI) attacks. By reconstructing the delayed measurements, the random delay system becomes a delay free one. An ellipsoid based dynamic attack detection strategy with adjustable thresholds is established to detect FDI attacks. To reduce the computation load, the observability decomposition approach is used to obtain the observable substate of each node. Then the distributed estimator is designed to estimate the observable substates, and the unobservable ones are estimated by exchanging information with neighbor nodes. A sufficient condition is then obtained to derive the ellipsoid sets of the system state through iteration. Furthermore, an optimization method is used to reduce the estimation errors. Finally, the estimation performance is demonstrated through numerical simulations, which indicate the efficiency of the proposed method.
- 12 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Cyber-Physical Systems
- Vol. 4, 25-33
Distributed Set-Membership Estimation Over Delayed and Attacked Sensor Networks
This work proposes a novel distributed set-membership estimation for the locally observable system state with random delays and false data injection (FDI) attacks. By reconstructing the delayed measurements, the random delay system becomes a delay free one. An ellipsoid based dynamic attack detection strategy with adjustable thresholds is established to detect FDI attacks. To reduce the computation load, the observability decomposition approach is used to obtain the observable substate of each node. Then the distributed estimator is designed to estimate the observable substates, and the unobservable ones are estimated by exchanging information with neighbor nodes. A sufficient condition is then obtained to derive the ellipsoid sets of the system state through iteration. Furthermore, an optimization method is used to reduce the estimation errors. Finally, the estimation performance is demonstrated through numerical simulations, which indicate the efficiency of the proposed method.
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (1) , 527-537
Distributed Set-Membership Filtering Over Wireless Sensor Networks With Coding-Decoding Mechanism
This paper investigates the distributed set-membership filtering for a class of discrete systems over wireless sensor networks. A new type of coding-decoding method with mixed quantizer is proposed to balance the upper bound of decoding error and the communication burden. Then, a distributed filter is designed based on decoding measurements, and a recursive technique is utilized to ascertain sufficient conditions of the feasibility of the proposed filtering design. A fusion rule is further presented to achieve a more compact effective region by determining the intersection of the local estimation and prediction ellipsoids. A fusion estimate is then derived by addressing two optimization problems, which outperforms all local estimates. Finally, a simulation example is introduced to verify the effectiveness of the developed filtering algorithm.
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (1) , 527-537
Distributed Set-Membership Filtering Over Wireless Sensor Networks With Coding-Decoding Mechanism
This paper investigates the distributed set-membership filtering for a class of discrete systems over wireless sensor networks. A new type of coding-decoding method with mixed quantizer is proposed to balance the upper bound of decoding error and the communication burden. Then, a distributed filter is designed based on decoding measurements, and a recursive technique is utilized to ascertain sufficient conditions of the feasibility of the proposed filtering design. A fusion rule is further presented to achieve a more compact effective region by determining the intersection of the local estimation and prediction ellipsoids. A fusion estimate is then derived by addressing two optimization problems, which outperforms all local estimates. Finally, a simulation example is introduced to verify the effectiveness of the developed filtering algorithm.
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (3) , 1197-1209
An Impulsive Approach to State Estimation for Multirate Singularly Perturbed Complex Networks Under Bit Rate Constraints
In this article, the problem of ultimately bounded state estimation is investigated for discrete-time multirate singularly perturbed complex networks under the bit rate constraints, where the sensor sampling period is allowed to differ from the updating period of the networks. The facilitation of communication between sensors and the remote estimator through wireless networks, which are subject to bit rate constraints, involves the use of a coding–decoding mechanism. For efficient estimation in the presence of periodic measurements, a specialized impulsive estimation method is developed, which aims to carry out impulsive corrections precisely at the instants when the measurement signal is received by the estimator. By employing the iteration analysis method under the impulsive mechanism, a sufficient condition is established that ensures the exponential boundedness of the estimation error dynamics. Furthermore, an optimization algorithm is introduced for addressing the challenges related to bit rate allocation and the design of desired estimator gains. Within the presented theoretical framework, the correlation between estimation performance and bit rate allocation is elucidated. Finally, a simulation example is provided to demonstrate the validity of the proposed estimation approach.
- 20 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (3) , 1197-1209
An Impulsive Approach to State Estimation for Multirate Singularly Perturbed Complex Networks Under Bit Rate Constraints
In this article, the problem of ultimately bounded state estimation is investigated for discrete-time multirate singularly perturbed complex networks under the bit rate constraints, where the sensor sampling period is allowed to differ from the updating period of the networks. The facilitation of communication between sensors and the remote estimator through wireless networks, which are subject to bit rate constraints, involves the use of a coding–decoding mechanism. For efficient estimation in the presence of periodic measurements, a specialized impulsive estimation method is developed, which aims to carry out impulsive corrections precisely at the instants when the measurement signal is received by the estimator. By employing the iteration analysis method under the impulsive mechanism, a sufficient condition is established that ensures the exponential boundedness of the estimation error dynamics. Furthermore, an optimization algorithm is introduced for addressing the challenges related to bit rate allocation and the design of desired estimator gains. Within the presented theoretical framework, the correlation between estimation performance and bit rate allocation is elucidated. Finally, a simulation example is provided to demonstrate the validity of the proposed estimation approach.
- 2 January 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 192
Synchronization of complex dynamic networks with packet loss: A novel intermittent pinning impulsive control approach
- 2 January 2025
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 192
Synchronization of complex dynamic networks with packet loss: A novel intermittent pinning impulsive control approach
- 9 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 54 (12) , 7248-7260
Pinning Synchronization for Stochastic Complex Networks With Randomly Occurring Nonlinearities: Tackling Bit Rate Constraints and Allocations
In this article, the ultimately bounded synchronization problem is investigated for a class of discrete-time stochastic complex networks under the pinning control strategy. Communication between system nodes and the remote controller is facilitated via wireless networks subject to bit rate constraints. The system model is distinguished by the inclusion of randomly occurring nonlinearities. A coding–decoding transmission mechanism under constrained bit rates is introduced to characterize the digital transmission process. To achieve synchronization of the network nodes with the unforced target node, a pinning controller is specifically devised based on the information from partially selected nodes. Through the application of the stochastic analysis method, a sufficient condition is derived for ensuring the mean-square boundedness of the synchronization error system. In addition, an optimization algorithm is introduced to address bit rate allocation and the design of desired controller gains. Within the presented theoretical framework, the correlation between the mean-square synchronization performance and bit rate allocation is further elucidated. To conclude, a simulation example is provided to substantiate the efficacy of the recommended pinning control approach.
- 9 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 54 (12) , 7248-7260
Pinning Synchronization for Stochastic Complex Networks With Randomly Occurring Nonlinearities: Tackling Bit Rate Constraints and Allocations
In this article, the ultimately bounded synchronization problem is investigated for a class of discrete-time stochastic complex networks under the pinning control strategy. Communication between system nodes and the remote controller is facilitated via wireless networks subject to bit rate constraints. The system model is distinguished by the inclusion of randomly occurring nonlinearities. A coding–decoding transmission mechanism under constrained bit rates is introduced to characterize the digital transmission process. To achieve synchronization of the network nodes with the unforced target node, a pinning controller is specifically devised based on the information from partially selected nodes. Through the application of the stochastic analysis method, a sufficient condition is derived for ensuring the mean-square boundedness of the synchronization error system. In addition, an optimization algorithm is introduced to address bit rate allocation and the design of desired controller gains. Within the presented theoretical framework, the correlation between the mean-square synchronization performance and bit rate allocation is further elucidated. To conclude, a simulation example is provided to substantiate the efficacy of the recommended pinning control approach.
- 4 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 10450-10463
Nonfragile Impulsive State Estimation for Complex Networks With Markovian Switching Topologies Subject to Limited Bit Rate Constraints
In this article, we consider the impulsive estimation problem for a specific category of discrete-time complex networks (CNs) characterized by Markovian switching topologies. The measurement outputs of the underlying CNs, transmitted to the observer over wireless networks, are subject to bit rate constraints. To effectively reduce the estimation error and enhance estimation performance, a mode-dependent impulsive observer is proposed that employs the impulse mechanism. The application of stochastic analysis techniques leads to the derivation of a sufficient condition for ensuring the mean-square boundedness of the estimation error dynamics. The upper bound of the error is then analyzed by iteratively exploring the Lyapunov relation at both impulsive and non-impulsive instants. Moreover, an optimization algorithm is presented for handling the bit rate allocation, which is coupled with the design of desired observer gains using the linear matrix inequality (LMI) approach. Within this theoretical framework, the relationship between the mean-square estimation performance and the bit rate allocation protocol is further elucidated. Finally, a simulation example is provided to demonstrate the validity and effectiveness of the proposed impulsive estimation approach.
- 4 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (6) , 10450-10463
Nonfragile Impulsive State Estimation for Complex Networks With Markovian Switching Topologies Subject to Limited Bit Rate Constraints
In this article, we consider the impulsive estimation problem for a specific category of discrete-time complex networks (CNs) characterized by Markovian switching topologies. The measurement outputs of the underlying CNs, transmitted to the observer over wireless networks, are subject to bit rate constraints. To effectively reduce the estimation error and enhance estimation performance, a mode-dependent impulsive observer is proposed that employs the impulse mechanism. The application of stochastic analysis techniques leads to the derivation of a sufficient condition for ensuring the mean-square boundedness of the estimation error dynamics. The upper bound of the error is then analyzed by iteratively exploring the Lyapunov relation at both impulsive and non-impulsive instants. Moreover, an optimization algorithm is presented for handling the bit rate allocation, which is coupled with the design of desired observer gains using the linear matrix inequality (LMI) approach. Within this theoretical framework, the relationship between the mean-square estimation performance and the bit rate allocation protocol is further elucidated. Finally, a simulation example is provided to demonstrate the validity and effectiveness of the proposed impulsive estimation approach.
- 9 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (11) , 13341-13351
Reinforcement Learning-Based Distributed Robust Bipartite Consensus Control for Multispacecraft Systems With Dynamic Uncertainties
In this article, the reinforcement learning-based distributed robust bipartite consensus control of multispacecraft systems with dynamic uncertainties is investigated. The developed control structure includes two parts, i.e., integral sliding mode control and distributed optimal bipartite consensus control. In the first step, an integral sliding mode controller is designed for each following spacecraft to address matched uncertainties such that the dynamics of nominal spacecraft is obtained. In the second step, a novel performance index function, which contains consensus errors and their derivatives, is designed for each nominal spacecraft. As a result, the system assumption of zero equilibrium and the discount factor in performance index function are not required, which simplifies the controller design process and improves the practicability of the developed control method. Moreover, in order to solve the coupled Hamilton–Jacobi–Bellman equation of each following spacecraft, a novel policy iteration algorithm is designed and its properties are analyzed. Finally, a group of spacecraft is employed to verify the effectiveness of the present control scheme.
- 9 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (11) , 13341-13351
Reinforcement Learning-Based Distributed Robust Bipartite Consensus Control for Multispacecraft Systems With Dynamic Uncertainties
In this article, the reinforcement learning-based distributed robust bipartite consensus control of multispacecraft systems with dynamic uncertainties is investigated. The developed control structure includes two parts, i.e., integral sliding mode control and distributed optimal bipartite consensus control. In the first step, an integral sliding mode controller is designed for each following spacecraft to address matched uncertainties such that the dynamics of nominal spacecraft is obtained. In the second step, a novel performance index function, which contains consensus errors and their derivatives, is designed for each nominal spacecraft. As a result, the system assumption of zero equilibrium and the discount factor in performance index function are not required, which simplifies the controller design process and improves the practicability of the developed control method. Moreover, in order to solve the coupled Hamilton–Jacobi–Bellman equation of each following spacecraft, a novel policy iteration algorithm is designed and its properties are analyzed. Finally, a group of spacecraft is employed to verify the effectiveness of the present control scheme.