关于布尔控制网络的能观性和能检性的研究现状

布尔(控制)网络是模拟基因调控网络有效的数学模型.该模型将细胞内(或特定一个基因组内)基因与基因之间的相互作用关系量化,系统的状态和函数直接反应基因表达、复制、转录等生命活动,在新的数学工具矩阵半张量积的帮助下,取得了许多优秀成果.近些年,国内外病毒疫情频发,对全球各个方面造成巨大的冲击和损失,病毒检测技术是战“疫”中非常重要的一个环节.鉴于此,总结近年来矩阵半张量积在布尔(控制)网络的能观性和能检性方面取得的一些成果,以便更多学者关注这类问题和方法.首先回顾能观性和能检性的发展历程;然后,从理论角度分析并用网络图呈现4种能观性与3种能检性之间的关系,整理在布尔网络和布尔控制网络中相关的一些重要成果,包括状态反馈、输出反馈、含干扰、含切换等多种情形;最后通过简述能观性和能检性的应用现状展望其未来发展.     

布尔网络的分析与控制——矩阵半张量积方法

布尔网络是描述基因调控网络的一个有力工具. 由于系统生物学的发展, 布尔网络的分析与控制成为生物学与系统控制学科的交叉热点. 本文综述作者用其原创的矩阵半张量积方法在布尔网络的分析与控制中得到的一系列结果. 内容包括: 布尔网络的拓扑结构, 布尔控制网络的能控、能观性与实现, 布尔网络的稳定性和布尔控制网络的镇定, 布尔控制网络的干扰解耦, 布尔 (控制) 网络的辨识,以及布尔网络的最优控制等.     

概率布尔控制网络的弱能控性

本文研究了概率布尔控制网络的弱能控性,系统的弱能控性是概率布尔网络精确能控的一个推广.首先利用矩阵的半张量积和逻辑变量的向量表示,概率布尔控制网络被表示为离散时间动态系统.接着给出概率布尔控制网络弱能控的定义,从离散时间系统的结构矩阵出发,构造了最大概率转移矩阵,矩阵中的元素表示相应状态之间可能发生转移的最大概率,在此基础上研究了概率布尔控制网络的弱能控的条件,同时给出了两个状态弱能达时控制序列的设计算法.最后通过例子进一步解释了弱能控的概念和控制序列设计算法的有效性.     

布尔控制网络的能控性与能观性

利用矩阵的半张量积,布尔控制网络被转化为离散时间系统.本文从离散时间系统的结构矩阵出发,讨论了逻辑控制系统的能控能观性条件,得到了一个新的能控性条件.新的条件简化了原有能控性矩阵的计算复杂性,矩阵的最高阶数由原来的2m+n降到了2n.另外,还得到了检验布尔控制网络能观性的条件.与原有条件相比,新的条件更容易计算检验.最后,给出一个实例,检验给出的能控能观性判断条件的正确性.     

多智能体系统能控性研究进展

能控性问题是多智能体协调控制领域中一个基本又十分重要的研究课题.本文对多智能体系统能控性问题的研究现状进行综述.介绍了多智能体能控性领域的基本问题和特点,并结合智能体自身动力学与邻居交互协议,从拓扑结构角度对该领域当前的研究热点和前沿进行分析阐述.进一步,对结构能控性的研究成果进行归纳总结,并对能观测性、可镇定性和复杂网络能控性等相关问题进行阐述.最后给出了仍需解决的问题和可能的研究方向.     

复杂动态网络环境下控制理论遇到的问题与挑战

以漫谈的方式讨论复杂动态网络环境下传统控制理论所遇到的一些新问题与新挑战. 具体地, 本文首先介绍现代网络科学与工程的背景, 然后讨论复杂动态网络的牵制控制、有向复杂网络的能控性以及"网络的网络"的 建模与控制等三个方面的相关科学研究问题.     

非线性布尔网络系统模糊建模与动态性能分析

