arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1908.02019math.OC
收藏

布尔控制网络的时域最优控制:统一图论方法

Finite-Horizon Optimal Control of Boolean Control Networks: A Unified Graph-Theoretical Approach

Shuhua Gao, Changkai Sun, Cheng Xiang, Kairong Qin, Tong Heng Lee

摘要:

从图论的角度研究布尔控制网络的有限时域最优控制问题。我们首先制定两个一般性的问题,以统一各种特殊情况下,在文献中研究:(i)地平线长度是$\textit{a priori}$固定的;(ii)地平线长度是未指定的,但有限的给定的目的地状态。值得注意的是,这两个问题可以纳入时变成本,这是很少考虑在现有的工作,和各种限制。在较弱的假设下,分析了最优控制序列的存在性.基于BCN的有限状态空间和有限控制空间,我们在图论框架下以直观和有效的方式研究了这两个一般问题。给出了带权的状态转移图及其时间扩展变体,严格证明了FHOC问题与特定图中的最短路问题的等价性.两个定制的算法开发,以找到最短路径,并构造最优控制序列具有较低的时间复杂度,虽然在技术上,一个经典的最短路径算法在图论是足够的所有问题。与现有的代数方法相比,我们的图论方法可以实现最先进的时间效率,同时针对最一般的问题。此外,我们的方法是第一个能够解决问题(ii)与时变成本。最后,以$\textit{E. coli}$中的Ara操纵子遗传网络为例,验证了该方法的有效性,两个任务的结果表明,该方法可以显著减少运行时间.

英文摘要:

This paper investigates the finite-horizon optimal control (FHOC) problem of Boolean control networks (BCNs) from a graph theory perspective. We first formulate two general problems to unify various special cases studied in the literature: (i) the horizon length is $\textit{a priori}$ fixed; (ii) the horizon length is unspecified but finite for given destination states. Notably, both problems can incorporate time-variant costs, which are rarely considered in existing work, and a variety of constraints. The existence of an optimal control sequence is analyzed under mild assumptions. Motivated by BCNs' finite state space and control space, we approach the two general problems in an intuitive and efficient way under a graph-theoretical framework. A weighted state transition graph and its time-expanded variants are developed, and the equivalence between the FHOC problem and the shortest path problem in specific graphs is established rigorously. Two custom algorithms are developed to find the shortest path and construct the optimal control sequence with lower time complexity, though technically a classical shortest-path algorithm in graph theory is sufficient for all problems. Compared with existing algebraic methods, our graph-theoretical approach can achieve state-of-the-art time efficiency while targeting the most general problems. Furthermore, our approach is the first one capable of solving Problem (ii) with time-variant costs. Finally, the Ara operon genetic network in $\textit{E. coli}$ is used as a benchmark example to validate the effectiveness of our approach, and the results of two tasks show that our approach can dramatically reduce the running time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