一类离散非方广义系统的能控性与能观性

本文针对一类离散非方广义系统模型,引入乘子得到其逆等矩阵模型,并进一步判断该类系统模型的完全能控性、能达能控性、完全能观性、能达能观性以及之间的对偶关系。     

高阶系统方法—Ⅲ.能观性与观测器设计

平行于第Ⅰ部分中提出的非线性系统的全驱性概念, 本文提出了非线性系统的全量测性概念.首先给出了非线性系统的一种能观规范型, 并证明了任何与该类非线性系统能观规范型等价的系统, 以及任何能观的线性系统, 都等价于一个高阶全量测系统.然后据此提出了一般动态系统的完全能观性定义, 同时指出线性系统的完全能观性等同于其通常意义下的能观性.最后提出了非线性全量测系统观测器设计的一种简洁方法.基于这种设计, 可以使观测误差系统为线性定常系统, 并且可以任意配置其特征多项式的系数矩阵.     

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

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

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

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

广义系统中的非动态变量

本文深入考察了广义系统的特有现象——非动态变量及其在系统等价、能控能观性和实现问题等方面的影响,得到了一些新见解和新结果。     

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

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

互联大系统能控能观性模型简化

不能控不能观系统可以集结成为一个能观但不能控的系统,这是传统的结论。本文提出一种旨在改变系统结构的新集结方法,可以把不能控和/或不能观系统集结成为具有相同输入输出关系且能控能观系统。并利用此结果对互联大系统进行分散能控能观性模型简化,并且给出若干重要理论结果和算法。     

非线性控制系统的特性（I）

本文采用与线性系统理论相比较的方法，阐述非线性控制系统理论。文中通过一些例子来分析非线性控制系统在能控性，能观性，抗干扰性，解耦和稳定性等方面的特性，从而进一步说明非线性控制系统理论在提法，论述和结论上的特点。第一部分介绍非线性系统的能控性和能观性。     

状态变量方程辨识Cauer热模型参数的方法

绝缘栅双极性晶体管IGBT模块热网络与可靠性密切相关。Cauer模型简单直观,为了得到模型中各元件的参数,提出一种基于现代控制理论中任意系统转换为能观标准型的一般方法,将模型的一般的状态空间表达式通过矩阵变换的方法转换为特殊的能观标准型。通过实验或仿真得到系统的传递函数,将传递函数与能观标准型进行比较,可以得到若干个方程组并求解得到所需的元件参数。通过仿真验证了该方法的可行性。     

广义代数Riccati方程和最优调节器的研究

利用能稳性和精确能观性, 对广义代数Riccati方程和相关的随机最优调节器问题进行了深入的研究. 对广义代数Riccati方程得到了下列结果: 如果随机系统既是能稳定的又是精确能观的, 则广义代数Riccati方程有一个最大解, 同时也是一个反馈镇定解. 在精确能观性的假设下, 广义代数Riccati方程的所有非负定解(如果存在的话)必是正的反馈镇定解. 作为应用, 最优调节器问题, 广义代数Riccati方程的最大解, 反馈镇定解三者之间的关系获得了澄清. 所有这些结果在随机控制和随机稳定性理论中是有     

Memoryless output feedback nullification and canonical forms,for time varying systems

We study the possibility of nullifying time-varying systems with memoryless output feedback. The systems we examine are discrete-time linear single-input single-output finite-dimensional time-varying systems. For generic completely controllable and completely observable discrete-time systems, we show that any state at any time can be steered to the origin within finite time. An algorithm for nullification and an upper bound for nullification time, depending only on the system's dimension, are provided. The algorithm is described using a representation of the system in time-varying controller canonical form. We verify that every completely controllable system has such a representation.     

Derivation of completely controllable and completely observable state models for multimachine power system stability studies†

The object of the present paper is to develop state models for multimachine power system stability studies which are completely controllable and completely observable. They are necessary for any stability studies based on the second method of Lyapunov. Starting from the definition of the degree of a rational function matrix, the minimal realizations for a two- and three-machine power system with uniform and nonuniform damping are obtained and are shown to be completely controllable and completely observable. A generalization for an H-machine power system follows as a natural consequence. Further, the present work provides the theoretical basis for the proper choice of state variables, i.e. relative rotor angles instead of absolute rotor angles as state variables.     

On the application of minimum principle for solving partially observable risk-sensitive control problems