针对非线性系统难以精确建模与动态性能分析的基本控制问题,基于模糊动态模型把布尔网络系统理论推广到非线性布尔网络系统,建立了模糊动态布尔网络控制系统的模型。引入模糊动态模型,对非线性布尔网络进行模糊建模,分别建立了非线性布尔网络系统的局部模型和全局模型。从系统的局部意义和全局意义上,对系统进行了能控性、能观性、稳定性等动态性能分析。最后,以多输入多输出的非线性布尔网络系统实例为具体研究对象,建立了系统的局部模型和全局模型,并对动态性能进行了仿真分析,得到了实验结果。实验结果表明,模糊动态布尔网络控制系统对非线性布尔网络系统的建模是有效的,动态性能分析是合理的,对模糊动态布尔网络控制系统的进一步分析有重要意义。     

复杂网络能控性鲁棒性研究进展

研究复杂网络能控性鲁棒性对包括社会网络、生物和技术网络等在内的复杂系统的控制和应用具有重要价值. 复杂网络的能控性是指: 可通过若干控制节点和适当的输入, 在有限时间内将系统状态驱动至任意目标状态. 能控性鲁棒性则是指在受到攻击的情况下, 复杂网络依然维持能控性的能力. 设计具有优异能控性鲁棒性的复杂网络模型和优化实际网络的能控性鲁棒性一直是复杂网络领域的重要研究内容. 本文首先比较了常用的能控性鲁棒性定义及度量, 接着从攻击策略的角度分析了3类攻击的特点及效果, 包括随机攻击、基于特征的蓄意攻击和启发式攻击. 然后比较了常见模型网络的能控性鲁棒性. 介绍了常用优化策略, 包括模型设计和重新连边等. 目前的研究在攻击策略和拓扑结构优化方面都取得了进展, 也为进一步理论分析提供条件. 最后总结全文并提出潜在研究方向.     

受扰布尔控制网络全局可重构分析与状态估计

受扰布尔控制网络的状态转移,因受未知干扰影响而具有不确定性,这对状态观测器设计带来了困难.本文主要研究了受扰布尔控制网络全局可重构性问题,并在此基础上设计状态观测器.首先,将受扰布尔控制模型转化为多个子系统的切换未知布尔控制网络模型,在此基础上,提出了受扰布尔控制网络的4种不同状态集.其次,基于状态集估计方法,对受扰布尔控制网络状态估计问题进行分析.再次,提出有限时间可重构与全局可重构性概念;同时,根据状态集估计与状态转移分析,分别给出有限时间可重构判定算法与全局可重构性证明的充要条件.最后,给出观测器设计方法,并通过例子证明了本文提出方法的可行性.     

航天器控制系统可重构性的内涵与研究综述

可重构性设计是提高航天器在轨运行质量的有效途径,可以从系统层面克服航天器控制系统固有可靠性不足、星上资源受限以及在轨故障不可维修等缺陷,目前已引起控制理论和航天器控制工程等领域的高度重视与广泛关注.本文首先结合航天器控制系统的固有特点,具体介绍可重构性的研究意义与概念内涵.然后从评价与设计两方面,详细梳理航天器控制系统可重构性的研究内容与研究现状.最后对目前可重构性研究领域中存在的一些问题以及未来可能的发展方向进行深入探讨.     

Analysis and control of general logical networks – An algebraic approach

Since Boolean network is a powerful tool in describing the genetic regulatory networks, accompanying the development of systems biology, the analysis and control of Boolean networks have attracted much attention from biologists, physicists, and systems scientists. From mathematical point of view, the dynamics of a Boolean (control) network is a discrete-time logical dynamic process. This paper surveys a recently developed technique, called the algebraic approach, based on semi-tensor product. The new technique can deal with not only Boolean networks, which allow each node to take two values, but also k-valued networks, which allow each node to take k different values, and mix-valued networks, which allow nodes to take different numbers of values.The paper provides a comprehensive introduction to the new technique, including (1) mathematical background of this new technique – semi-tensor product of matrices and the matrix expression of logic; (2) dynamic models of Boolean networks, and general (multi- or mix-valued) logical networks; (3) the topological structure of Boolean networks and general networks; (4) the basic control problems of Boolean/general control networks, which include the controllability, observability, realization, stability and stabilization, disturbance decoupling, identification and optimization, etc.; (5) some other related applications.     

