.png){kind=icon}
.png){kind=icon}
Return
Maximum-Likelihood State Estimators in Probabilistic Boolean Control Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TCYB.2021.3127880.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study addresses state estimation problems for probabilistic Boolean control networks (PBCNs). Compared with deterministic Boolean networks, PBCNs have the stochastic switching in logical update functions in the state equation. Consequently, statistical analysis is required to estimate unavailable states, which induces an optimization problem called maximum-likelihood estimation. This article mainly focuses on two scenarios: 1) state estimation from partially measured state and 2) state estimation from output data, meaning observer design. The resulting optimization problems are solved using efficient algorithms based on dynamic programming. Concurrently, Dijkstra-type algorithms, which solve equivalent shortest path problems, are also proposed using best-first search. Furthermore, both the proposed algorithms derive novel observer design methods for PBCNs. The proposed algorithms are evaluated with practical estimation problems aiming to the sensor reduction and applied to gene regulatory networks of apoptosis and Lac operon.
Keywords:
Optimization
Maximum likelihood estimation
Mathematical models
Switches
Probabilistic logic
Optimal control
Observers
Gene regulatory networks
maximum-likelihood estimation
optimal control
probabilistic Boolean control networks (PBCNs)
semitensor product (STP) of matrices
shortest path problem
Journal
IF:
10.5
Papers:
1.1W
Citations:
5.0W