Jinfeng Pan
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
Jinfeng Pan has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Jun-E Feng
School of Mathematics, Shandong University, Jinan, China
7 shared publications Jianli Zhao
Research Center of Semi-tensor Product of Matrices: Theory and Applications, School of Mathematical Sciences, Liaocheng University, Liaocheng, People’s Republic of China
3 shared publications- Min Meng
Tongji University
3 shared publications Shihua Fu
Research Center of Semi-tensor Product of Matrices: Theory and Applications, School of Mathematical Sciences, Liaocheng University, Liaocheng, People’s Republic of China
2 shared publicationsZiyun Wang
Research Center of Semi-tensor Product of Matrices: Theory and Applications, School of Mathematical Sciences, Liaocheng University, Liaocheng, People’s Republic of China
2 shared publications- Daizhan Cheng
Key Laboratory of Systems and Control, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing, China
1 shared publication
Latest Publications
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 72 (9) , 1248-1252
Self-Triggered Delay Output Regulation for Boolean Control Networks
This brief proposes a novel concept named as delay output regulation (DOR) for Boolean control networks and develops a self-triggered control framework for its implementation. Unlike output regulation, DOR emphasizes the consistency of output trajectories between two networks within an admissible time delay. Firstly, a necessary and sufficient criterion for the solvability of the DOR is proposed using the reduced-dimension method. Then, a matrix-based self-triggered method is integrated into the state feedback control to achieve the DOR of BCNs. Furthermore, an improved procedure is presented to calculate the self-triggered feedback gain matrix and determine the update interval. Finally, a biological example is given to illustrate the effectiveness of our theoretical results.
- 23 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 72 (9) , 1248-1252
Self-Triggered Delay Output Regulation for Boolean Control Networks
This brief proposes a novel concept named as delay output regulation (DOR) for Boolean control networks and develops a self-triggered control framework for its implementation. Unlike output regulation, DOR emphasizes the consistency of output trajectories between two networks within an admissible time delay. Firstly, a necessary and sufficient criterion for the solvability of the DOR is proposed using the reduced-dimension method. Then, a matrix-based self-triggered method is integrated into the state feedback control to achieve the DOR of BCNs. Furthermore, an improved procedure is presented to calculate the self-triggered feedback gain matrix and determine the update interval. Finally, a biological example is given to illustrate the effectiveness of our theoretical results.
- 6 July 2024
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 112 (18) , 16587-16599
Nash equilibrium, dynamics and control of congestion games with resource failures
- 6 July 2024
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 112 (18) , 16587-16599
Nash equilibrium, dynamics and control of congestion games with resource failures
- 3 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (3) , 5334-5347
Dimensionality Reduction Method for the Output Regulation of Boolean Control Networks
This article proposes a dimensionality reduction approach to study the output regulation problem (ORP) of Boolean control networks (BCNs), which has much lower computational complexity than previous results. First, an auxiliary system which is much smaller in scale than the augmented system in previous approach is constructed. By analyzing the set stabilization of the auxiliary system as well as the original BCN, a necessary and sufficient condition to detect the solvability of the ORP is presented. Second, a method to design the state feedback controls for the ORP is proposed. Finally, two biological examples are given to demonstrate the effectiveness and advantage of the obtained new results.
- 3 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 36 (3) , 5334-5347
Dimensionality Reduction Method for the Output Regulation of Boolean Control Networks
This article proposes a dimensionality reduction approach to study the output regulation problem (ORP) of Boolean control networks (BCNs), which has much lower computational complexity than previous results. First, an auxiliary system which is much smaller in scale than the augmented system in previous approach is constructed. By analyzing the set stabilization of the auxiliary system as well as the original BCN, a necessary and sufficient condition to detect the solvability of the ORP is presented. Second, a method to design the state feedback controls for the ORP is proposed. Finally, two biological examples are given to demonstrate the effectiveness and advantage of the obtained new results.
- 28 November 2023
- Published by Wiley in Asian Journal of Control
- Vol. 26 (3) , 1472-1482
Weighted Nash equilibrium of incomplete‐profile networked evolutionary games with multiple payoffs
This paper investigates the existence and convergence of weighted Nash equilibrium for incomplete‐profile networked evolutionary games with multiple payoffs. First, the incomplete‐profile networked evolutionary game under probabilistic myopic best response adjustment rule is transformed into an algebraic form based on the semi‐tensor product of matrices. Second, a method for calculating weighted Nash equilibrium is presented, and the relationship between weighted Nash equilibrium and positive‐probability fixed point is derived. Furthermore, a criterion is provided to verify whether the profiles in the feasible profile set can converge to the set of weighted Nash equilibriums with probability one. Finally, an illustrative example is given to support the new results obtained in this paper.
- 28 November 2023
- Published by Wiley in Asian Journal of Control
- Vol. 26 (3) , 1472-1482
Weighted Nash equilibrium of incomplete‐profile networked evolutionary games with multiple payoffs
This paper investigates the existence and convergence of weighted Nash equilibrium for incomplete‐profile networked evolutionary games with multiple payoffs. First, the incomplete‐profile networked evolutionary game under probabilistic myopic best response adjustment rule is transformed into an algebraic form based on the semi‐tensor product of matrices. Second, a method for calculating weighted Nash equilibrium is presented, and the relationship between weighted Nash equilibrium and positive‐probability fixed point is derived. Furthermore, a criterion is provided to verify whether the profiles in the feasible profile set can converge to the set of weighted Nash equilibriums with probability one. Finally, an illustrative example is given to support the new results obtained in this paper.
- 1 February 2020
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 21 (2) , 294-303
Optimal one-bit perturbation in Boolean networks based on cascading aggregation
We investigate the problem of finding optimal one-bit perturbation that maximizes the size of the basin of attractions (BOAs) of desired attractors and min
- 1 February 2020
- Published by Zhejiang University Press in Frontiers of Information Technology & Electronic Engineering
- Vol. 21 (2) , 294-303
Optimal one-bit perturbation in Boolean networks based on cascading aggregation
We investigate the problem of finding optimal one-bit perturbation that maximizes the size of the basin of attractions (BOAs) of desired attractors and min
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 25-28
The measurement matrix optimized by information operator improvement
The signal sample tool which is called measurement matrix or observation matrix is very important for the theory of compressive sensing. Decreasing the correlation between any two different columns of the information operator is the basis of the design and optimization of the measurement matrix. Based on it, the non-diagonal elements of the upper triangular matrix of the QR decomposition of information operator was set to zero to increase its minimum singular value and decrease the column correlation of information operator, and thus this method can enhance the performance of the measurement matrix. Experiments illustrate that when the algorithm of this paper is utilized, the recovery error of signals and images are both diminished.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 25-28
The measurement matrix optimized by information operator improvement
The signal sample tool which is called measurement matrix or observation matrix is very important for the theory of compressive sensing. Decreasing the correlation between any two different columns of the information operator is the basis of the design and optimization of the measurement matrix. Based on it, the non-diagonal elements of the upper triangular matrix of the QR decomposition of information operator was set to zero to increase its minimum singular value and decrease the column correlation of information operator, and thus this method can enhance the performance of the measurement matrix. Experiments illustrate that when the algorithm of this paper is utilized, the recovery error of signals and images are both diminished.
- 15 April 2019
- Published by Wiley in Asian Journal of Control
- Vol. 21 (6) , 2532-2542
Minimum time control of large‐scale boolean control networks with constraints
The minimum time control that steers a large‐scale Boolean control network with constraints from an initial state to a given state is investigated. This problem is studied under the partition of the large‐scale Boolean control networks. Based on that, the problem is converted to finding the minimum time control for each subnetwork. Hence, the minimum time control for small size Boolean control networks with constraints is considered firstly. Then, a method to solve the problem for large‐scale Boolean control networks with constraints is presented. Finally, a numerical example on T‐cell receptor kinetics is given to show the effectiveness of the main results.
- 15 April 2019
- Published by Wiley in Asian Journal of Control
- Vol. 21 (6) , 2532-2542
Minimum time control of large‐scale boolean control networks with constraints
The minimum time control that steers a large‐scale Boolean control network with constraints from an initial state to a given state is investigated. This problem is studied under the partition of the large‐scale Boolean control networks. Based on that, the problem is converted to finding the minimum time control for each subnetwork. Hence, the minimum time control for small size Boolean control networks with constraints is considered firstly. Then, a method to solve the problem for large‐scale Boolean control networks with constraints is presented. Finally, a numerical example on T‐cell receptor kinetics is given to show the effectiveness of the main results.
- 9 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 64 (8) , 3129-3140
Block Decoupling of Boolean Control Networks
In this paper, the block decoupling of Boolean control networks is investigated via solving logical matrix equations. First, the definition of block decoupling of Boolean control networks is proposed. Second, the block decoupling problem is equivalently converted into the solvability of a set of logical matrix equations. Subsequently, the approaches to solve these equations are designed, based on which the suitable coordinate transformations and open-loop controllers can be determined. Finally, an illustrative example is given to show the effectiveness of the main results.
- 9 November 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 64 (8) , 3129-3140
Block Decoupling of Boolean Control Networks
In this paper, the block decoupling of Boolean control networks is investigated via solving logical matrix equations. First, the definition of block decoupling of Boolean control networks is proposed. Second, the block decoupling problem is equivalently converted into the solvability of a set of logical matrix equations. Subsequently, the approaches to solve these equations are designed, based on which the suitable coordinate transformations and open-loop controllers can be determined. Finally, an illustrative example is given to show the effectiveness of the main results.
- 15 May 2018
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 16 (3) , 1120-1128
Design of Large-scale Boolean Networks Based on Prescribed Attractors
- 15 May 2018
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 16 (3) , 1120-1128
Design of Large-scale Boolean Networks Based on Prescribed Attractors
- 9 January 2018
- Published by Wiley in Asian Journal of Control
- Vol. 20 (6) , 2185-2194
Input‐Output Decoupling of Boolean Control Networks
This paper is devoted to the input‐output decoupling problem of Boolean control networks (BCNs). First, a necessary and sufficient condition for the existence of comparable output subspaces is obtained as well as an algorithm to construct the comparable output subspaces. Then, two kinds of controllers are designed to solve the decoupling problem, including open‐loop controller and state feedback controller. Finally, an example is given to illustrate the effectiveness of the proposed method.
- 9 January 2018
- Published by Wiley in Asian Journal of Control
- Vol. 20 (6) , 2185-2194
Input‐Output Decoupling of Boolean Control Networks
This paper is devoted to the input‐output decoupling problem of Boolean control networks (BCNs). First, a necessary and sufficient condition for the existence of comparable output subspaces is obtained as well as an algorithm to construct the comparable output subspaces. Then, two kinds of controllers are designed to solve the decoupling problem, including open‐loop controller and state feedback controller. Finally, an example is given to illustrate the effectiveness of the proposed method.