Controllability of Boolean control networks with state-dependent constraints状态依赖约束下布尔网路的能控性

This paper investigates the controllability of Boolean control networks (BCNs) with state-dependent constraints. A kind of input transformation is proposed to transfer a BCN with state-dependent input constraints into a BCN with free control input. Based on the proposed technique, a necessary and sufficient condition for controllability is obtained. It is shown that state-dependent constraints for the state can be equivalently expressed as input constraints. When a BCN has both input and state constraints, there is a possibility that the sets of admissible controls for some states are the empty set. To treat this kind of BCN, a variation of the input transformation is proposed and the problem of controllability is solved. An illustrative example is provided to explain the proposed method and results.     

Controllability of probabilistic Boolean control networks

This paper deals with the controllability of probabilistic Boolean control networks. First, a survey on the semi-tensor product approach to probabilistic Boolean networks is given. Second, the controllability of probabilistic Boolean control networks via two kinds inputs is studied. Finally, examples are given to show the efficiency of the obtained results.     

On controllability and stabilizability of probabilistic Boolean control networks

The controllability of probabilistic Boolean control networks(PBCNs)is first considered.Using the input-state incidence matrices of all models,we propose a reachability matrix to characterize the joint reachability.Then we prove that the joint reachability and the controllability of PBCNs are equivalent,which leads to a necessary and sufcient condition of the controllability.Then,the result of controllability is used to investigate the stability of probabilistic Boolean networks(PBNs)and the stabilization of PBCNs.A necessary and sufcient condition for the stability of PBNs is obtained first.By introducing the control-fixed point of Boolean control networks(BCNs),the stability condition has finally been developed into a necessary and sufcient condition of the stabilization of PBCNs.Both necessary and sufcient conditions for controllability and stabilizability are based on reachability matrix,which are easily computable.Hence the two necessary and sufcient conditions are straightforward verifiable.Numerical examples are provided from case to case to demonstrate the corresponding theoretical results.     

概率布尔控制网络的集可控

本文研究概率布尔控制网络的集可控性问题.首先,利用矩阵半张量积方法,得到概率布尔控制网络的代数表示.其次,借助一个新的算子构造不同的可控矩阵,进而通过可控矩阵考虑自由控制序列和网络输入控制下概率布尔控制网络的集可控性问题,得到了概率布尔控制网络集可控性的充要条件.最后,给出数值例子说明本文结果的有效性.     

Controllability of Boolean control networks with time delays in states

This paper investigates the controllability of Boolean networks with time-invariant delays in states. After a brief introduction on converting the logic dynamics to discrete time delay systems, the controllability via two kinds of controls is studied. One kind of control is generated by Boolean control networks, another kind of control is free Boolean sequences. In both cases, necessary and sufficient conditions of the controllability of Boolean control networks are proved. Finally, examples are given to illustrate the efficiency of the obtained results.     

Controllability and observability of Boolean control networks

The controllability and observability of Boolean control networks are investigated. After a brief review on converting a logic dynamics to a discrete-time linear dynamics with a transition matrix, some formulas are obtained for retrieving network and its logical dynamic equations from this network transition matrix. Based on the discrete-time dynamics, the controllability via two kinds of inputs is revealed by providing the corresponding reachable sets precisely. Then the problem of observability is also solved by giving necessary and sufficient conditions.     

Controllability and observability of state‐dependent switched Boolean control networks with input constraints

This paper investigates the controllability and observability of state‐dependent switched Boolean control networks (SDSBCNs) with input constraints. First, the algebraic form of SDSBCNs is derived via the semi‐tensor product of matrices. Then constrained model‐input‐state (CMIS) matrices are introduced for SDSBCNs with input constraints. On the basis of CMIS matrices, two necessary and sufficient conditions are provided for the controllability and observability. Finally, two examples are given to show the effectiveness of the main results.