Tianbiao Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tianbiao Wang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Huaguang Zhang
Northeastern University
16 shared publications - Dazhong Ma
Northeastern University
9 shared publications - Lulu Zhang
College of Information Science and Engineering, Northeastern University, Shenyang, Liaoning, China
3 shared publications - Xiaohui Yue
College of Information Science and Engineering, Northeastern University, Shenyang, Liaoning, China
3 shared publications - Haoming Han
College of Information Science and Engineering, Northeastern University, Shenyang, China
2 shared publications Lulu Zhang
College of Information Science and Engineering, Northeastern University, Shenyang, Liaoning, China
2 shared publications
Latest Publications
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 11034-11043
Periodic Dynamic Event-Triggered Control for Average Consensus of Nonlinear Multi-Agent Systems Under Degradation-of-Service Attack
New results on the consensus of multi-agent systems via periodic dynamic event-triggered control are presented under cyber attack. Distinct from traditional Denial-of-Service (DoS) attack model frameworks, this study proposes the novel concept of DoS attack intensity for the first time, remedies the deficiencies of existing DoS attack model frameworks through the DoS attack intensity function, and analyzes the impact mechanism of different DoS attack intensities on multi-agent system consensus. Secondly, to reduce redundant data transmission and alleviate the communication burden during the delay phase caused by low-intensity DoS attacks, i.e., Degradation-of-Service (DeoS) attacks, a periodic dynamic event-triggered mechanism based on delayed state information is designed. Additionally, to derive conditions for multi-agent consensus, the Halanay-type inequality is generalized and some sufficient conditions for achieving multi-agent consensus under DeoS attacks are presented based on the generalized Halanay-type inequality. For the validation of the theoretical validity, the proposed approach is applied to single-link robotic arms systems. Through numerical simulations, it is verified that the single-link robotic arms systems can converge to an average consensus state when the system is subjected to DeoS attacks.
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 11034-11043
Periodic Dynamic Event-Triggered Control for Average Consensus of Nonlinear Multi-Agent Systems Under Degradation-of-Service Attack
New results on the consensus of multi-agent systems via periodic dynamic event-triggered control are presented under cyber attack. Distinct from traditional Denial-of-Service (DoS) attack model frameworks, this study proposes the novel concept of DoS attack intensity for the first time, remedies the deficiencies of existing DoS attack model frameworks through the DoS attack intensity function, and analyzes the impact mechanism of different DoS attack intensities on multi-agent system consensus. Secondly, to reduce redundant data transmission and alleviate the communication burden during the delay phase caused by low-intensity DoS attacks, i.e., Degradation-of-Service (DeoS) attacks, a periodic dynamic event-triggered mechanism based on delayed state information is designed. Additionally, to derive conditions for multi-agent consensus, the Halanay-type inequality is generalized and some sufficient conditions for achieving multi-agent consensus under DeoS attacks are presented based on the generalized Halanay-type inequality. For the validation of the theoretical validity, the proposed approach is applied to single-link robotic arms systems. Through numerical simulations, it is verified that the single-link robotic arms systems can converge to an average consensus state when the system is subjected to DeoS attacks.
- 19 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. PP (15513203) , 1-10
Safe Optimal Formation of Continuous-Time Multiagent Systems via Maximum Entropy Adaptive Dynamic Programming
This article addresses the problem of formation control for multiagent systems operating in partially unknown dynamic environments. A safe optimal control method is proposed by employing maximum entropy adaptive dynamic programming (MEADP) in continuous-time systems, alongside high-order control barrier functions (HoCBFs). First, an MEADP algorithm for continuous-time systems is developed to encourage exploration and prevent convergence to suboptimal solutions under partially unknown system dynamics, with a comprehensive convergence proof of the algorithm provided. Then, safety constraints are formulated using HoCBFs, which are capable of handling safety constraints with higher relative degrees. These constraints are incorporated via quadratic programming to modify the maximum entropy optimal control policy, ensuring that the system states remain within a predefined safe set and effectively avoid collisions with obstacles. Moreover, the MEADP method utilizes a critic neural network to approximate the entropy-regularized Hamilton–Jacobi–Bellman equation, leading to a maximum entropy optimal control policy. Finally, simulation results demonstrate the effectiveness of the approach, making it suitable for safe formation control tasks in complex dynamic environments.
- 19 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. PP (15513203) , 1-10
Safe Optimal Formation of Continuous-Time Multiagent Systems via Maximum Entropy Adaptive Dynamic Programming
This article addresses the problem of formation control for multiagent systems operating in partially unknown dynamic environments. A safe optimal control method is proposed by employing maximum entropy adaptive dynamic programming (MEADP) in continuous-time systems, alongside high-order control barrier functions (HoCBFs). First, an MEADP algorithm for continuous-time systems is developed to encourage exploration and prevent convergence to suboptimal solutions under partially unknown system dynamics, with a comprehensive convergence proof of the algorithm provided. Then, safety constraints are formulated using HoCBFs, which are capable of handling safety constraints with higher relative degrees. These constraints are incorporated via quadratic programming to modify the maximum entropy optimal control policy, ensuring that the system states remain within a predefined safe set and effectively avoid collisions with obstacles. Moreover, the MEADP method utilizes a critic neural network to approximate the entropy-regularized Hamilton–Jacobi–Bellman equation, leading to a maximum entropy optimal control policy. Finally, simulation results demonstrate the effectiveness of the approach, making it suitable for safe formation control tasks in complex dynamic environments.
- 17 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. PP (15513203) , 1-11
Prior-Embedded Policy Optimization for Multipoint Weak Leakage Localization in Energy Transportation Systems
Localization of multipoint weak leakage in energy transportation systems remains challenging due to signal-source mismatch and weak responses of negative pressure waves (NPWs). To address this issue, this article proposes a novel physics-informed localization framework that combines an attenuation-based NPW matching algorithm with a prior-embedded maximum entropy adaptive dynamic programming (MEADP) scheme. First, a matrix transformation-based matching algorithm establishes physically coherent correspondences between inlet and outlet NPWs. Building on this foundation, a prior-embedded MEADP localization strategy incorporates Gaussian priors derived from the attenuation physics of NPWs to guide policy optimization. Furthermore, a Wasserstein-distance regularization term is introduced to stabilize policy learning and ensure reliable convergence. Experimental results demonstrate that the proposed method effectively resolves multileak signal mismatches and achieves high-precision localization, with the minimum localization error remaining below 0.5%.
- 17 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. PP (15513203) , 1-11
Prior-Embedded Policy Optimization for Multipoint Weak Leakage Localization in Energy Transportation Systems
Localization of multipoint weak leakage in energy transportation systems remains challenging due to signal-source mismatch and weak responses of negative pressure waves (NPWs). To address this issue, this article proposes a novel physics-informed localization framework that combines an attenuation-based NPW matching algorithm with a prior-embedded maximum entropy adaptive dynamic programming (MEADP) scheme. First, a matrix transformation-based matching algorithm establishes physically coherent correspondences between inlet and outlet NPWs. Building on this foundation, a prior-embedded MEADP localization strategy incorporates Gaussian priors derived from the attenuation physics of NPWs to guide policy optimization. Furthermore, a Wasserstein-distance regularization term is introduced to stabilize policy learning and ensure reliable convergence. Experimental results demonstrate that the proposed method effectively resolves multileak signal mismatches and achieves high-precision localization, with the minimum localization error remaining below 0.5%.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (10) , 1-10
Anti-Disturbance Intermediate Observer-Based Fault Estimation and Fault-Tolerant Control for Markovian Jump Systems
This article investigates the problem of anti-disturbance fault estimation (FE) and fault-tolerant control (FTC) for Markovian jump systems (MJSs). First, by incorporating sensor faults and disturbances into the system state, the original system is reformulated into a new structure that facilitates observer design. Then, an intermediate observer (IO) is proposed to estimate states, faults, and disturbances. The proposed IO is easier to implement, as it requires neither equality constraints nor derivative information regarding the system output. More importantly, the handling of disturbances does not rely on traditional sliding mode techniques, $H_{\infty } $ methods, and decoupling methods. Furthermore, a comprehensive design scheme is presented to stabilize the system under large faults and disturbances, including the fault-tolerant controller and output compensation mechanism. Finally, the effectiveness of the developed method is demonstrated using the F-404 aircraft engine system.- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (10) , 1-10
Anti-Disturbance Intermediate Observer-Based Fault Estimation and Fault-Tolerant Control for Markovian Jump Systems
This article investigates the problem of anti-disturbance fault estimation (FE) and fault-tolerant control (FTC) for Markovian jump systems (MJSs). First, by incorporating sensor faults and disturbances into the system state, the original system is reformulated into a new structure that facilitates observer design. Then, an intermediate observer (IO) is proposed to estimate states, faults, and disturbances. The proposed IO is easier to implement, as it requires neither equality constraints nor derivative information regarding the system output. More importantly, the handling of disturbances does not rely on traditional sliding mode techniques, $H_{\infty } $ methods, and decoupling methods. Furthermore, a comprehensive design scheme is presented to stabilize the system under large faults and disturbances, including the fault-tolerant controller and output compensation mechanism. Finally, the effectiveness of the developed method is demonstrated using the F-404 aircraft engine system.- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP, 1-10
Optimal Containment Control for Stochastic Multiagent Systems via Simplified ADP Under Secure Communication
This article investigates the optimal containment control (OCC) problem of a class of nonlinear stochastic multiagent systems (MASs) under secure communication. A novel OCC strategy is designed, ensuring that all followers converge to the convex hull spanned by the leaders while maintaining secure information exchange and minimizing cost by the predefined performance function. To achieve this, an encryption and decryption mechanism is employed in the information exchange among agents, ensuring secure communication and preserving data integrity. Meanwhile, to solve the stochastic version of Hamilton-Jacobi-Bellman (HJB) equation arising in stochastic factor, a simplified adaptive dynamic programming (ADP) framework is introduced under the conditional expectation. Specifically, a single critic network weights tuning rule is developed based on the experience replay technique (ERT). The use of ERT relaxes the traditional persistence of excitation requirement. Theoretical analysis guarantees the uniform ultimate boundedness of the closed-loop system. The simulation results confirm the effectiveness of the designed OCC strategy.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP, 1-10
Optimal Containment Control for Stochastic Multiagent Systems via Simplified ADP Under Secure Communication
This article investigates the optimal containment control (OCC) problem of a class of nonlinear stochastic multiagent systems (MASs) under secure communication. A novel OCC strategy is designed, ensuring that all followers converge to the convex hull spanned by the leaders while maintaining secure information exchange and minimizing cost by the predefined performance function. To achieve this, an encryption and decryption mechanism is employed in the information exchange among agents, ensuring secure communication and preserving data integrity. Meanwhile, to solve the stochastic version of Hamilton-Jacobi-Bellman (HJB) equation arising in stochastic factor, a simplified adaptive dynamic programming (ADP) framework is introduced under the conditional expectation. Specifically, a single critic network weights tuning rule is developed based on the experience replay technique (ERT). The use of ERT relaxes the traditional persistence of excitation requirement. Theoretical analysis guarantees the uniform ultimate boundedness of the closed-loop system. The simulation results confirm the effectiveness of the designed OCC strategy.
- 26 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 173-182
Conflict Constrained Control for Switched Multiagent Systems With Nonaffine Nonlinear Faults and Uncertainties
This article investigates a conflict-constrained control method for switched multiagent systems with nonaffine nonlinear faults. Existing studies on state constraints often assume that the reference signal always stays within the constraint set. However, in practice, constraints may be dynamically detected during system operation and conflict with predefined reference signals, causing brief violations of the constraint boundaries. When the reference signal cannot remain within the prescribed range, many backstepping control methods based on barrier Lyapunov function and nonlinear transformations become ineffective. To address this, a new safe reference signal is constructed by using a virtual circle approach, and a conflict-constrained control method is proposed. By combining a common Lyapunov function and the radial basis function neural network, the effects of switching behavior and nonaffine nonlinear faults can be effectively compensated. A shift function is also introduced in the coordinate transformation to further relax constraints on initial values. The proposed method is validated through multiple simulation experiments.
- 26 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 173-182
Conflict Constrained Control for Switched Multiagent Systems With Nonaffine Nonlinear Faults and Uncertainties
This article investigates a conflict-constrained control method for switched multiagent systems with nonaffine nonlinear faults. Existing studies on state constraints often assume that the reference signal always stays within the constraint set. However, in practice, constraints may be dynamically detected during system operation and conflict with predefined reference signals, causing brief violations of the constraint boundaries. When the reference signal cannot remain within the prescribed range, many backstepping control methods based on barrier Lyapunov function and nonlinear transformations become ineffective. To address this, a new safe reference signal is constructed by using a virtual circle approach, and a conflict-constrained control method is proposed. By combining a common Lyapunov function and the radial basis function neural network, the effects of switching behavior and nonaffine nonlinear faults can be effectively compensated. A shift function is also introduced in the coordinate transformation to further relax constraints on initial values. The proposed method is validated through multiple simulation experiments.