Controllability and observability of switched multi-agent systems

This paper considers controllability and observability of switched multi-agent systems, which are composed of continuous-time and discrete-time subsystems. First, a controllability criterion is established in terms of the system matrices. Then, by virtue of the concepts of the invariant subspace and the controllable state set, a method is proposed to construct the switching sequence to ensure controllability of switched multi-agent systems, and a necessary and sufficient condition is obtained for controllability. Moreover, a necessary controllability condition is derived in terms of eigenvectors of the Laplican matrix. With respect to observability, two necessary and sufficient algebraic conditions are obtained. Finally, simulation examples are provided to illustrate the theoretical results.     

Target controllability of multiagent systems under fixed and switching topologies

In this article, the target controllability of multiagent systems under fixed and switching topologies is investigated, respectively. In the fixed topology setting, some necessary and/or sufficient algebraic and graph‐theoretic conditions are proposed, and the target controllable subspace is quantitatively studied by virtue of almost equitable graph vertex partitions. In the switching topology setting, based on the concepts of the invariant subspace and the target controllable state set, some necessary and sufficient algebraic conditions are obtained. Moreover, the target controllability is studied from the union graph perspective. The results show that when the union graph of all the possible topologies is target controllable, the multiagent system would be target controllable even if each of its subsystems is not. Numerical simulations are provided finally to verify the effectiveness of the theoretical results.     

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.     

Span-reachability and observability of bilinear hybrid systems

The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics are determined by bilinear control systems, and whose discrete transitions are triggered externally. The proposed characterization provides necessary and sufficient conditions for observability and span-reachability in terms of rank conditions for generalized observability and controllability matrices. This characterization is useful for the system theory of bilinear hybrid systems, in particular, it is used in the realization theory of bilinear hybrid systems, (Petreczky, 2006).     

Observability conditions of Boolean control networks

Observability is a basic, yet challenging, issue when studying Boolean control networks (BCNs). Recently, a criterion for observability of controllable BCNs was proposed by using the algebraic representation of logical dynamics based on the technique of the semi‐tensor product of matrices. In this paper, we present new necessary and sufficient conditions guaranteeing observability of a BCN without preassuming its controllability. The conditions are hence more general. Some examples are worked out to illustrate the obtained results. Copyright © 2013 John Wiley & Sons, Ltd.     

New necessary and sufficient conditions for local controllability and local observability of 2-D separable denominator systems

