Qinyao Pan

Qinyao Pan

Auto-generated profile, based on publicly available information

Qinyao Pan

School of Mathematics Science, Zhejiang Normal University, Jinhua, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 January 2024 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JZJie Zhong
Jie Zhong
QPQinyao Pan
Qinyao Pan
Wenying XuWenying Xu
Wenying Xu
BCBo Chen
Bo Chen
In this paper, two pinning control ( PC ) schemes are proposed to achieve non-periodical stable behaviors for asynchronous Boolean networks ( BNs ), from the aspects of state transition digraph ( STG ) and dependence digraph ( DD ). Firstly, under the framework of algebraic state space representation of asynchronous BNs , a non-uniform PC is proposed based on STG and feedback vertex set ( FVS ). The non-uniform pinning nodes ( PNs ) are determined under the transformation of certain columns of the state transition matrices. Due to the high computational complexity of using STG , a uniform PC is further proposed based on DD of asynchronous BNs , where PNs are easily found using feedback arc set ( FAS ). Compared with the non-uniform PC with computational complexity $O(n2^{2n})$ ( $n$ is the size of network), the uniform PC has advantages of lower computational complexity $O(n^{2}+n2^{K})$ ( $K$ is the largest indegree of in-neighbors). Finally, simulations on gene networks with different sizes are given to illustrate the effectiveness of the obtained results, that only almost $1\%\sim 33\%$ nodes are needed. Especially, as for a network with 321 genes, only two nodes ( $1\%$ ) are needed, which well reflects the core idea of PC approach.

27 June 2025 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
QPQinyao Pan
Qinyao Pan
Jianquan LuJianquan Lu
Jianquan Lu
AYAmol Yerudkar
Amol Yerudkar
KKKoichi Kobayashi
Koichi Kobayashi
JZJie Zhong
Jie Zhong
In this article, set stabilization in switched Boolean networks is investigated through link augmentations. Link augmentation is introduced as a selective process for adding specific edges between nodes in the wiring digraph of the network. For the implementation of link augmentation, various variables are integrated into the dynamics governing networks, utilizing basic logical operators. A key aspect of this article is the incorporation of additional functions introduced by the link augmentations into the original dynamics of the system using constrained logical operators. Further, several criteria for set stabilization are formulated, and the link augmentation control strategy is innovatively designed, utilizing the Q-learning Algorithm. Finally, a biological example is presented to demonstrate the effectiveness of the proposed methods.

2 December 2024 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
JZJie Zhong
Jie Zhong
QPQinyao Pan
Qinyao Pan
DXDie Xu
Die Xu
BLBowen Li
Bowen Li
NLNing Li
Ning Li
In this paper, the output regulation problem (ORP) of Boolean control networks (BCNs) is studied via the semi-tensor product of matrices, with consideration of probabilistic outputs from the reference Boolean networks (BNs). We first define the concept of mean square error (MSE) between outputs of two BNs, establishing several theoretical results on the solvability of the ORP. Subsequently, state feedback controllers are designed to address the ORP of BCNs under different scenarios. In the first scenario, ORP is addressed by developing control strategies that ensure the system's output remains within a predefined MSE threshold; in the second scenario, we focus on achieving the minimum MSE through the optimization of control strategies; and the final scenario extends the second by conducting a detailed analysis to maintain this minimum MSE uniformly across all state pairs. To conclude, several numerical examples are provided to verify the effectiveness of the proposed theoretical results.

30 August 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JZJie Zhong
Jie Zhong
QPQinyao Pan
Qinyao Pan
Wenying XuWenying Xu
Wenying Xu
Yang LiuYang Liu
Yang Liu
In this paper, asymptotical stabilization of probabilistic Boolean control networks (PBCNs) with a switching signal being an independent identically distributed process has been systematically studied. Here, the binary operators connecting logical functions of state nodes and pinning controllers are constrained to certain sets. By establishing matrix representation of operators and input constraints, several criteria for asymptotical stabilization have been established. The proposed asymptotical stabilization extends the results of Boolean networks (BNs) under static pinning control, which is more practical in real-word control design systems. Finally, simulations are given to verify the effectiveness of the obtained theoretical results.

6 June 2024 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
QPQinyao Pan
Qinyao Pan
JZJie Zhong
Jie Zhong
Tatsuya AkutsuTatsuya Akutsu
Tatsuya Akutsu
Yang LiuYang Liu
Yang Liu
RLRongjian Liu
Rongjian Liu
Stability maintenance in systems refers to the capacity to preserve inherent stability characteristics. In this article, stability maintenance of large boolean networks (BNs) subjected to perturbations is investigated using a distributed pinning control (PC) strategy. The concept of edge removal as a form of perturbation is introduced, and several criteria for achieving global stability are established. Two forms of distributed PCs, one implemented before perturbation occurs and the other after, are introduced. It is noteworthy that the designs of the controllers are solely dependent on the system’s in-neighbors. The proposed method significantly decreases the computational complexity, reducing it from $O(2^{2|\texttt {V}|})$ to $O(|\texttt {V}|+ |\texttt {E}| + \kappa \cdot 2^{K})$ , where $|\texttt {V}|, |\texttt {E}|$ denotes the cardinality of vertices and arcs of the adjacent graph of BN, $\kappa $ is the number of the pinning nodes, and K represents the maximum in-degree of the network. In the worst-case scenario, the computational complexity is bounded by $O(|\texttt {V}|+ |\texttt {E}| + \kappa \cdot 2^{|\texttt {V}|})$ . To validate the effectiveness of the proposed methods, results from multiple gene networks are presented, including a model representing the human rheumatoid arthritis synovial fibroblast, among which only 12 of the 359 nodes are deemed essential.

24 May 2023 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
BLBowen Li
Bowen Li
QPQinyao Pan
Qinyao Pan
JZJie Zhong
Jie Zhong
Wenying XuWenying Xu
Wenying Xu
This brief devotes to investigating the long-run behavior estimation of temporal Boolean networks (TBNs) with multiple data losses, especially the asymptotical stability. The information transmission is modeled by Bernoulli variables, based on which an augmented system is constructed to facilitate the analysis. A theorem guarantees that the asymptotical stability of the original system can be converted to that of the augmented system. Subsequently, one necessary and sufficient condition is obtained for asymptotical stability. Furthermore, an auxiliary system is derived to study the synchronization issue of the ideal TBNs with normal data transmission and TBNs with multiple data losses, as well as an effective criterion for verifying synchronization. Finally, numerical examples are given to illustrate the validity of the theoretical results.