Yanlong Zhao
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
Yanlong Zhao has a total of 126 co-authors. Here are the top co-authors by number of shared publications:
- Ji-Feng Zhang
Zhongyuan University of Technology
21 shared publications - Ying Wang
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
14 shared publications - Jin Guo
School of Automation and Electrical Engineering, University of Science and Technology Beijing, Beijing, China
12 shared publications Ting Wang
School of Intelligence Science and Technology, University of Science and Technology Beijing, Beijing, China
11 shared publications- Wenchao Xue
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
11 shared publications - Ting Wang
School of Intelligence Science and Technology, and Institute of Artificial Intelligence, University of Science and Technology Beijing, Beijing, China
6 shared publications
Latest Publications
- 30 October 2026
- Published by Wiley in Asian Journal of Control
Longitudinal Vehicle Platoon Control: A Method Based on Optimal Preview Control Algorithm
This paper focuses on longitudinal vehicle platoon and proposes a controller design that combines information exchange strategy with the optimal preview control algorithm. First, establish the longitudinal dynamics model of the platoon vehicles and propose the control objectives of maintaining a constant inter‐vehicle distance and consistent speed. Next, an information exchange strategy is designed to integrate information from the preceding vehicle, inter‐vehicle distance, and speed difference, generating the desired target tracking speed. On this basis, the optimal preview control algorithm is applied by constructing an augmented error system to introduce preview information, and the higher‐level controller (HLC) is designed. Then, the lower‐level controller (LLC) adjusts the vehicle's acceleration and deceleration behavior based on the desired acceleration output by the HLC. These two controllers work in coordination to form a multi‐level optimal preview controller (MLOPC). Finally, joint simulations demonstrate the effectiveness of applying this controller to vehicle platoon.
- 30 October 2026
- Published by Wiley in Asian Journal of Control
Longitudinal Vehicle Platoon Control: A Method Based on Optimal Preview Control Algorithm
This paper focuses on longitudinal vehicle platoon and proposes a controller design that combines information exchange strategy with the optimal preview control algorithm. First, establish the longitudinal dynamics model of the platoon vehicles and propose the control objectives of maintaining a constant inter‐vehicle distance and consistent speed. Next, an information exchange strategy is designed to integrate information from the preceding vehicle, inter‐vehicle distance, and speed difference, generating the desired target tracking speed. On this basis, the optimal preview control algorithm is applied by constructing an augmented error system to introduce preview information, and the higher‐level controller (HLC) is designed. Then, the lower‐level controller (LLC) adjusts the vehicle's acceleration and deceleration behavior based on the desired acceleration output by the HLC. These two controllers work in coordination to form a multi‐level optimal preview controller (MLOPC). Finally, joint simulations demonstrate the effectiveness of applying this controller to vehicle platoon.
- 30 July 2026
- Published by Springer Nature in Control Theory and Technology
- p. 1-19
Sparse parameter identification for stochastic systems based on nonconvex regularization
- 30 July 2026
- Published by Springer Nature in Control Theory and Technology
- p. 1-19
Sparse parameter identification for stochastic systems based on nonconvex regularization
- Top Cited Papers
- 24 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-15
Parameter identification for FIR systems with simultaneously quantized inputs and outputs against replay attacks: a stochastic defense scheme
Replay attacks disrupt the temporal correspondence between system inputs and outputs, significantly complicating system identification. While existing methods predominantly employ fixed time-point strategies for attack estimation, such deterministic approaches exhibit vulnerability to attacker reconnaissance, resulting in degraded detection performance or potential failures. This paper proposes a stochastic defense scheme to enhance detection effectiveness and identification accuracy. Furthermore, diverging from conventional studies focused solely on single-threshold output quantization, we investigate system identification problem for Finite Impulse Response (FIR) with simultaneously quantized inputs and outputs against replay attacks. Regarding attack behavior analysis, random replay attacks' degradation effect on the Non Attack Quasi-Convex Combination Estimator (NA-QCCE) is evaluated. An energy-constrained optimization problem establishes optimal attack configurations that maximize NA-QCCE impairment while minimizing energy expenditure. For defense research, an indirect identification framework is developed using the stochastic data processing scheme. Corresponding defense algorithms via compensation-enhanced identification achieve consistent convergence in both attack strategy and system parameter. Feasibility of this algorithm preserves its asymptotic normality in parameter estimation. Minimum-variance identification is obtained via defense parameter optimization, with an actual implementation process provided for optimal deployment. All theorems and conclusions are experimentally validated via numerical simulations.
- 24 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-15
Top Cited PapersParameter identification for FIR systems with simultaneously quantized inputs and outputs against replay attacks: a stochastic defense scheme
Replay attacks disrupt the temporal correspondence between system inputs and outputs, significantly complicating system identification. While existing methods predominantly employ fixed time-point strategies for attack estimation, such deterministic approaches exhibit vulnerability to attacker reconnaissance, resulting in degraded detection performance or potential failures. This paper proposes a stochastic defense scheme to enhance detection effectiveness and identification accuracy. Furthermore, diverging from conventional studies focused solely on single-threshold output quantization, we investigate system identification problem for Finite Impulse Response (FIR) with simultaneously quantized inputs and outputs against replay attacks. Regarding attack behavior analysis, random replay attacks' degradation effect on the Non Attack Quasi-Convex Combination Estimator (NA-QCCE) is evaluated. An energy-constrained optimization problem establishes optimal attack configurations that maximize NA-QCCE impairment while minimizing energy expenditure. For defense research, an indirect identification framework is developed using the stochastic data processing scheme. Corresponding defense algorithms via compensation-enhanced identification achieve consistent convergence in both attack strategy and system parameter. Feasibility of this algorithm preserves its asymptotic normality in parameter estimation. Minimum-variance identification is obtained via defense parameter optimization, with an actual implementation process provided for optimal deployment. All theorems and conclusions are experimentally validated via numerical simulations.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-16
One-Bit Consensus of Controllable Linear Multi-Agent Systems With Communication Noises
This paper addresses the one-bit consensus of controllable linear multi-agent systems (MASs) with communication noises. A consensus algorithm consisting of a communication protocol and a consensus controller is designed. The communication protocol introduces a linear compression encoding function to achieve a one-bit data rate, thereby saving communication costs. The consensus controller with a stabilization term and a consensus term is proposed to ensure the consensus of a potentially unstable but controllable MAS. Specifically, in the consensus term, we adopt an estimation method to overcome the information loss caused by one-bit communications and a decay step to attenuate the effect of communication noise. Two combined Lyapunov functions are constructed to overcome the difficulty arising from the coupling of the control and estimation. By establishing similar iterative structures of these two functions, this paper shows that the MAS can achieve consensus in the mean square sense at the rate of the reciprocal of the iteration number under the case with a connected fixed topology. Moreover, the theoretical results are generalized to the case with jointly connected Markovian switching topologies by establishing a certain equivalence relationship between the Markovian switching topologies and a fixed topology. Two simulation examples are given to validate the algorithm.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-16
One-Bit Consensus of Controllable Linear Multi-Agent Systems With Communication Noises
This paper addresses the one-bit consensus of controllable linear multi-agent systems (MASs) with communication noises. A consensus algorithm consisting of a communication protocol and a consensus controller is designed. The communication protocol introduces a linear compression encoding function to achieve a one-bit data rate, thereby saving communication costs. The consensus controller with a stabilization term and a consensus term is proposed to ensure the consensus of a potentially unstable but controllable MAS. Specifically, in the consensus term, we adopt an estimation method to overcome the information loss caused by one-bit communications and a decay step to attenuate the effect of communication noise. Two combined Lyapunov functions are constructed to overcome the difficulty arising from the coupling of the control and estimation. By establishing similar iterative structures of these two functions, this paper shows that the MAS can achieve consensus in the mean square sense at the rate of the reciprocal of the iteration number under the case with a connected fixed topology. Moreover, the theoretical results are generalized to the case with jointly connected Markovian switching topologies by establishing a certain equivalence relationship between the Markovian switching topologies and a fixed topology. Two simulation examples are given to validate the algorithm.
- 13 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (8) , 12032-12043
Dynamic Adaptive Correction Strategy for Position Sensorless BLDCM Commutation Error Based on Sign Detection
Correcting commutation error plays a critical role in enhancing the position sensorless brushless DC motor (BLDCM) efficiency. The existing commutation error sign detection (CESD)-based correction method gets rid of the reliance on analog-to-digital converter, reducing the demand on BLDCM system configuration. However, due to the complex structure and excessive power consumption of the existing CESD circuit, it is not conducive to long-term stable system operation. Besides, conventional algorithm with decreasing iterative increment exhibits poor anti-interference. Therefore, it is necessary to further improve the conventional correction method. First, a simplified CESD circuit is proposed by equivalently replacing components in the conventional design, increasing detection reliability and decreasing power consumption. Moreover, the compensation angle is calculated using a dynamically varying correction algorithm based on the commutation error sign. By dynamically adjusting the gain factor according to the correction condition, the proposed algorithm switches between searching and locating modes to improve adaptability to disturbances. Under this correction strategy, the compensation angle inevitably converges to the required value within a tiny accuracy range, which is theoretically proven as well. Finally, experiments on a magnetically suspended control moment gyro prototype validate the effectiveness of the proposed method.
- 13 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (8) , 12032-12043
Dynamic Adaptive Correction Strategy for Position Sensorless BLDCM Commutation Error Based on Sign Detection
Correcting commutation error plays a critical role in enhancing the position sensorless brushless DC motor (BLDCM) efficiency. The existing commutation error sign detection (CESD)-based correction method gets rid of the reliance on analog-to-digital converter, reducing the demand on BLDCM system configuration. However, due to the complex structure and excessive power consumption of the existing CESD circuit, it is not conducive to long-term stable system operation. Besides, conventional algorithm with decreasing iterative increment exhibits poor anti-interference. Therefore, it is necessary to further improve the conventional correction method. First, a simplified CESD circuit is proposed by equivalently replacing components in the conventional design, increasing detection reliability and decreasing power consumption. Moreover, the compensation angle is calculated using a dynamically varying correction algorithm based on the commutation error sign. By dynamically adjusting the gain factor according to the correction condition, the proposed algorithm switches between searching and locating modes to improve adaptability to disturbances. Under this correction strategy, the compensation angle inevitably converges to the required value within a tiny accuracy range, which is theoretically proven as well. Finally, experiments on a magnetically suspended control moment gyro prototype validate the effectiveness of the proposed method.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 12, 452-463
Remote State Estimation With Quantized Communication Against Markov Tampering Attack
This paper investigates the security problem of remote state estimation with communication constraints. In a wireless network where only binary-quantized measurements can be transmitted, we model the adversary's stochastic tampering attack as a Markov process and derive the minimum mean-square error state estimator for this scenario. From the attacker's viewpoint, we design an optimal tampering strategy that maximizes the estimation error at the remote center. From the defender's standpoint, when the attack strategy is known, we propose a compensation algorithm that recovers the estimator's performance to its unattacked level; when the attack strategy is unknown, we develop a joint update mechanism that alternately identifies the true attack strategy and refines the state estimate, and we obtain optimal defense parameters by solving for the extremum of a loss function that balances these two objectives. Finally, we validate relevant theoretical results through numerical simulations.
- 9 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 12, 452-463
Remote State Estimation With Quantized Communication Against Markov Tampering Attack
This paper investigates the security problem of remote state estimation with communication constraints. In a wireless network where only binary-quantized measurements can be transmitted, we model the adversary's stochastic tampering attack as a Markov process and derive the minimum mean-square error state estimator for this scenario. From the attacker's viewpoint, we design an optimal tampering strategy that maximizes the estimation error at the remote center. From the defender's standpoint, when the attack strategy is known, we propose a compensation algorithm that recovers the estimator's performance to its unattacked level; when the attack strategy is unknown, we develop a joint update mechanism that alternately identifies the true attack strategy and refines the state estimate, and we obtain optimal defense parameters by solving for the extremum of a loss function that balances these two objectives. Finally, we validate relevant theoretical results through numerical simulations.
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (3) , 1845-1860
A Unified Recursive Identification Algorithm With Quantized Observations Based on Weighted Least-Squares Type Criteria
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (3) , 1845-1860
A Unified Recursive Identification Algorithm With Quantized Observations Based on Weighted Least-Squares Type Criteria
- Open Access
Recursive Binary Identification with Differential Privacy and Data Tampering Attacks
In this paper, we consider the parameter estimation in a bandwidth-constrained sensor network communicating through an insecure medium. The sensor performs a local quantization, and transmits a 1-bit message to an estimation center through a wireless medium where the transmission of information is vulnerable to attackers. Both eavesdroppers and data tampering attackers are considered in our setting. A differential privacy method is used to protect the sensitive information against eavesdroppers. Then, a recursive projection algorithm is proposed such that the estimation center achieves the almost sure convergence and mean-square convergence when quantized measurements, differential privacy, and data tampering attacks are considered in a uniform framework. A privacy analysis including the convergence rate with privacy or without privacy is given. Further, we extend the problem to multi-agent systems. For this case, a distributed recursive projection algorithm is proposed with guaranteed almost sure and mean square convergence. A simulation example is provided to illustrate the effectiveness of the proposed algorithms.
Open AccessRecursive Binary Identification with Differential Privacy and Data Tampering Attacks
In this paper, we consider the parameter estimation in a bandwidth-constrained sensor network communicating through an insecure medium. The sensor performs a local quantization, and transmits a 1-bit message to an estimation center through a wireless medium where the transmission of information is vulnerable to attackers. Both eavesdroppers and data tampering attackers are considered in our setting. A differential privacy method is used to protect the sensitive information against eavesdroppers. Then, a recursive projection algorithm is proposed such that the estimation center achieves the almost sure convergence and mean-square convergence when quantized measurements, differential privacy, and data tampering attacks are considered in a uniform framework. A privacy analysis including the convergence rate with privacy or without privacy is given. Further, we extend the problem to multi-agent systems. For this case, a distributed recursive projection algorithm is proposed with guaranteed almost sure and mean square convergence. A simulation example is provided to illustrate the effectiveness of the proposed algorithms.