Optimal control of Boolean control networks with average cost: A policy iteration approach

Wu, Yuhu; Sun, Xi‐Ming; Zhao, Xudong; Shen, Tielong

doi:10.1016/j.automatica.2018.11.036

Cited by 155 publications

(69 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…During the past few decades, the dynamical networks have been extensively applied to the modeling in a wealth of areas such as air cooperative monitoring, seismic sensing, target tracking and so forth, see, e.g., [1][2][3][4][5][6] for more details. Accordingly, a wireless sensor network (WSN) comprises a majority of intelligent nodes, which are capable of sensing, monitoring, collecting data information, and communicating with their adjacent nodes at the same time.…”

Section: Introductionmentioning

confidence: 99%

Distributed extended Kalman filtering for state-saturated nonlinear systems subject to randomly occurring cyberattacks with uncertain probabilities

Chen

et al. 2020

Adv Differ Equ

View full text Add to dashboard Cite

In this paper, the extended Kalman filtering scheme in a distributed manner is presented for state-saturated nonlinear systems (SSNSs), where the randomly occurring cyberattacks (ROCAs) with uncertain occurring probabilities (UOPs) are taken into account. In particular, a novel cyberattack model is constructed by the consideration of false data-injection attacks (FDIAs) and denial-of-service attacks (DoSAs) simultaneously. The ROCAs are described by a series of Bernoulli distributed stochastic variables, where the so-called UOPs are considered and described by the nominal mathematical expectations and error bounds. The major effort is to develop a novel DEKF strategy for SSNSs with consideration of state delay and ROCAs with UOPs. In what follows, an upper bound with respect to the filtering error covariance is derived and minimized by selecting the suitable filter parameter. Besides, the concrete expression of the filter parameter is formed by solving matrix difference equations (MDEs). Meanwhile, a sufficient condition under certain constraints is proposed to testify the boundedness regarding the given upper bound. Finally, we use the experiments and corresponding comparisons to verify the feasibility of the designed extended Kalman filtering approach in a distributed way.

show abstract

Section: Introductionmentioning

confidence: 99%

Distributed extended Kalman filtering for state-saturated nonlinear systems subject to randomly occurring cyberattacks with uncertain probabilities

Chen

et al. 2020

Adv Differ Equ

View full text Add to dashboard Cite

show abstract

“…Recently, Cheng [8] has pioneered an algebraic state space representation (ASSR) method to study Boolean networks [9], [24], [26], [52], [58], probabilistic Boolean networks [10], [14], [31], [36] and evolutionary games [11]. Using this effective mathematical tool, several fundamental issues have been properly solved for Boolean networks and probabilistic Boolean networks, including state estimation [3], controllability and observability [13], stability and stabilization [27], [30], optimal control [18], [46], and so on. Since then, the study of controllability has made rapid progress and achieved fruitful results.…”

Section: Introductionmentioning

confidence: 99%

Finite-Time Controllability and Set Controllability of Impulsive Probabilistic Boolean Control Networks

Wang

Liu

2020

IEEE Access

View full text Add to dashboard Cite

This paper addresses the finite-time controllability and set controllability of impulsive probabilistic Boolean control networks (IPBCNs). Firstly, using the algebraic state space representation (ASSR) method, the transition probability matrix of IPBCNs is established. Secondly, a kind of finite step reachability matrix with probability one is constructed, based on which, several effective criteria are proposed for the finite-time controllability with probability one of IPBCNs. Thirdly, a necessary and sufficient condition is presented for the finite-time set controllability with probability one of IPBCNs by constructing the set controllability probability distribution vector. Finally, the obtained results are extended to switching topology case.

show abstract

“…Recently, Cheng et al [9] have presented a generalized matrix product called semi-tensor product (STP). Owing to this technique, a considerable amount of studies have been inspired and several classical control problems have been extensively investigated in BCNs, including but not limited to stabilization and set stabilization [10][11][12][13][14][15][16][17][18][19][20], reachability and controllability [21][22][23], observability [24], synchronization [25,26], function perturbation [27], as well as several other problems [28][29][30][31][32]. The main idea of the STP approach is to convert the logical dynamic of a BN (BCN) into a normal discrete-time linear (bilinear) system.…”

Section: Introductionmentioning

confidence: 99%

Stabilization of logical control networks: an event-triggered control approach

Zhu

Liu

Lou

et al. 2019

Sci. China Inf. Sci.

View full text Add to dashboard Cite

This paper investigates the global stabilization problem of k-valued logical control networks (KVLCNs) via event-triggered control (ETC), where the control inputs only work at several certain individual states. Compared with traditional state feedback control, the designed ETC approach not only shortens the transient period of logical networks but also decreases the number of controller executions. The content of this paper is divided into two parts. In the first part, a necessary and sufficient criterion is derived for the event-triggered stabilization of KVLCNs, and a construction procedure is developed to design all timeoptimal event-triggered stabilizers. In the second part, the switching-cost-optimal event-triggered stabilizer is designed to minimize the number of controller executions. A labeled digraph is obtained based on the dynamic of the overall system. Utilizing this digraph, we formulate a universal and unified procedure called the minimal spanning in-tree algorithm to minimize the triggering event set. Furthermore, we illustrate the effectiveness of obtained results through several numerical examples.

show abstract

Optimal control of Boolean control networks with average cost: A policy iteration approach

Cited by 155 publications

References 23 publications

Distributed extended Kalman filtering for state-saturated nonlinear systems subject to randomly occurring cyberattacks with uncertain probabilities

Distributed extended Kalman filtering for state-saturated nonlinear systems subject to randomly occurring cyberattacks with uncertain probabilities

Finite-Time Controllability and Set Controllability of Impulsive Probabilistic Boolean Control Networks

Stabilization of logical control networks: an event-triggered control approach

Contact Info

Product

Resources

About