有界区域上Petrowsky系统的能控性和能稳性

利用D.L.Russel关于“能稳性导致能控性”的论断,研究Petrow sky系统的能控性,首先取线性反馈控制,得到线性反馈Petrow sky系统的能量的指数衰减,从而由D.L.Russel的“能稳性导致能控性”的论断得到能控性.其次取非线性反馈控制,得到Petrow sky系统的一些能量估计,但是不能得到指数能稳.     

高阶系统方法—Ⅱ.能控性与全驱性

本文首先简述了基于状态空间模型的一阶动态系统的能控性进展, 指出了一阶系统方法中卡尔曼能控性体系的一些问题.然后证明了线性定常系统能控的充要条件是它能化成一个高阶全驱系统, 同时还在一定程度上将这一结果推广到非线性系统的情形.基于这一发现, 本文定义了一般动态系统的完全能控性, 明确其意义在于存在控制律使得闭环系统为一线性定常的高阶系统, 并且可以任意配置闭环特征多项式的系数矩阵, 同时还指出其多方面相关结论.     

广义区间动力系统的能控性

讨论了广义区间动力系统正则性、I-能控与C-能控问题.由于上述问题等价于判别某 个区间矩阵为列满秩,首先得到判别区间矩阵为列满秩的充分条件与充分必要条件,进一步得 到了判别广义区间系统为正则的充分必要条件、I-能控的充分条件与C-能控的充分必要条件. 通过数值实例说明所得到的结果相对于已有结果更具有一般性及有效性.由对偶原理,得到相 应的能观性的判据.     

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

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

二阶分布参数系统的稳定性和能控性

讨论Hilbert空间上两个二阶线性系统的稳定性和能控性,在较一般的假设下,得到了 这两个系统的指数稳定性和精确能控性,渐近稳定性和近似能控性之间的关系.最后,给出 线性系统渐近稳定的一个充分必要条件.     

广义系统的能控、能观性判别条件

该文讨论广义系统能控、能观性问题,给出了广义系统能控和能观性一种新的判别条件.     

扩展时间事件图的能达性与能控序列

利用图论方法在双子结构中研究扩展时间事件图的某些问题,获得了能达性的一个充分必要条件和基于能达性的标准结构。在此基础上,把监控理论中的能控序列的分量分为本质不同的３类,进而得到能控序列的简化求解方法。     

高维拟线性抛物系统能控性的近期进展

本文综述高维拟线性抛物型方程、拟线性复Ginzburg-Landau方程以及只含一个控制变量的高维耦合拟线性抛物型方程组的能控性方面的一些近期的结果.通过使用不动点技术,采用主部具有C1系数的线性抛物型方程或方程组一些新的精细的Carleman估计.这一方法的要点是在古典解的框架下考虑能控性问题,并且当给定的数据具有一定的正则性时,线性抛物型方程或方程组在H¨older空间中来选取控制函数.利用类似的方法,还建立了拟线性抛物型方程不灵敏控制的存在性,其关键是将不灵敏问题转化为由拟线性抛物型方程和线性抛物型方程构成的耦合方程组在单个控制下一个非标准的能控性问题.     

Hilbert空间中广义分布参数系统的精确能控性

首先,应用泛函分析和算子理论研究了Hilbert空间中广义算子半群的一些性质,并应用广义算子半群理论给出了Hilbert空间中广义分布参数系统的解的存在唯一性及解的构造性表达式;其次,应用泛函分析及广义算子半群理论讨论了Hilbert空间中广义分布参数系统的精确能控性。给出了精确能控的必要及充分条件。说明了广义分布参数系统精确能控性和稳定性之间的关系。所得结果对广义分布参数的研究有重要的理论意义。     

周期性系统的能控性理论

主要探讨周期性系统(包括连续和离散两种情形)的能控性问题，对文献中有关周期为To的连续周期性系统的能控性结论进行了完善，推导出系统能控等价于单周期(0，To)内能控的结论，并将这些结论直接推广到离散周期性系统；然后讨论了离散前后周期性系统能控性保持不变的可能性，证明在采用不等间距采样方式时，离散前后周期性系统的能控性保持不变。     

On Near‐controllability of Discrete‐time Upper‐triangular Bilinear Systems with Applications to Controllability

Near‐controllability is defined for those systems that are uncontrollable but have a large controllable region. It is a property of nonlinear control systems introduced recently, and it has been demonstrated on two classes of discrete‐time bilinear systems. This paper studies near‐controllability of discrete‐time upper‐triangular bilinear systems, which are uncontrollable and are more general than the two classes mentioned. A necessary and sufficient condition for the systems in dimension two to be nearly controllable is presented, which covers the existing results. For the systems with high dimensions, necessary conditions and sufficient conditions of near‐controllability are provided, which generalize the existing results. In particular, the obtained near‐controllability results are applied to controllability of discrete‐time bilinear systems. An example also is given to demonstrate the effectiveness, which shows that the controllability problems of discrete‐time bilinear systems can be solved by near‐controllability.     

Controllability of multiagent systems based on path and cycle graphs

This paper studies the controllability of multiagent systems based on path and cycle graphs. For paths or cycles, sufficient and necessary conditions are presented for determining the locations of leaders under which the controllability can be realized. Specifically, the controllability of a path is shown to be determined by a set generated only from its odd factors, and the controllability of a cycle is determined by whether the distance between 2 leaders belongs to a set generated from its even (odd) factors when the number of its nodes is even (odd). For both graphs, the dimension of the controllable subspace is also derived. Moreover, the technique used in the derivation of the above results is further used to get sufficient and necessary conditions for several different types of graphs generated from path and cycle topologies. These types of graphs can be regarded as typical topologies in the study of multiagent controllability, and accordingly the obtained results have meaningful enlightenment for the research in this field.     

异构多无人机网络化协同控制系统的可控性

研究具有Leader-Follower结构和分布式通信拓扑的异构多无人机网络化分布式协同控制系统的可控性问题. 基于同构网络的受控一致性思想建立了异构多飞行器网络控制系统的动态模型; 并针对该动态模型的不同形式, 基于代数图论和传统的控制理论, 分别得到了异构多无人机网络化协同控制系统的可控性条件, 尤其是可控性与该网络化系统中通信拓扑之间的关系; 然后分析且提出了改善系统可控性的可行性方法. 最后仿真结果验证了本文相关结论的正确性.     

Controllability for a Class of Parallelly Connected Polynomial Systems

Null controllability for a class of parallelly connected discrete-time polynomial systems is considered. We prove for this class of systems that a necessary and sufficient condition for null controllability of the parallel connection is that all its subsystems are null controllable. Consequently, the controllability test splits into a number of easy-to-check tests for the subsystems. The test for complete controllability is also presented and it is subtly different from the null controllability test. A similar statement is then given for complete controllability of a class of parallelly connected continuous-time polynomial systems. The result is somewhat unexpected when compared with the classical linear systems result. We identify the phenomenon which shows the difference between the linear and nonlinear cases. Date received: January 22, 1997. Date revised: January 14, 1998.     

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

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

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.     

On controllability of a class of discrete‐time homogeneous bilinear systems with solvable controls

This paper studies the controllability of a class of discrete‐time homogeneous bilinear systems. Necessary and sufficient conditions for the controllability are obtained. In particular, an algorithm for computing the controls, which achieve given states transition, for the controllable systems is given with examples. Furthermore, the necessary and sufficient conditions are applied to present four cases of the change of the controllability for Euler discretization, which show that Euler discretization may and may not change the controllability of nonlinear systems. Copyright © 2011 John Wiley & Sons, Ltd.