New necessary and sufficient conditions for local controllability and observability of 2-D separable denominator systems (SDS's) are presented on the basis of the reduced-dimensional decomposition of 2-D SDS's. It is proved that local controllability of a 2-D SDS is equivalent to controllability of two 1-D systems which are a special decomposition pair of the 2-D SDS. Furthermore, local observability of a 2-D SDS is equivalent to a full rank condition of the coefficient matrices of the 2-D SDS in addition to observability of two 1-D systems which are another special decomposition pair of the 2-D SDS. Thus, these new conditions which use only 1-D controllability matrices, 1-D observability matrices, and coefficient matrices of the 2-D SDS are much simpler than any previous conditions which use complex 2-D controllability and observability matrices.     

Controllability and observability for time‐varying switched impulsive controlled systems

This paper is concerned with the controllability and observability for linear time‐varying switched impulsive systems. First, some new results about the variation of parameters for time‐varying switched impulsive systems are derived. Then less conservative sufficient conditions and necessary conditions for state controllability and observability of such systems are established. And for such system without impulsive control input, sufficient and necessary conditions for controllability and observability are derived. Furthermore, corresponding criteria applied to time‐varying impulsive systems are also discussed and examples are presented to show the effectiveness of the proposed results. Copyright © 2009 John Wiley & Sons, Ltd.     

关于区间矩阵稳定性、可控性、可观性的充要条件的注记

该文是对区间矩阵稳定性、可观性及可控性的充要条件的若干注记,给出其饼算子 U的明确定义以及一个大区间矩阵分解成若干个子矩阵之饼的具体表达式.并进一步说明一 个区间矩阵(无穷多个矩阵)的稳定性、可控性、可观性等价于该区间矩阵中的有限个矩阵的 相应性质.建议了寻找这有限个矩阵的计算方法和步骤.     

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

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

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.     

Controllability of discrete‐time multiagent systems with switching topology

The current theoretical investigation on the controllability of switched multiagent systems mainly focuses on fixed connected topology or union graph without nonaccessible nodes. However, for discrete‐time multiagent systems with switching topology, it is still unknown whether the existing results are valid or not under the condition of arbitrary topology. Based on graph distance partitions and Wonham's geometric approach, we provide the lower and upper bounds for the dimension of controllable subspaces of discrete‐time multiagent systems. Unlike the existing results of controllability with switching topology, the proposed results have the advantage of being applicable to multiagent systems with arbitrary graphic topologies, union graph (strongly connected or not), and coupling weights. We also provide 2 algorithms for computing the lower and upper bounds for the dimension of controllable subspaces, respectively. Furthermore, as a remarkable application, we present how the proposed lower bound can be utilized for achieving the targeted controllability if the dimension of the controllable subspace of the switched system satisfies certain conditions.     

网络调度中的能控性与能观性研究

为了研究网络调度对能控性与能观性的影响,对输入、输出通道都存在通信约束的网络控制系统的调度进行建模;利用通信序列表示通道的调度情况,最终将模型转化为离散切换系统;在静态调度下,利用循环不变子空间理论及其相关的性质,给出了网络控制系统能控性、能观性成立的充要条件,并给出了原有控制系统与经网络静态调度后的系统之间能控性、能观性的关系;最后用仿真实例说明了所提结论的正确性。     

网络控制系统的能控性和能观性

给出了网络控制系统的定义，并基于线性时不变系统的被控对象，建立了传感器为时钟驱动，控制器和作动器为事件驱动时长时滞网络控制系统的数学模型，对网络控制系统的均值能控、均方能控、均值能观及均方能观作了定义，得到了网络控制系统能控的充分或必要条件及能观的充要条件．     

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.     

Minimal controllability for systems with delays†

In this paper we consider the problem of minimal controllability for a general class of linear spectrally controllable systems. We show that the smallest number of controls that are necessary in order that spectral controllability may hold depends only upon the matrices of the uncontrolled system and that it is equal to the smallest number of outputs necessary for the dual problem of ‘spectral observability’; moreover, any spectrally controllable system can be made minimally controllable by acting upon the control matrix only, and any spectrally observable system can be made minimally observable by acting upon the output matrix only. In the sequel this result is explained in the cases of the delayed systems and of some kind of generalized systems.     

Stable‐protocol output consensualization for high‐order swarm systems with switching topologies

Stable‐protocol (SP) output consensus analysis and design for high‐order linear time‐invariant swarm systems with switching topologies are dealt with. Firstly, on the basis of observability decomposition, a dynamic output feedback consensus protocol with switching topologies is given. Then, a necessary and sufficient condition for SP output consensus is shown, and an explicit expression of the output consensus function is presented, which is independent of switching topologies. Furthermore, necessary and/or sufficient conditions for SP output consensualization, which are independent of the number of agents, are shown respectively. Finally, a numerical example is shown to demonstrate theoretical results. Copyright © 2012 John Wiley & Sons, Ltd.     

Robustness of controllability and observability of continuouslinear time-varying systems with parameter perturbations

The controllability and the observability of continuous linear time-varying systems with norm-bounded parameter perturbations are analyzed. The sufficient conditions which ensure the controllability of the perturbed system are presented by using the derived state transition matrix relationship between the nominal system and the perturbed system. The proposed sufficient conditions allow the evaluation of controllability under the norm-bounded parameter perturbations. The robustness of the observability is also studied for continuous linear time varying systems with norm-bounded parameter perturbations, and the corresponding sufficient conditions are provided     

Band criteria and recursive tests of complete controllability and observability of linear algebraic-differentiable systems

New criteria are introduced of complex controllability and observability of controllable linear stationary algebraic-differentiable systems with many inputs and outputs, which reduce to the calculation of the rank of special band matrices. Recursive tests are set up, which permit reducing computational expenses in the verification for the fulfillment of the conditions of complete controllability and observability of algebraic-differentiable systems of a large dimension.     

多变量线性定常连续系统与离散系统之间的几个可控可观性关系

Some results on linear system theory are reported. Based on these results, necessary and sufficient conditions for the controllability and observability of both continuous-time and its corresponding discrete-time multivariable linear time-invariant systems are presented.