.png){kind=icon}
.png){kind=icon}
Return
Kullback-Leibler Control in Boolean Control Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2023.3292819.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article addresses the Kullback-Leibler (KL) control problem in Boolean control networks. In the considered problem, an extended stage cost function depending on the control inputs is introduced; in contrast to a stage cost of the conventional KL control problems in the Markov decision process cannot take into consideration the control inputs. An associated Bellman equation and a matrix-based iteration algorithm are presented. The theoretical analysis shows that the proposed KL control results in an approximated form of conventional dynamic programming (DP). Furthermore, the convergence analysis is presented, with the weight parameter converging to zero and diverging to infinity. In practical application examples, a comparison of the conventional DP and proposed KL control is illustrated.
Keywords:
Boolean control networks (BCNs)
convergence analysis
gene regulatory networks
Kullback-Leibler (KL) control
optimal control
semi-tensor product (STP) of matrices
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W