一类线性切换系统能控性和能达性的充要条件

给出一类线性切换系统能控制,能达性的充分必要条件,此类系统的特征是具有相同的系统矩阵和不同的输入矩阵。     

线性定常系统的δ－算子描述──能控性与能稳性*

本文讨论了δ－算子描述下的线性定常系统的能控性与能稳性问题。研究结果表明：虽然两种描述（即传统的ｑ－算子描述和本文讨论的δ－算子描述）方法下的能控性定义及判据形式上并无二致，然而在高速采样的条件下，两种描述方法下的系统的能控度与能稳度呈现出完全相反的特性，一般而言，δ－算子描述方法更加适合高速采样情形。     

一类混合动态系统的能控性和能观性研究

针对一类混合动态系统--周期型线性切换系统,给出系统能控性、能观性的充分必要条件,并通过例子加以验证.     

一类混合动态系统的能控性和能观性研究

针对一类混合动态系统———周期型线性切换系统, 给出系统能控性、能观性的充分必要条件, 并通过例子加以验证.     

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

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

线性时变广义系统的能控性与能观性问题

讨论了线性时变系统和线性时变广义系统的两个基本问题, 得到了两种判定时变系统能控性与能观性的必要条件, 该判定条件只依赖于系统矩阵A(t)和输入矩阵B(t), 不必计算系统的系统状态转移矩阵, 使得判别时变系统能控性与能观性易于实现. 说明了本文结论是线性定常系统相应结论的自然扩展. 对进一步深入研究时变系统和时变广义系统具有实际启发作用.     

周期性系统的能控性理论

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

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

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

感应电动机系统的能控性与能观测性分析

分析了感应电动机系统的能控性与能观测性。结果表明系统是弱能控与弱能观的。而且,采用非线性状态反馈解耦控制和非线性坐标变换后的局部闭环解耦线性系统是能控与能观的。     

关于非线性系统的对程性、可达性与可控性*

本文讨论对称及广义对称非线性系统的可达性与可控性。文中证明了如果广义对称系统在一点的邻域可控,那么系统在包含该点群作用轨道的一个开集上是可控的。利用广义对称性还给出了控制律的原则算法。对于对称系统,给出了可控性的充要条件。     

On Controllability of Switched Linear Systems

This paper investigates the number of switchings and design of switching sequences for controllability of switched linear systems. Two related results are established. One is a new constructive approach to designing switching sequences. The controllable state set of each switching sequence designed via the approach coincides with the controllable subspace of switched linear systems. The other is a well-estimated value for the minimum number of switchings required for controllability. Each state in the controllable subspace can be steered to origin within this value of switching times.     

Controllability of Linear Algebraic Differential Systems

A controllable linear system of ordinary differential equations not solvable for the derivative of the vector state function of the system is investigated. The coefficient matrix at the derivative of the vector state function is assumed to be degenerate at all points of the domain of definition. Controllability criteria for systems with constant and variable coefficient matrices are formulated in terms of input data.     

Reachability and Controllability of Discrete-Time Systems under Control Actions Bounded in Magnitude and Norm

Control systems described by linear difference equations are studied, assuming that control actions are bounded both in magnitude (geometrically) and norm (integrally). The states in the phase space to which a system can be transferred from the origin and the states from which a system can be transferred to the origin are studied. Examples are given.     

Positive Controllability Test for Continuous-Time Linear Systems

This note presents a method to test the positive controllability of a continuous-time linear system. Based on the Jordan canonical form, the controllability of a given system can be reduced to those of its subsystems with real eigenvalues. Because the dimension of the subsystem is smaller than that of the given system, the controllability test can be simplified. It is pointed out that the conditions for a continuous-time system to be positive controllable have almost the same expressions as those for a discrete-time system.     

Ellipsoidal Techniques for Reachability Analysis of Discrete-Time Linear Systems

This paper describes the computation of reach sets for discrete-time linear control systems with time-varying coefficients and ellipsoidal bounds on the controls and initial conditions. The algorithms construct external and internal ellipsoidal approximations that touch the reach set boundary from outside and from inside. Recurrence relations describe the time evolution of these approximations. An essential part of the paper deals with singular discrete-time linear systems