This paper is concerned with the application of a minimum principle derived for general nonlinear partially observable exponential-of-integral control problems, to solve linear-exponential-quadratic-Gaussian problems. This minimum principle is the stochastic analog of Pontryagin's minimum principle for deterministic systems. It consists of an information state equation, an adjoint process governed by a stochastic partial differential equation with terminal condition, and a Hamiltonian functional. Two methods are employed to obtain the optimal control law. The first method appeals to the well-known approach of completing the squares, by first determining the optimal control law that minimizes the Hamiltonian functional. The second method provides significant insight into relations with the HamiltoniJacobi approach associated with completely observable exponential-of-integral control problems. These methods of solution are particularly attractive because they do not assume a certainty equivalence principle, hence they can be used to solve nonlinear problems as well.     

大系统的动态递阶控制

本文提出了一种镇定线性大系统的动态递阶控制新方案.对于分散控制线性大系统,如 果是可控可观的,则可以设计一个上一层系统,并能确定它的最小维数,使所产生的新系统在 递阶控制下无固定模,从而能够得到一个协调控制器,使整个闭环系统能任意配置极点.这种 新的大系统动态递阶控制具有实际意义,其递阶控制器的设计也简单易行.     

一种有效的频繁项双空间挖掘方法

给出了一种有效的频繁项双空间挖掘方法,充分利用事务数据库的二元特性,通过双空间映射把数据库的项目维和事务维联系在一起,提高了频繁项集的挖掘效率。计算机实验数据表明,双空间搜索挖掘方法对频繁项的数据挖掘是非常有效的,与传统的Apriori方法相比,新方法对数据扩散率和频繁项长短(最小支持度变化)均不敏感,挖掘效率提高很多。     

F-粗积分与系统S-粗状态检测-识别

函数单向S-粗集对偶生成的F-粗积分具有一系列动态特性,在此基础上提出了F-粗积分的度量——F-粗扩张度与F-粗扩张率的概念及属性施效识别原则。函数单向S-粗集对偶的变化程度不仅可以得到量化,而且对系统在离散的时间区间上的S-粗状态也可进行检测-识别。这是一个新的研究方向。     

具有7-(8,0)型自同构的二元双偶极值码

把长度为56的具有7-(8,0)型自同构的二元双偶极值码看成二元域上的多项式,分解成一个收缩码和一个偶重量多项式的直和。利用已知的码长较短的编码构造出长度为56的具有7-(8,0)型自同构的二元双偶极值码,并给出可能的生成矩阵。由于该双偶极值码的最小距离为12,根据两个码等价的类型,对生成矩阵运行Matlab程序,证明了在等价情况下,当E1(σ)*的维数K=2时,不存在有7-(8,0)型自同构的二元双偶极值码;当E1(σ)*的维数K=4时,有7-(8,0)型自同构二元双偶极值码共75种。对长度为56到70的具有类似型自同构的双偶极值码进行相似讨论,得到了其生成矩阵和分类情况。至此,长度在50到70之间的二元双偶极值码的生成矩阵和分类情况得到完全解决。     

Toward an Infinitary Logic of Domains: Abramsky Logic for Transition Systems

We give a new characterization of sober spaces in terms of their completely distributive lattice of saturated sets. This characterization is used to extend Abramsky's results about a domain logic for transition systems. The Lindenbaum algebra generated by the Abramsky finitary logic is a distributive lattice dual to an SFP-domain obtained as a solution of a recursive domain equation. We prove that the Lindenbaum algebra generated by the infinitary logic is a completely distributive lattice dual to the same SFP-domain. As a consequence soundness and completeness of the infinitary logic is obtained for a class of transition systems that is computational interesting.     

Uncertainty principle guarantees genuine source of intrinsic randomness

The Born’s rule introduces intrinsic randomness to the outcomes of a measurement performed on a quantum mechanical system. But, if the system is prepared in the eigenstate of an observable, then the measurement outcome of that observable is completely predictable, and hence, there is no intrinsic randomness. On the other hand, if two incompatible observables are measured (either sequentially on a particle or simultaneously on two identical copies of the particle), then uncertainty principle guarantees intrinsic randomness in the subsequent outcomes independent of the preparation state of the system. In this article, we show that this is true not only in quantum mechanics but for any no-signaling probabilistic theory. Also the minimum amount of intrinsic randomness that can be guaranteed for arbitrarily prepared state of the system is quantified by the amount of (un)certainty.     

A separation principle for a class of non-UCO systems

This paper introduces a new approach to output feedback stabilization of single-input-single-output systems which, unlike other techniques found in the literature, does not use quasilinear high-gain observers and control input saturation to achieve separation between the state feedback and observer designs. Rather, we show that by using nonlinear high-gain observers working in state coordinates, together with a dynamic projection algorithm, the same kind of separation principle is achieved for a larger class of systems which are not uniformly completely observable. By working in state coordinates, this approach avoids using knowledge of the inverse of the observability mapping to estimate the state of the plant, which is otherwise needed when using high-gain observers to estimate the output time derivatives.