Zhian Jia
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
Research Subjects
Zhian Jia has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Zhi-Wei Liu
Huazhong University of Science and Technology
6 shared publications - Dongliang Cui
State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang, China
3 shared publications - Xuewu Dai
Department of Mathematics, Physics and Electrical Engineering, Northumbria University, Newcastle upon Tyne NE1 8ST, UK
3 shared publications - Jing-Zhe Xu
School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan, China
2 shared publications - Ming Chi
School of Artificial Intelligence and Automation, Huazhong University of Science and Technology, Wuhan, China
2 shared publications - Yuxiang Hu
Hebei university of Technology
2 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (10) , 15204-15215
Prescribed-Time Nondisruptive Formation Control of Open Multiagent Systems via Information Isolation
This article addresses nondisruptive formation control in open multiagent systems (OMAS) subjected to random agent joining. To prevent newly joined agents from disrupting the existing formation, a prescribed-time nondisruptive formation control framework is proposed by incorporating an information isolation mechanism. A prescribed-time control strategy further ensures that newly joined agents achieve formation tracking within a user-defined time. Sufficient theoretical conditions for prescribed-time nondisruptive formation control are rigorously derived. Extensive simulations and hardware experiments demonstrate the effectiveness, scalability, and clear advantages of the proposed method over existing approaches.
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (10) , 15204-15215
Prescribed-Time Nondisruptive Formation Control of Open Multiagent Systems via Information Isolation
This article addresses nondisruptive formation control in open multiagent systems (OMAS) subjected to random agent joining. To prevent newly joined agents from disrupting the existing formation, a prescribed-time nondisruptive formation control framework is proposed by incorporating an information isolation mechanism. A prescribed-time control strategy further ensures that newly joined agents achieve formation tracking within a user-defined time. Sufficient theoretical conditions for prescribed-time nondisruptive formation control are rigorously derived. Extensive simulations and hardware experiments demonstrate the effectiveness, scalability, and clear advantages of the proposed method over existing approaches.
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. PP (15513203) , 1-12
Observer-Based Hierarchical Predefined-Time Coordination for Time-Varying Power Tracking in Multicluster Inverter Air-Conditioning Systems
The large-scale aggregation of inverter air-conditioning (IAC) systems provides considerable flexibility for grid power regulation. However, under time-varying power demand and user comfort constraints, achieving fast and fair power scheduling within a controllable time remains challenging. This article investigates the predefined-time coordination problem of a large-scale multicluster IAC system and proposes an observer-based hierarchical control framework for fast tracking of time-varying demand. At the upper layer, a distributed predefined-time observer enables fair power allocation among clusters without requiring global information. At the lower layer, a dual-loop predefined-time control strategy ensures accurate power tracking while achieving consensus of user comfort. Furthermore, to accommodate dynamic device participation, a communication topology reconfiguration mechanism is developed to support plug-and-play operation. Lyapunov-based analysis establishes predefined-time convergence, and simulation results under slow-, step-, and fast-varying power demand verify the effectiveness, robustness, and scalability of the proposed approach.
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. PP (15513203) , 1-12
Observer-Based Hierarchical Predefined-Time Coordination for Time-Varying Power Tracking in Multicluster Inverter Air-Conditioning Systems
The large-scale aggregation of inverter air-conditioning (IAC) systems provides considerable flexibility for grid power regulation. However, under time-varying power demand and user comfort constraints, achieving fast and fair power scheduling within a controllable time remains challenging. This article investigates the predefined-time coordination problem of a large-scale multicluster IAC system and proposes an observer-based hierarchical control framework for fast tracking of time-varying demand. At the upper layer, a distributed predefined-time observer enables fair power allocation among clusters without requiring global information. At the lower layer, a dual-loop predefined-time control strategy ensures accurate power tracking while achieving consensus of user comfort. Furthermore, to accommodate dynamic device participation, a communication topology reconfiguration mechanism is developed to support plug-and-play operation. Lyapunov-based analysis establishes predefined-time convergence, and simulation results under slow-, step-, and fast-varying power demand verify the effectiveness, robustness, and scalability of the proposed approach.
- 15 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (3) , 2093-2100
Nondisruptive Consensus in Discrete-Time Open Multiagent Systems With Double Integrator Dynamics
This paper focuses on open multi-agent systems (OMAS), where agents can dynamically join and leave the network. The primary objective is to achieve a property termed non-disruptive consensus(NDC), which ensures that the state evolution of existing agents remains unaffected by newly joined agents. To address this, we introduce the notions of joint robustness and limited openness, which are shown to be critical for maintaining system stability under dynamic agent participation. Leveraging these concepts, we propose an estimation-based mean subsequence reduced algorithm for OMAS with double-integrator dynamics, which effectively filters out disruptive agents. Through rigorous mathematical analysis, we derive necessary and sufficient conditions for NDC. The effectiveness of the proposed approach is demonstrated through a time synchronization case study in a wireless sensor network, demonstrating its practical advantages and superior performance compared to existing methods.
- 15 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (3) , 2093-2100
Nondisruptive Consensus in Discrete-Time Open Multiagent Systems With Double Integrator Dynamics
This paper focuses on open multi-agent systems (OMAS), where agents can dynamically join and leave the network. The primary objective is to achieve a property termed non-disruptive consensus(NDC), which ensures that the state evolution of existing agents remains unaffected by newly joined agents. To address this, we introduce the notions of joint robustness and limited openness, which are shown to be critical for maintaining system stability under dynamic agent participation. Leveraging these concepts, we propose an estimation-based mean subsequence reduced algorithm for OMAS with double-integrator dynamics, which effectively filters out disruptive agents. Through rigorous mathematical analysis, we derive necessary and sufficient conditions for NDC. The effectiveness of the proposed approach is demonstrated through a time synchronization case study in a wireless sensor network, demonstrating its practical advantages and superior performance compared to existing methods.
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (3) , 1191-1201
Consensus Analysis and Convergence Rate Optimization for Open Multiagent Systems
This article investigates the fast consensus problem in open multiagent systems (OMASs), where agents can randomly join or leave the network. Such dynamic behaviors significantly impact system consensus and its convergence rates. To address these challenges, we analyze both the frequency of agent switching and the duration during which the network remains nonconnected. A consensus condition for OMAS with time-varying network topology is derived, and explicit upper bounds on switching frequency and dwell time are established to guarantee consensus. To further achieve fast consensus, a convergence rate optimization scheme is proposed, along with a distributed implementation based on the alternating direction method of multiplier. Extensive simulations demonstrate the effectiveness and superiority of the proposed control strategy compared to existing OMAS consensus approaches.
- 2 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (3) , 1191-1201
Consensus Analysis and Convergence Rate Optimization for Open Multiagent Systems
This article investigates the fast consensus problem in open multiagent systems (OMASs), where agents can randomly join or leave the network. Such dynamic behaviors significantly impact system consensus and its convergence rates. To address these challenges, we analyze both the frequency of agent switching and the duration during which the network remains nonconnected. A consensus condition for OMAS with time-varying network topology is derived, and explicit upper bounds on switching frequency and dwell time are established to guarantee consensus. To further achieve fast consensus, a convergence rate optimization scheme is proposed, along with a distributed implementation based on the alternating direction method of multiplier. Extensive simulations demonstrate the effectiveness and superiority of the proposed control strategy compared to existing OMAS consensus approaches.
- 24 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (6) , 3846-3855
Dynamic Nash Equilibrium Seeking for Constrained Noncooperative Game of Open Multiagent Systems
Open multiagent systems (OMASs) feature a dynamic structure with agents continuously joining or leaving, resulting in shifting Nash equilibria and frequent disruptions of equality constraints. This inherent instability poses a significant challenge to traditional incremental-consensus-based distributed optimization or game methods, which rely on a stable and consistent agent population to compute and maintain equilibrium solutions effectively. The necessity for these methods to continuously enforce constraints and the time-intensive process of recalculating equilibria in response to agent dynamics present a substantial bottleneck in the optimization of OMASs. To address this challenge, we develop an innovative incremental consensus-based distributed (ICBD) algorithm to achieve the dynamic Nash equilibrium (NE) for constrained noncooperative game of OMASs. The ICBD algorithm leverages predefined-time stability and integral sliding-mode control to enable rapid recalibration to new equilibria and maintain constraints without the need for prolonged recalculations. Finally, several numerical simulations validate our approach to demonstrating its effectiveness.
- 24 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (6) , 3846-3855
Dynamic Nash Equilibrium Seeking for Constrained Noncooperative Game of Open Multiagent Systems
Open multiagent systems (OMASs) feature a dynamic structure with agents continuously joining or leaving, resulting in shifting Nash equilibria and frequent disruptions of equality constraints. This inherent instability poses a significant challenge to traditional incremental-consensus-based distributed optimization or game methods, which rely on a stable and consistent agent population to compute and maintain equilibrium solutions effectively. The necessity for these methods to continuously enforce constraints and the time-intensive process of recalculating equilibria in response to agent dynamics present a substantial bottleneck in the optimization of OMASs. To address this challenge, we develop an innovative incremental consensus-based distributed (ICBD) algorithm to achieve the dynamic Nash equilibrium (NE) for constrained noncooperative game of OMASs. The ICBD algorithm leverages predefined-time stability and integral sliding-mode control to enable rapid recalibration to new equilibria and maintain constraints without the need for prolonged recalculations. Finally, several numerical simulations validate our approach to demonstrating its effectiveness.
- 1 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 5349-5359
Low Overhead Minimum Variance Time Synchronization for Time-Sensitive Wireless Sensor Networks
Targeting to improve the time synchronization accuracy of multi-hop Time-Sensitive Wireless Sensor Networks (TS-WSNs) for mission-critical industrial automation applications, a Minimum Variance Time Synchronization (MVTS) algorithm utilizing the concept of Packet-Coupled Oscillators (PkCOs) is proposed. This MVTS algorithm utlizes an output feedback approach to mitigate the impact of communication noise on the accumulation of synchronization errors. In addition, a Time-Division Multiple Access (TDMA) packet-exchange superframe is introduced to achieve efficient and low-overhead time synchronization. The optimal gain matrix of the MVTS algorithm is obtained by the Linear Matrix Inequality (LMI) optimization with theoretic analysis. The proposed MVTS algorithm is evaluated by both simulation and experiments on an IEEE 802.15.4 hardware testbed. The experimental results show that the proposed algorithm can effectively reduce the growth rate of clock offset along multi-hop nodes and improve the time synchronization accuracy of the TS-WSNs. Note to Practitioners —This paper explores a method to achieve precise time synchronization in TS-WSNs. The primary challenge being addressed is the accumulation of synchronization errors that occur in multi-hop TS-WSNs, which can compromise the accuracy of time synchronization. To mitigate this challenge while taking communication overhead into account, we propose a solution that combines a TDMA-based packet-exchange superframe structure with the MVTS algorithm. This approach introduces an output feedback consensus control scheme to minimize synchronization error variance. The optimal gain matrix for this consensus control scheme is derived through LMI optimization. The algorithm is implemented on an IEEE 802.15.4-compatable wireless node SAM R21 by Microchip and the experimental results of a 10-hop netowrk shows that the maximum synchronization error is 8.32 $\mu s$ , reduced by 56% and 32%, repsectivly, compared to the baseline method FTSP and the recent PISync.
- 1 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 5349-5359
Low Overhead Minimum Variance Time Synchronization for Time-Sensitive Wireless Sensor Networks
Targeting to improve the time synchronization accuracy of multi-hop Time-Sensitive Wireless Sensor Networks (TS-WSNs) for mission-critical industrial automation applications, a Minimum Variance Time Synchronization (MVTS) algorithm utilizing the concept of Packet-Coupled Oscillators (PkCOs) is proposed. This MVTS algorithm utlizes an output feedback approach to mitigate the impact of communication noise on the accumulation of synchronization errors. In addition, a Time-Division Multiple Access (TDMA) packet-exchange superframe is introduced to achieve efficient and low-overhead time synchronization. The optimal gain matrix of the MVTS algorithm is obtained by the Linear Matrix Inequality (LMI) optimization with theoretic analysis. The proposed MVTS algorithm is evaluated by both simulation and experiments on an IEEE 802.15.4 hardware testbed. The experimental results show that the proposed algorithm can effectively reduce the growth rate of clock offset along multi-hop nodes and improve the time synchronization accuracy of the TS-WSNs. Note to Practitioners —This paper explores a method to achieve precise time synchronization in TS-WSNs. The primary challenge being addressed is the accumulation of synchronization errors that occur in multi-hop TS-WSNs, which can compromise the accuracy of time synchronization. To mitigate this challenge while taking communication overhead into account, we propose a solution that combines a TDMA-based packet-exchange superframe structure with the MVTS algorithm. This approach introduces an output feedback consensus control scheme to minimize synchronization error variance. The optimal gain matrix for this consensus control scheme is derived through LMI optimization. The algorithm is implemented on an IEEE 802.15.4-compatable wireless node SAM R21 by Microchip and the experimental results of a 10-hop netowrk shows that the maximum synchronization error is 8.32 $\mu s$ , reduced by 56% and 32%, repsectivly, compared to the baseline method FTSP and the recent PISync.
- Open Access
- 15 May 2023
- Published by Institution of Engineering and Technology (IET) in IET Control Theory & Applications
- Vol. 17 (11) , 1543-1551
Asynchronous broadcast‐based event‐triggered control for discrete‐time clock synchronization
Precise timing plays a key role in the time‐sensitive industrial Internet of Things (IIoT). However, precise time synchronization requires more frequent packet exchange, which consumes more communication bandwidth and energy. This is a particular challenge in battery‐powered wireless nodes, and low communication costs have become an important factor in clock synchronization. To address the challenge of achieving low communication cost clock synchronization in distributed wireless sensor networks, this paper proposes an improved event‐triggered control and synchronization scheme with a novel asynchronous broadcast packet exchange protocol. Unlike the traditional event‐triggered control scheme which is based on synchronous polling packet exchange, this proposed asynchronous broadcast packet exchange is more communication efficient and requires fewer number of packet exchanges. And it is worth noting that the proposed algorithm in this paper is a distributed algorithm and does not require real‐time acquisition of information from neighbouring nodes. Finally, a numerical example is given to illustrate the effectiveness of the proposed event‐triggered control strategy. The efficiency and precision of the proposed clock synchronization method is evaluated by intensive simulations, which show that the number of packet exchange is reduced by 60% for a moderate IIoT network and is particularly useful for large scale network.
- 15 May 2023
- Published by Institution of Engineering and Technology (IET) in IET Control Theory & Applications
- Vol. 17 (11) , 1543-1551
Open AccessAsynchronous broadcast‐based event‐triggered control for discrete‐time clock synchronization
Precise timing plays a key role in the time‐sensitive industrial Internet of Things (IIoT). However, precise time synchronization requires more frequent packet exchange, which consumes more communication bandwidth and energy. This is a particular challenge in battery‐powered wireless nodes, and low communication costs have become an important factor in clock synchronization. To address the challenge of achieving low communication cost clock synchronization in distributed wireless sensor networks, this paper proposes an improved event‐triggered control and synchronization scheme with a novel asynchronous broadcast packet exchange protocol. Unlike the traditional event‐triggered control scheme which is based on synchronous polling packet exchange, this proposed asynchronous broadcast packet exchange is more communication efficient and requires fewer number of packet exchanges. And it is worth noting that the proposed algorithm in this paper is a distributed algorithm and does not require real‐time acquisition of information from neighbouring nodes. Finally, a numerical example is given to illustrate the effectiveness of the proposed event‐triggered control strategy. The efficiency and precision of the proposed clock synchronization method is evaluated by intensive simulations, which show that the number of packet exchange is reduced by 60% for a moderate IIoT network and is particularly useful for large scale network.
- 9 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 70 (7) , 2982-2994
Robust Fault Estimation and Fault-Tolerant Control for Discrete-Time Systems Subject to Periodic Disturbances
To enhance the reliability of digital automation systems in the Industry 4.0 era, this paper investigates a robust fault-tolerant control scheme in the discrete-time domain subject to periodic disturbances, consisting of a fault estimator, dynamic disturbance compensation loop, and fault-tolerant controller. The fault estimator simultaneously estimates both the system states and actuator/sensor faults. The existence and stability conditions of the proposed estimator are given, and a robust design method is proposed to make the state estimates robust to disturbances. To further reduce the estimation errors caused by periodic disturbances, a novel disturbance compensation loop is introduced and is optimized by a joint zero-assignment and pole-optimization method to delicately compensate for the adverse impacts of periodic input disturbances. The proposed robust fault-tolerant controller uses fault estimation to ensure fast recovery in the event of bounded actuator/sensor faults. The proposed scheme is evaluated through simulations of a two-wheeled mobile robot subject to periodic disturbances and simultaneous abrupt inclination angular sensor and ramp actuator faults, where its performance is shown to exceed that of existing methods.
- 9 May 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 70 (7) , 2982-2994
Robust Fault Estimation and Fault-Tolerant Control for Discrete-Time Systems Subject to Periodic Disturbances
To enhance the reliability of digital automation systems in the Industry 4.0 era, this paper investigates a robust fault-tolerant control scheme in the discrete-time domain subject to periodic disturbances, consisting of a fault estimator, dynamic disturbance compensation loop, and fault-tolerant controller. The fault estimator simultaneously estimates both the system states and actuator/sensor faults. The existence and stability conditions of the proposed estimator are given, and a robust design method is proposed to make the state estimates robust to disturbances. To further reduce the estimation errors caused by periodic disturbances, a novel disturbance compensation loop is introduced and is optimized by a joint zero-assignment and pole-optimization method to delicately compensate for the adverse impacts of periodic input disturbances. The proposed robust fault-tolerant controller uses fault estimation to ensure fast recovery in the event of bounded actuator/sensor faults. The proposed scheme is evaluated through simulations of a two-wheeled mobile robot subject to periodic disturbances and simultaneous abrupt inclination angular sensor and ramp actuator faults, where its performance is shown to exceed that of existing methods.