Classification of the structurally controllable zero-patterns for driftless bilinear control systems

Aristomenis Tsopelakos, Mohamed Ali Belabbas, Bahman Gharesifard

Research output: Contribution to journalArticle

Abstract

We introduce and study the structural controllability of driftless bilinear control systems. We study two cases: In the first, the system matrices belong to one zero-pattern, and in the second, the system matrices belong to one of several zero-patterns. We refer to them as single and multiple patterns cases. In both cases, we prove that the structural controllability of driftless bilinear control systems is a generic property. We also classify the structurally controllable zero-patterns based on the strong connectivity of their corresponding graph. We provide algorithms that compute the minimum number of matrices needed for the structural controllability of driftless bilinear systems. The results about the structural controllability of driftless bilinear systems can be also used for the study of the structural accessibility of bilinear systems with drift term.

Original languageEnglish (US)
Article number8356633
Pages (from-to)429-439
Number of pages11
JournalIEEE Transactions on Control of Network Systems
Volume6
Issue number1
DOIs
StatePublished - Mar 2019

Fingerprint

Bilinear Systems
Controllability
Control System
Control systems
Zero
Strong Connectivity
Generic Property
Accessibility
Classify
Term
Graph in graph theory

Keywords

  • Bilinear systems, strongly connected graphs
  • structural controllability
  • transitive Lie algebras

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Signal Processing
  • Computer Networks and Communications
  • Control and Optimization

Cite this

Classification of the structurally controllable zero-patterns for driftless bilinear control systems. / Tsopelakos, Aristomenis; Belabbas, Mohamed Ali; Gharesifard, Bahman.

In: IEEE Transactions on Control of Network Systems, Vol. 6, No. 1, 8356633, 03.2019, p. 429-439.

Research output: Contribution to journalArticle

@article{fa555a8e1d71467db3645b7a94de9d49,
title = "Classification of the structurally controllable zero-patterns for driftless bilinear control systems",
abstract = "We introduce and study the structural controllability of driftless bilinear control systems. We study two cases: In the first, the system matrices belong to one zero-pattern, and in the second, the system matrices belong to one of several zero-patterns. We refer to them as single and multiple patterns cases. In both cases, we prove that the structural controllability of driftless bilinear control systems is a generic property. We also classify the structurally controllable zero-patterns based on the strong connectivity of their corresponding graph. We provide algorithms that compute the minimum number of matrices needed for the structural controllability of driftless bilinear systems. The results about the structural controllability of driftless bilinear systems can be also used for the study of the structural accessibility of bilinear systems with drift term.",
keywords = "Bilinear systems, strongly connected graphs, structural controllability, transitive Lie algebras",
author = "Aristomenis Tsopelakos and Belabbas, {Mohamed Ali} and Bahman Gharesifard",
year = "2019",
month = "3",
doi = "10.1109/TCNS.2018.2834822",
language = "English (US)",
volume = "6",
pages = "429--439",
journal = "IEEE Transactions on Control of Network Systems",
issn = "2325-5870",
publisher = "IEEE CONTROL SYSTEMS SOCIETY",
number = "1",

}

TY - JOUR

T1 - Classification of the structurally controllable zero-patterns for driftless bilinear control systems

AU - Tsopelakos, Aristomenis

AU - Belabbas, Mohamed Ali

AU - Gharesifard, Bahman

PY - 2019/3

Y1 - 2019/3

N2 - We introduce and study the structural controllability of driftless bilinear control systems. We study two cases: In the first, the system matrices belong to one zero-pattern, and in the second, the system matrices belong to one of several zero-patterns. We refer to them as single and multiple patterns cases. In both cases, we prove that the structural controllability of driftless bilinear control systems is a generic property. We also classify the structurally controllable zero-patterns based on the strong connectivity of their corresponding graph. We provide algorithms that compute the minimum number of matrices needed for the structural controllability of driftless bilinear systems. The results about the structural controllability of driftless bilinear systems can be also used for the study of the structural accessibility of bilinear systems with drift term.

AB - We introduce and study the structural controllability of driftless bilinear control systems. We study two cases: In the first, the system matrices belong to one zero-pattern, and in the second, the system matrices belong to one of several zero-patterns. We refer to them as single and multiple patterns cases. In both cases, we prove that the structural controllability of driftless bilinear control systems is a generic property. We also classify the structurally controllable zero-patterns based on the strong connectivity of their corresponding graph. We provide algorithms that compute the minimum number of matrices needed for the structural controllability of driftless bilinear systems. The results about the structural controllability of driftless bilinear systems can be also used for the study of the structural accessibility of bilinear systems with drift term.

KW - Bilinear systems, strongly connected graphs

KW - structural controllability

KW - transitive Lie algebras

UR - http://www.scopus.com/inward/record.url?scp=85046795322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85046795322&partnerID=8YFLogxK

U2 - 10.1109/TCNS.2018.2834822

DO - 10.1109/TCNS.2018.2834822

M3 - Article

AN - SCOPUS:85046795322

VL - 6

SP - 429

EP - 439

JO - IEEE Transactions on Control of Network Systems

JF - IEEE Transactions on Control of Network Systems

SN - 2325-5870

IS - 1

M1 - 8356633

ER -