Qunxi Zhu

Qunxi Zhu

Auto-generated profile, based on publicly available information

Qunxi Zhu

Research Institute of Intelligent Complex Systems Fudan University China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
26 April 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
QZQunxi Zhu
Qunxi Zhu
Yang LiuYang Liu
Yang Liu
Jianquan LuJianquan Lu
Jianquan Lu
Jinde CaoJinde Cao
Jinde Cao
This note presents further results based on the recent paper [J. Liang, H. Chen, and J. Lam, “An improved criterion for controllability of Boolean control networks,” IEEE Trans. Autom. Control, vol. 62, no. 11, pp. 6012-6018, Nov. 2017]. After some optimizations, the conventional method can be more efficient than the method used in the above paper. We also propose an improved method via combining the well known Tarjan's algorithm and depthfirst search technique for the controllability analysis of Boolean control networks (BCNs). As a result, the computational complexity will not exceed O(N 2 ) with N = 2 n , where n is the number of state-variables in a BCN.

1 January 2018 in SIAM Journal on Control and Optimization
Verified
Journal Article
Closed access
QZQunxi Zhu
Qunxi Zhu
Yang LiuYang Liu
Yang Liu
Jianquan LuJianquan Lu
Jianquan Lu
JCJinde Cao
Jinde Cao
In this paper, we study the optimal control problem of Boolean control networks (BCNs). An optimal input-state transfer graph (OISTG) is defined for BCNs with cost in every stage. Optimal controllers are designed to minimize (or maximize) a given cost (or payoff) function over finite and/or infinite time horizon. In finite time horizon, a sufficient condition is derived for the optimal control problem, and an algorithm with the method of binary decomposition is proposed. Moreover, we prove the existence of optimal control for discounted problems over an infinite time horizon, and a new algorithm is presented to design corresponding optimal controllers. Compared with some existing methods, the new algorithm with OISTG can be used to reduce both space complexity and computational complexity in finding optimal controllers. Numerical examples are presented to illustrate the efficiency of the obtained results.

20 March 2024 in Nature Communications
Verified
Journal Article
Open access
PDF file
XLXin Li
Xin Li
QZQunxi Zhu
Qunxi Zhu
CZChengli Zhao
Chengli Zhao
XDXiaojun Duan
Xiaojun Duan
BZBolin Zhao
Bolin Zhao
Wei LinWei Lin
Wei Lin
Recently, machine learning methods, including reservoir computing (RC), have been tremendously successful in predicting complex dynamics in many fields. However, a present challenge lies in pushing for the limit of prediction accuracy while maintaining the low complexity of the model. Here, we design a data-driven, model-free framework named higher-order Granger reservoir computing (HoGRC), which owns two major missions: The first is to infer the higher-order structures incorporating the idea of Granger causality with the RC, and, simultaneously, the second is to realize multi-step prediction by feeding the time series and the inferred higher-order information into HoGRC. We demonstrate the efficacy and robustness of the HoGRC using several representative systems, including the classical chaotic systems, the network dynamical systems, and the UK power grid system. In the era of machine learning and complex systems, we anticipate a broad application of the HoGRC framework in structure inference and dynamics prediction.

15 June 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
QZQunxi Zhu
Qunxi Zhu
ZGZuguang Gao
Zuguang Gao
Yang LiuYang Liu
Yang Liu
WGWeihua Gui
Weihua Gui
A Boolean control network (BCN) is a discrete-time dynamical system whose variables take values from a binary set 0,1. At each time step, each variable of the BCN updates its value simultaneously according to a Boolean function which takes the state and control of the previous time step as its input. Given an ordered pair of states of a BCN, we define the set of reachable time steps as the set of positive integer k's where there exists a control sequence such that the BCN can be steered from one state to the other in exactly k time steps; and the set of unreachable time steps as the set of k's where there does not exist any control sequences such that the BCN can be steered from one state to the other in exactly k time steps. We consider in this paper the so-called categorization problem of a BCN, i.e., we develop a method, via algebraic graph theoretic approach, to determine whether the set of reachable time steps and the set of unreachable time steps, associated with the given pair of states, are finite or infinite. Our results can be applied to classify all ordered pairs of states into four categories, depending on whether the set of reachable (unreachable) time

1 September 2019 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
PDF file
QZQunxi Zhu
Qunxi Zhu
HMHuanfei Ma
Huanfei Ma
Wei LinWei Lin
Wei Lin
In this article, we focus on a topic of detecting unstable periodic orbits (UPOs) only based on the time series observed from the nonlinear dynamical system whose explicit model is completely unknown a priori. We articulate a data-driven and model-free method which connects a well-known machine learning technique, the reservoir computing, with a widely-used control strategy of nonlinear dynamical systems, the adaptive delayed feedback control. We demonstrate the advantages and effectiveness of the articulated method through detecting and controlling UPOs in representative examples and also show how those configurations of the reservoir computing in our method influence the accuracy of UPOs detection. Additionally and more interestingly, from the viewpoint of synchronization, we analytically and numerically illustrate the effectiveness of the reservoir computing in dynamical systems learning and prediction.

1 January 2023 in Research
Verified
Journal Article
Open access
XLXin Li
Xin Li
QZQunxi Zhu
Qunxi Zhu
CZChengli Zhao
Chengli Zhao
XQXuzhe Qian
Xuzhe Qian
XZXue Zhang
Xue Zhang
Wei LinWei Lin
Wei Lin
Detection in high fidelity of tipping points, the emergence of which is often induced by invisible changes in internal structures or/and external interferences, is paramountly beneficial to understanding and predicting complex dynamical systems (CDSs). Detection approaches, which have been fruitfully developed from several perspectives (e.g., statistics, dynamics, and machine learning), have their own advantages but still encounter difficulties in the face of high-dimensional, fluctuating datasets. Here, using the reservoir computing (RC), a recently notable, resource-conserving machine learning method for reconstructing and predicting CDSs, we articulate a model-free framework to accomplish the detection only using the time series observationally recorded from the underlying unknown CDSs. Specifically, we encode the information of the CDS in consecutive time durations of finite length into the weights of the readout layer in an RC, and then we use the learned weights as the dynamical features and establish a mapping from these features to the system’s changes. Our designed framework can not only efficiently detect the changing positions of the system but also accurately predict the intensity change as the intensity information is available in the training data. We demonstrate the efficacy of our supervised framework using the dataset produced by representative physical, biological, and real-world systems, showing that our framework outperforms those traditional methods on the short-term data produced by the time-varying or/and noise-perturbed systems. We believe that our framework, on one hand, complements the major functions of the notable RC intelligent machine and, on the other hand, becomes one of the indispensable methods for deciphering complex systems.