Optimal Control of Boolean Control Networks

Fornasini, Ettore; Valcher, Maria Elena

doi:10.1109/tac.2013.2294821

Cited by 236 publications

(92 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…However, there are various subtypes in asynchronous BNs [9], and there is no widely-used control model of asynchronous BNs. On the other hand, many studies have been done on controllability of synchronous BNs [2,17,28,49,50,60,84]. Therefore, in order to make use of the established control models, we focus on synchronous BNs in this paper.…”

Section: Introductionmentioning

confidence: 99%

Finding and Analyzing the Minimum Set of Driver Nodes in Control of Boolean Networks

Hou

Tamura

Ching

et al. 2016

Advs. Complex Syst.

View full text Add to dashboard Cite

We study the minimum number of driver nodes control of which leads a Boolean network (BN) from an initial state to a target state in a specified number of time steps. We show that the problem is NP-hard and present an integer linear programming-based method that solves the problem exactly. We mathematically analyze the average size of the minimum set of driver nodes for random Boolean networks with bounded in-degree and with a small number of time steps. The results of computational experiments using randomly generated BNs show good agreements with theoretical analyses. A further examination in realistic BNs demonstrates the efficiency and generality of our theoretical analyses.

show abstract

Section: Introductionmentioning

confidence: 99%

Finding and Analyzing the Minimum Set of Driver Nodes in Control of Boolean Networks

Hou

Tamura

Ching

et al. 2016

Advs. Complex Syst.

View full text Add to dashboard Cite

show abstract

“…This approach has proved useful for studying control problems of Boolean networks, including controllability and observability [2], [14], [8]; controller design [15], [20]; identification and model construction [4]; optimal control [13], [21], [9]; stability and stabilization [5]; coloring and multi-agent systems [19]; circuit design [6]; etc.…”

Section: Introductionmentioning

confidence: 99%

Receding Horizon Based Feedback Optimization for Mix-Valued Logical Networks

Cheng

Zhao

2015

IEEE Trans. Automat. Contr.

View full text Add to dashboard Cite

The optimization of mix-valued probabilistic logical networks is a natural extension of optimization of Boolean networks. In this study we have first obtained a recursive solution for the finite horizon case. Then we have proved that when the filter length is large enough, the obtained optimal control sequence coincides with the one for the infinite horizon case using the reeding horizon technique. This result turns searching an infinite sequence of controls into finding an optimal feedback matrix by solving a finite horizon optimization problem. As examples, its applications to human-machine game and to metastatic melanoma are investigated.Index Terms-Mix-valued logical network, optimization, discount factor, receding horizon control.0018-9286 (c)

show abstract

“…가능성, 관측가능성 등 기본적인 제어 공학 문제에서부터 불리언 네트워크 최적 제어(optimal control), 불리언 제어 네트워크의 동정화(identification) 등 다양한 주제에 대한 이론적 연구 결과 들이 발표되었다 [7]- [9]. 본 논문에서는 STP 연산을 이용하여 주어진 불리언 네트워크 의 안정화를 이루기 위한 정적 제어(static control) 기법을 제안 한다.…”

unclassified

“…본 논문에서는 STP 연산을 이용하여 주어진 불리언 네트워크 의 안정화를 이루기 위한 정적 제어(static control) 기법을 제안 한다. 본 논문에서 추구하는 연구와 기존 연구 결과 [6]- [9] • ℝ은 실수의 집합을 나타내며, m×n차원 실수 행렬의 집합 은 ℝ m×n 로 표기한다.…”

unclassified

Static Control of Boolean Networks Using Semi-Tensor Product Operation

Park¹,

Yang²

2017

The Transactions of The Korean Institute of Electrical Engineer

View full text Add to dashboard Cite

-In this paper, we investigate static control of Boolean networks described in the framework of semi-tensor product (STP) operation. The control objective is to determine control input nodes and their logical values so as to stabilize the considered Boolean network to a desired fixed point or cycle. Using topology of Boolean networks such as incidence matrix and hub nodes, a set of appropriate control input nodes is selected, and based on STP operations, we assign constant control inputs so that the controlled network can converge to a prescribed fixed point or cycle. To validate applicability of the proposed scheme, we conduct a numerical study on the problem of determining control input nodes for a Boolean network representing hierarchical differentiation of myeloid progenitors.

show abstract

Optimal Control of Boolean Control Networks

Cited by 236 publications

References 28 publications

Finding and Analyzing the Minimum Set of Driver Nodes in Control of Boolean Networks

Finding and Analyzing the Minimum Set of Driver Nodes in Control of Boolean Networks

Receding Horizon Based Feedback Optimization for Mix-Valued Logical Networks

Static Control of Boolean Networks Using Semi-Tensor Product Operation

Contact Info

Product

Resources

About