Lifeng Ma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Lifeng Ma has a total of 122 co-authors. Here are the top co-authors by number of shared publications:
- Zidong Wang
Brunel University London
28 shared publications Yuming Bo
School of Automation, Nanjing University of Science and Technology, Nanjing, China
17 shared publicationsZhi Guo
11 shared publications- Chen Gao
Nanjing University of Science and Technology
10 shared publications - Xiaojian Yi
Beijing Institute of Technology
8 shared publications Xiaojian Yi
School of Mechatronical Engineering Beijing Institute of Technology Beijing China
7 shared publications
Latest Publications
- 2 September 2026
- Published by Springer Nature
- p. 67-79
Bounded Leader-Follower Consensus for Time-Varying Multi-agent Systems via Dynamic Encoding-Decoding
- 2 September 2026
- Published by Springer Nature
- p. 67-79
Bounded Leader-Follower Consensus for Time-Varying Multi-agent Systems via Dynamic Encoding-Decoding
- 18 July 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (14)
Token-bucket-protocol-based recursive filtering for non-Gaussian systems with random parameter matrices: A quadratic filtering approach
- 18 July 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (14)
Token-bucket-protocol-based recursive filtering for non-Gaussian systems with random parameter matrices: A quadratic filtering approach
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (7) , 1764-1766
Security Control of Nonlinear Systems Subject to Deception Attacks: A Reinforcement Learning Approach
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (7) , 1764-1766
Security Control of Nonlinear Systems Subject to Deception Attacks: A Reinforcement Learning Approach
- 28 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 10750-10761
Distributed State Estimation Over Sensor Networks Under Push-Based Gossip Protocol: A Token Bucket Strategy
This paper investigates the distributed state estimation problem for nonlinear time-varying systems over sensor networks governed by gossip-based token bucket protocols. To address this issue, an easy-to-implement framework is developed for the push-based gossip protocol, where each node randomly selects a subset of neighbors for information exchange. Furthermore, a token bucket protocol is employed, where a sensor can transmit information to its selected neighbors only if the tokens stored in the bucket are sufficient to meet the transmission requirement. Specifically, the token consumption is determined by the number of neighbors randomly selected under the gossip protocol. The primary objective is to construct state estimators capable of minimizing the upper bounds on the estimation error covariance matrices by determining appropriate gains at each time step. Finally, the effectiveness of the proposed algorithm is illustrated through two simulation examples.
- 28 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 23 (15455955) , 10750-10761
Distributed State Estimation Over Sensor Networks Under Push-Based Gossip Protocol: A Token Bucket Strategy
This paper investigates the distributed state estimation problem for nonlinear time-varying systems over sensor networks governed by gossip-based token bucket protocols. To address this issue, an easy-to-implement framework is developed for the push-based gossip protocol, where each node randomly selects a subset of neighbors for information exchange. Furthermore, a token bucket protocol is employed, where a sensor can transmit information to its selected neighbors only if the tokens stored in the bucket are sufficient to meet the transmission requirement. Specifically, the token consumption is determined by the number of neighbors randomly selected under the gossip protocol. The primary objective is to construct state estimators capable of minimizing the upper bounds on the estimation error covariance matrices by determining appropriate gains at each time step. Finally, the effectiveness of the proposed algorithm is illustrated through two simulation examples.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-8
Distributed Innovation-Constrained State Estimation Over Sensor Networks: A State-Dependent Coefficient Parameterization Approach
The paper focuses on the distributed state estimation problem for a specific type of nonlinear systems over sensor networks. The state estimation is accomplished on each sensor node by utilizing local measurements along with network shared innovations from neighboring nodes. A state-dependent coefficient parameterization technique is employed to express the original nonlinear system in a pseudo-linear form. Additionally, a saturation-like scheme is used to limit the impact of anomalous signals during propagation and ensure the received information remains within a permissible range. The main goal of the research problem is to propose an estimation approach that restricts the estimation errors within pre-defined ellipsoids. Adequate conditions for solving this problem are provided by establishing the feasibility of a series of matrix inequalities. Further, a technique is developed to determine the locally optimal estimator parameters based on the established framework. Finally, the correctness of the results is demonstrated using a simulation example that involves the Van der Pol equation.
- 6 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. PP (00189286) , 1-8
Distributed Innovation-Constrained State Estimation Over Sensor Networks: A State-Dependent Coefficient Parameterization Approach
The paper focuses on the distributed state estimation problem for a specific type of nonlinear systems over sensor networks. The state estimation is accomplished on each sensor node by utilizing local measurements along with network shared innovations from neighboring nodes. A state-dependent coefficient parameterization technique is employed to express the original nonlinear system in a pseudo-linear form. Additionally, a saturation-like scheme is used to limit the impact of anomalous signals during propagation and ensure the received information remains within a permissible range. The main goal of the research problem is to propose an estimation approach that restricts the estimation errors within pre-defined ellipsoids. Adequate conditions for solving this problem are provided by establishing the feasibility of a series of matrix inequalities. Further, a technique is developed to determine the locally optimal estimator parameters based on the established framework. Finally, the correctness of the results is demonstrated using a simulation example that involves the Van der Pol equation.
- 13 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP (21682267) , 1-13
Consensus Control of Multiagent Systems Under DoS Attacks: A Dynamic-Key-Based Secure Scheme
In this article, the secure consensus control problem is investigated for discrete-time multiagent systems (DTMASs) subjected to denial-of-service (DoS) attacks, where a model-free controller is proposed based on the Q-learning (QL) method. In an attack-free case, a dynamic decaying encryption key is designed to enable secure state transmission over communication channels through quantization-based encryption to prevent unauthorized access. Under DoS attacks, the system switches to a safe mode that partially halts communication, where the key transforms into a local scaling parameter to prevent quantizer saturation through dynamic expansion. The QL-driven algorithm is introduced to autonomously synthesize control gain matrices, without requiring system dynamics models. Moreover, sufficient conditions on the frequency and duration of DoS attacks are derived to ensure that the model-free controller guarantees consensus in DTMASs. Finally, simulation studies involving highly maneuverable aircraft technology vehicles (HiMATVs) are conducted, demonstrating that DTMASs equipped with the proposed approach exhibit significantly enhanced attack resistance compared to conventional methods.
- 13 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP (21682267) , 1-13
Consensus Control of Multiagent Systems Under DoS Attacks: A Dynamic-Key-Based Secure Scheme
In this article, the secure consensus control problem is investigated for discrete-time multiagent systems (DTMASs) subjected to denial-of-service (DoS) attacks, where a model-free controller is proposed based on the Q-learning (QL) method. In an attack-free case, a dynamic decaying encryption key is designed to enable secure state transmission over communication channels through quantization-based encryption to prevent unauthorized access. Under DoS attacks, the system switches to a safe mode that partially halts communication, where the key transforms into a local scaling parameter to prevent quantizer saturation through dynamic expansion. The QL-driven algorithm is introduced to autonomously synthesize control gain matrices, without requiring system dynamics models. Moreover, sufficient conditions on the frequency and duration of DoS attacks are derived to ensure that the model-free controller guarantees consensus in DTMASs. Finally, simulation studies involving highly maneuverable aircraft technology vehicles (HiMATVs) are conducted, demonstrating that DTMASs equipped with the proposed approach exhibit significantly enhanced attack resistance compared to conventional methods.
- Top Cited Papers
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (6) , 3579-3591
Distributed Filtering Over Sensor Networks With Byzantine Attacks: A Token Bucket Protocol
In this article, the distributed filtering issue is explored for time-varying state-saturated systems affected by Byzantine attacks over sensor networks. To regulate data transmission, a token bucket protocol (TBP) is utilized, in which the stochastic nature of token consumption arises from variations in packet sizes. Particularly, the measurements are transmitted to the filter only when the available tokens suffice to meet the required consumption. A Byzantine attack model is formulated in which Byzantine nodes arbitrarily alter the measurement signals transmitted to neighboring nodes. The primary objective is to construct an upper bound of the filtering error covariance (FEC) and to compute suitable filter gains by minimizing this bound. Furthermore, the boundedness of the proposed filtering error dynamics is rigorously analyzed via matrix-based theoretical analysis. Finally, numerical simulations are conducted to verify the effectiveness of the proposed algorithm.
- 6 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (6) , 3579-3591
Top Cited PapersDistributed Filtering Over Sensor Networks With Byzantine Attacks: A Token Bucket Protocol
In this article, the distributed filtering issue is explored for time-varying state-saturated systems affected by Byzantine attacks over sensor networks. To regulate data transmission, a token bucket protocol (TBP) is utilized, in which the stochastic nature of token consumption arises from variations in packet sizes. Particularly, the measurements are transmitted to the filter only when the available tokens suffice to meet the required consumption. A Byzantine attack model is formulated in which Byzantine nodes arbitrarily alter the measurement signals transmitted to neighboring nodes. The primary objective is to construct an upper bound of the filtering error covariance (FEC) and to compute suitable filter gains by minimizing this bound. Furthermore, the boundedness of the proposed filtering error dynamics is rigorously analyzed via matrix-based theoretical analysis. Finally, numerical simulations are conducted to verify the effectiveness of the proposed algorithm.
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 12, 187-198
Recursive Distributed Secure State Estimation for Nonlinear Systems With Amplify-and-Forward Relays and Stochastic Measurement Delays Over Sensor Network
This article takes up for discussion the distributed secure state estimation issue for a specific category of nonlinear systems with random measurement delays and being subject to random deception attacks. To prolong the signal transmission distance, the amplify-and-forward (AF) relays are incorporated. A distinctive recursive state estimation algorithm is formulated, adopting a pattern reminiscent of a Kalman-type filter. Firstly, an upper bound matrix (UBM) for the estimation error (EE) variance is calculated. Then the estimator gain matrices are obtained by minimizing the calculated UBM. Subsequently, the impact of the transmission energies from sensors and relays on estimation performance is analyzed. Finally, the proposed estimation algorithm is confirmed through a simulation example, demonstrating its effectiveness.
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 12, 187-198
Recursive Distributed Secure State Estimation for Nonlinear Systems With Amplify-and-Forward Relays and Stochastic Measurement Delays Over Sensor Network
This article takes up for discussion the distributed secure state estimation issue for a specific category of nonlinear systems with random measurement delays and being subject to random deception attacks. To prolong the signal transmission distance, the amplify-and-forward (AF) relays are incorporated. A distinctive recursive state estimation algorithm is formulated, adopting a pattern reminiscent of a Kalman-type filter. Firstly, an upper bound matrix (UBM) for the estimation error (EE) variance is calculated. Then the estimator gain matrices are obtained by minimizing the calculated UBM. Subsequently, the impact of the transmission energies from sensors and relays on estimation performance is analyzed. Finally, the proposed estimation algorithm is confirmed through a simulation example, demonstrating its effectiveness.
- 22 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (5) , 3859-3869
Distributed State Estimation for Complex Networks Under Decode-and-Forward Relays: Handling Transmission Power Constraints
This article delves into the distributed state estimation issue for a type of complex networks subjected to packet dropouts, particularly in relay channels employing a decode-and-forward strategy. The communication between the sensor and the remote estimator is conducted via a wireless network, which may encounter probabilistic packet dropouts, necessitating the implementation of a relay-based decode-and-forward strategy. The incidence of packet dropouts is determined by a Bernoulli-distributed random variable, with its probability contingent upon the available transmission power. A comprehensive transmission power constraint model is developed to evaluate the impact of transmission power on the estimation performance. A transmission-power-based estimator is devised, and a sufficient condition is formulated to ensure the mean-square boundedness of the estimation error dynamics. In addition, the codesign of transmission power allocation scheme and estimator gains is framed as an optimization problem, resolved by particle swarm optimization and linear matrix inequality techniques. Finally, simulation examples are displayed to clarify the effective implementation of the theoretical findings.
- 22 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 22 (5) , 3859-3869
Distributed State Estimation for Complex Networks Under Decode-and-Forward Relays: Handling Transmission Power Constraints
This article delves into the distributed state estimation issue for a type of complex networks subjected to packet dropouts, particularly in relay channels employing a decode-and-forward strategy. The communication between the sensor and the remote estimator is conducted via a wireless network, which may encounter probabilistic packet dropouts, necessitating the implementation of a relay-based decode-and-forward strategy. The incidence of packet dropouts is determined by a Bernoulli-distributed random variable, with its probability contingent upon the available transmission power. A comprehensive transmission power constraint model is developed to evaluate the impact of transmission power on the estimation performance. A transmission-power-based estimator is devised, and a sufficient condition is formulated to ensure the mean-square boundedness of the estimation error dynamics. In addition, the codesign of transmission power allocation scheme and estimator gains is framed as an optimization problem, resolved by particle swarm optimization and linear matrix inequality techniques. Finally, simulation examples are displayed to clarify the effective implementation of the theoretical findings.