Yifeng 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
Yifeng Li has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Jiandong Zhu
Key Laboratory for NSLSCS of Ministry of Education, School of Mathematical Sciences, Nanjing Normal University, Nanjing, China
5 shared publications - Zhichun Yang
School of Mathematical Sciences, Chongqing Normal University, Chongqing, China
3 shared publications - Tingwen Huang
Shenzhen University of Advanced Technology
2 shared publications Xuewen Liu
National Center for Applied Mathematics in Chongqing, Chongqing Normal University, Chongqing, China
2 shared publications- Yongduan Song
Chongqing University
2 shared publications - Baoyu Liu
National Center for Applied Mathematics in Chongqing, Chongqing Normal University, Chongqing, China
1 shared publication
Latest Publications
- 23 June 2026
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 47 (4) , 1049-1060
Output Feedback Control Strategy With a Model‐Free Algorithm for Continuous‐Time Linear Systems
In this paper we propose a model‐free reinforcement learning framework for adaptive control of continuous‐time linear systems without requiring prior system knowledge. By estimating system states from measurable outputs and iteratively minimizing the optimal cost function, both optimal and suboptimal output feedback control policies are derived. An integral reinforcement learning approach with an actor–critic structure enables real‐time estimation of Q‐function parameters, thereby facilitating adaptive policy optimization. In particular, the proposed approach can outperform traditional LQR‐based output‐feedback control by delivering superior results in complex systems, while maintaining good performance in simple scenarios. Simulation results on a Multi‐agent Network with Eliminated Constraints and an active vibration control system validate the framework's effectiveness and robustness under uncertainty.
- 23 June 2026
- Published by Wiley in Optimal Control Applications and Methods
- Vol. 47 (4) , 1049-1060
Output Feedback Control Strategy With a Model‐Free Algorithm for Continuous‐Time Linear Systems
In this paper we propose a model‐free reinforcement learning framework for adaptive control of continuous‐time linear systems without requiring prior system knowledge. By estimating system states from measurable outputs and iteratively minimizing the optimal cost function, both optimal and suboptimal output feedback control policies are derived. An integral reinforcement learning approach with an actor–critic structure enables real‐time estimation of Q‐function parameters, thereby facilitating adaptive policy optimization. In particular, the proposed approach can outperform traditional LQR‐based output‐feedback control by delivering superior results in complex systems, while maintaining good performance in simple scenarios. Simulation results on a Multi‐agent Network with Eliminated Constraints and an active vibration control system validate the framework's effectiveness and robustness under uncertainty.
- 11 June 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 215
Finite-time radial consensus and exponential synchronization of Kuramoto oscillators on spherical shells
- 11 June 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 215
Finite-time radial consensus and exponential synchronization of Kuramoto oscillators on spherical shells
- 14 February 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (5)
Input-output decoupling of probabilistic Boolean control networks
- 14 February 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (5)
Input-output decoupling of probabilistic Boolean control networks
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 324-333
Solvability and Normalization of General Singular Boolean Networks via Admissible and Normal Initial State Sets
This article addresses the fundamental issues of solvability and normalization in singular Boolean networks (SBNs) from a new perspective based on the admissible and normal initial state sets. It presents novel results and removes the restrictive conditions found in existing literature. First, the state transition matrix of SBNs is constructed by defining a new operator, and the admissible initial state set with the normal initial state set, of SBNs is introduced. Second, the problems of the solvability and uniqueness of the solution to a general SBN are converted into computing its admissible and normal initial state sets, which can be analytically computed using the derived formulas. Third, based on the normal initial state set, a necessary and sufficient condition for solving the normalization problem of general SBNs is established for the first time, which removes the restrictions in the existing literature. Finally, the results obtained are compared with existing literature and illustrated with examples.
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 324-333
Solvability and Normalization of General Singular Boolean Networks via Admissible and Normal Initial State Sets
This article addresses the fundamental issues of solvability and normalization in singular Boolean networks (SBNs) from a new perspective based on the admissible and normal initial state sets. It presents novel results and removes the restrictive conditions found in existing literature. First, the state transition matrix of SBNs is constructed by defining a new operator, and the admissible initial state set with the normal initial state set, of SBNs is introduced. Second, the problems of the solvability and uniqueness of the solution to a general SBN are converted into computing its admissible and normal initial state sets, which can be analytically computed using the derived formulas. Third, based on the normal initial state set, a necessary and sufficient condition for solving the normalization problem of general SBNs is established for the first time, which removes the restrictions in the existing literature. Finally, the results obtained are compared with existing literature and illustrated with examples.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (11) , 8587-8598
Disturbance Decoupling of Probabilistic Boolean Networks
This article addresses the disturbance decoupling problem (DDP) of probabilistic Boolean networks (PBNs). Existing research on the DDP of Boolean networks (BNs) has predominantly concentrated on deterministic BNs (DBNs), which inadequately model the complexities of real-world systems, particularly those exhibiting stochastic behavior and uncertainty. We introduce two definitions tailored to PBNs: disturbance decoupling in distribution and disturbance decoupling with probability one. Utilizing an algebraic representation framework, we derive algebraic conditions for both types of disturbance decoupling. Additionally, we employ a vertex partitioning approach to establish graphical conditions pertinent to these disturbance decoupling types. Our investigation further reveals the connections between DBNs and PBNs concerning disturbance decoupling. To demonstrate the effectiveness of our theoretical results, we present three examples.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (11) , 8587-8598
Disturbance Decoupling of Probabilistic Boolean Networks
This article addresses the disturbance decoupling problem (DDP) of probabilistic Boolean networks (PBNs). Existing research on the DDP of Boolean networks (BNs) has predominantly concentrated on deterministic BNs (DBNs), which inadequately model the complexities of real-world systems, particularly those exhibiting stochastic behavior and uncertainty. We introduce two definitions tailored to PBNs: disturbance decoupling in distribution and disturbance decoupling with probability one. Utilizing an algebraic representation framework, we derive algebraic conditions for both types of disturbance decoupling. Additionally, we employ a vertex partitioning approach to establish graphical conditions pertinent to these disturbance decoupling types. Our investigation further reveals the connections between DBNs and PBNs concerning disturbance decoupling. To demonstrate the effectiveness of our theoretical results, we present three examples.
- 3 May 2025
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2679 (6) , 798-814
Multi-Decoder Dynamic Attention Model for Container Relocation Problem
It is significant for enhancing a container terminal’s competitiveness to utilize digital and intelligent transformation techniques. Minimizing the number of container relocations is beneficial for decreasing the non-production cost in a container terminal. For the calculation problem of exact mathematical methods and performance problem of existing deep learning models, a multi-decoder dynamic attention model (MDDAM) is proposed. MDDAM can train multiple different policies and output different solutions. Because of the constraint of the Kullback-Leibler divergence between decoders, the decoders are forced to output different probability distributions. To represent the bay configuration information more accurately, a stack feature enhancer (SFE) is defined based on five features of the bay configuration. Ablation experiments demonstrate the effectiveness of the SFE. MDDAM is trained using the REINFORCE algorithm. Extensive experiments show that the proposed MDDAM has advantages over traditional integer programming methods when solving large-scale problems, and achieves state-of-the-art results compared with known deep reinforcement learning methods.
- 3 May 2025
- Published by SAGE Publications in Transportation Research Record: Journal of the Transportation Research Board
- Vol. 2679 (6) , 798-814
Multi-Decoder Dynamic Attention Model for Container Relocation Problem
It is significant for enhancing a container terminal’s competitiveness to utilize digital and intelligent transformation techniques. Minimizing the number of container relocations is beneficial for decreasing the non-production cost in a container terminal. For the calculation problem of exact mathematical methods and performance problem of existing deep learning models, a multi-decoder dynamic attention model (MDDAM) is proposed. MDDAM can train multiple different policies and output different solutions. Because of the constraint of the Kullback-Leibler divergence between decoders, the decoders are forced to output different probability distributions. To represent the bay configuration information more accurately, a stack feature enhancer (SFE) is defined based on five features of the bay configuration. Ablation experiments demonstrate the effectiveness of the SFE. MDDAM is trained using the REINFORCE algorithm. Extensive experiments show that the proposed MDDAM has advantages over traditional integer programming methods when solving large-scale problems, and achieves state-of-the-art results compared with known deep reinforcement learning methods.
- 2 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 54 (12) , 7981-7990
A Nonaugmented Method for the Minimal Observability of Boolean Networks
This article proposes a nonaugmented method for investigating the minimal observability problem of Boolean networks (BNs). This method can be applied to more general BNs and reduce the computational and space complexity of existing results. First, unobservable states concerning an unobservable BN are classified into three categories using the vertex-colored state transition graph, each accompanied by a necessary and sufficient condition for determining additional measurements to make them distinguishable. Then, an algorithm is designed to identify the additional measurements that would render an unobservable BN observable using the conditions. Next, to determine the minimum added measurements, a necessary and sufficient condition and an algorithm based on a constructed matrix are presented. Finally, the results obtained are compared with existing literature and illustrated with examples.
- 2 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 54 (12) , 7981-7990
A Nonaugmented Method for the Minimal Observability of Boolean Networks
This article proposes a nonaugmented method for investigating the minimal observability problem of Boolean networks (BNs). This method can be applied to more general BNs and reduce the computational and space complexity of existing results. First, unobservable states concerning an unobservable BN are classified into three categories using the vertex-colored state transition graph, each accompanied by a necessary and sufficient condition for determining additional measurements to make them distinguishable. Then, an algorithm is designed to identify the additional measurements that would render an unobservable BN observable using the conditions. Next, to determine the minimum added measurements, a necessary and sufficient condition and an algorithm based on a constructed matrix are presented. Finally, the results obtained are compared with existing literature and illustrated with examples.
- 16 June 2023
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 24 (6) , 906-915
Controllability of Boolean control networks with multiple time delays in both states and controls
In this paper, the problem of controllability of Boolean control networks (BCNs) with multiple time delays in both states and controls is investigated. Fir
- 16 June 2023
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 24 (6) , 906-915
Controllability of Boolean control networks with multiple time delays in both states and controls
In this paper, the problem of controllability of Boolean control networks (BCNs) with multiple time delays in both states and controls is investigated. Fir
- 6 January 2023
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 21 (1) , 40-51
On Block-decoupling of Boolean Control Networks
- 6 January 2023
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 21 (1) , 40-51
On Block-decoupling of Boolean Control Networks
- 9 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (2) , 1267-1274
Observability Decomposition of Boolean Control Networks
This paper investigates the observability decomposition of Boolean control networks (BCNs) under the algebraic frame based on the semi-tensor product of matrices. First, the definition for the observability decomposition of BCNs is proposed, which is consistent with the observability decomposition of traditional linear control systems. Then, by using the vertex partition method,a necessary and sufficient vertex partition condition for the observability decomposition of BCNs is proposed. Next, an algorithm is designed for the analysis and realization of observability decomposition. Finally, a biological example and a counterexample are analyzed to illustrate the obtained results.
- 9 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (2) , 1267-1274
Observability Decomposition of Boolean Control Networks
This paper investigates the observability decomposition of Boolean control networks (BCNs) under the algebraic frame based on the semi-tensor product of matrices. First, the definition for the observability decomposition of BCNs is proposed, which is consistent with the observability decomposition of traditional linear control systems. Then, by using the vertex partition method,a necessary and sufficient vertex partition condition for the observability decomposition of BCNs is proposed. Next, an algorithm is designed for the analysis and realization of observability decomposition. Finally, a biological example and a counterexample are analyzed to illustrate the obtained results.