Table of Contents
Fetching ...

Analysis of Discrete-Time Switched Linear Systems under Logic Dynamic Switchings

Xiao Zhang, Min Meng, Zhengping Ji

TL;DR

This work addresses discrete-time switched linear systems (SLS) whose switching signals are generated by logical dynamic systems. It advances a semi-tensor product (STP)–based merged-algebraic framework (ASSR) to fuse linear modes with logical generators into a linear-like hybrid model, and derives necessary and sufficient criteria and practical algorithms for reachability, controllability, observability, and reconstructibility under logic-driven switching. It further introduces ell-step input-state reachability and develops two realization scenarios—fixed operating times and finite reference-signal tracking—together with an illustrative example validating the approach. The results enable systematic design and verification of controllers where logical networks govern mode switching, with potential impact on cyber-physical systems and complex hierarchical control architectures.

Abstract

The control properties of discrete-time switched linear systems (SLS) with switching signals generated by logical dynamic systems are studied using the semi-tensor product (STP) approach. With the algebraic state space representation (ASSR), the linear modes and the logical generators are aggregated as a hybrid system, leading to the criteria of reachability, controllability, observability, and reconstructibility of the SLSs. Algorithms for checking these properties are given. Then, two kinds of realization problems concerning whether the logical dynamic systems can generate the desired switching signals are investigated, and necessary and sufficient conditions for the realisability of the required switching signals are given with respect to the cases of fixed operating time switching and finite reference signal switching.

Analysis of Discrete-Time Switched Linear Systems under Logic Dynamic Switchings

TL;DR

This work addresses discrete-time switched linear systems (SLS) whose switching signals are generated by logical dynamic systems. It advances a semi-tensor product (STP)–based merged-algebraic framework (ASSR) to fuse linear modes with logical generators into a linear-like hybrid model, and derives necessary and sufficient criteria and practical algorithms for reachability, controllability, observability, and reconstructibility under logic-driven switching. It further introduces ell-step input-state reachability and develops two realization scenarios—fixed operating times and finite reference-signal tracking—together with an illustrative example validating the approach. The results enable systematic design and verification of controllers where logical networks govern mode switching, with potential impact on cyber-physical systems and complex hierarchical control architectures.

Abstract

The control properties of discrete-time switched linear systems (SLS) with switching signals generated by logical dynamic systems are studied using the semi-tensor product (STP) approach. With the algebraic state space representation (ASSR), the linear modes and the logical generators are aggregated as a hybrid system, leading to the criteria of reachability, controllability, observability, and reconstructibility of the SLSs. Algorithms for checking these properties are given. Then, two kinds of realization problems concerning whether the logical dynamic systems can generate the desired switching signals are investigated, and necessary and sufficient conditions for the realisability of the required switching signals are given with respect to the cases of fixed operating time switching and finite reference signal switching.
Paper Structure (13 sections, 3 theorems, 66 equations, 2 figures)

This paper contains 13 sections, 3 theorems, 66 equations, 2 figures.

Key Result

Proposition 6

Consider the logical control network (eq3.2). If each state $\theta\in {\mathcal{D}}_N$ is one-step controllable from all the states, which in the vector form is then the four properties of the switched linear system (eq3.1) with constrained switching signals are reduced to the unconstrained cases.

Figures (2)

  • Figure 1: System diagram
  • Figure 2: Input-state dynamic graph

Theorems & Definitions (14)

  • Definition 1
  • Definition 2
  • Definition 3
  • Definition 4
  • Definition 5
  • Proposition 6
  • Definition 7
  • Proposition 8
  • Example 9
  • Definition 10
  • ...and 4 more