Observability and controllability analysis of linear systems subject to data losses

R.M. Jungers, A. Kundu, W.P.M.H. Heemels

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)

Abstract

We provide algorithmically verifiable necessary and sufficient conditions for fundamental system theoretic properties of discrete-time linear systems subject to data losses. More precisely, the systems in our modeling framework are subject to disruptions (data losses) in the feedback loop, where the set of possible data loss sequences is captured by an automaton. As such, the results are applicable in the context of shared (wireless) communication networks and/or embedded architectures where some information on the data loss behaviour is available a priori. We propose an algorithm for deciding observability (or the absence of it) for such systems, and show how this algorithm can be used also to decide other properties including constructibility, controllability, reachability, null-controllability, detectability and stabilizability by means of relations that we establish among these properties. The main apparatus for our analysis is the celebrated Skolem's Theorem from Linear Algebra. Moreover, we study the relation between the model adopted in this paper and a previously introduced model where, instead of allowing dropouts in the feedback loop, one allows for ti

Original languageEnglish
Pages (from-to)3361-3376
JournalIEEE Transactions on Automatic Control
Volume63
Issue number10
DOIs
Publication statusPublished - 1 Oct 2018

Fingerprint

Observability
Controllability
Linear systems
Feedback
Linear algebra
Telecommunication networks

Keywords

  • Automata
  • Automaton
  • Constrained Switched System
  • Controllability
  • Data losses
  • Linear systems
  • Observability
  • Switched systems
  • Wireless communication
  • Wireless Control

Cite this

@article{690219396a584f87b94e3ed0d53bfd97,
title = "Observability and controllability analysis of linear systems subject to data losses",
abstract = "We provide algorithmically verifiable necessary and sufficient conditions for fundamental system theoretic properties of discrete-time linear systems subject to data losses. More precisely, the systems in our modeling framework are subject to disruptions (data losses) in the feedback loop, where the set of possible data loss sequences is captured by an automaton. As such, the results are applicable in the context of shared (wireless) communication networks and/or embedded architectures where some information on the data loss behaviour is available a priori. We propose an algorithm for deciding observability (or the absence of it) for such systems, and show how this algorithm can be used also to decide other properties including constructibility, controllability, reachability, null-controllability, detectability and stabilizability by means of relations that we establish among these properties. The main apparatus for our analysis is the celebrated Skolem's Theorem from Linear Algebra. Moreover, we study the relation between the model adopted in this paper and a previously introduced model where, instead of allowing dropouts in the feedback loop, one allows for ti",
keywords = "Automata, Automaton, Constrained Switched System, Controllability, Data losses, Linear systems, Observability, Switched systems, Wireless communication, Wireless Control",
author = "R.M. Jungers and A. Kundu and W.P.M.H. Heemels",
year = "2018",
month = "10",
day = "1",
doi = "10.1109/TAC.2017.2781374",
language = "English",
volume = "63",
pages = "3361--3376",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers",
number = "10",

}

Observability and controllability analysis of linear systems subject to data losses. / Jungers, R.M.; Kundu, A.; Heemels, W.P.M.H.

In: IEEE Transactions on Automatic Control, Vol. 63, No. 10, 01.10.2018, p. 3361-3376.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Observability and controllability analysis of linear systems subject to data losses

AU - Jungers, R.M.

AU - Kundu, A.

AU - Heemels, W.P.M.H.

PY - 2018/10/1

Y1 - 2018/10/1

N2 - We provide algorithmically verifiable necessary and sufficient conditions for fundamental system theoretic properties of discrete-time linear systems subject to data losses. More precisely, the systems in our modeling framework are subject to disruptions (data losses) in the feedback loop, where the set of possible data loss sequences is captured by an automaton. As such, the results are applicable in the context of shared (wireless) communication networks and/or embedded architectures where some information on the data loss behaviour is available a priori. We propose an algorithm for deciding observability (or the absence of it) for such systems, and show how this algorithm can be used also to decide other properties including constructibility, controllability, reachability, null-controllability, detectability and stabilizability by means of relations that we establish among these properties. The main apparatus for our analysis is the celebrated Skolem's Theorem from Linear Algebra. Moreover, we study the relation between the model adopted in this paper and a previously introduced model where, instead of allowing dropouts in the feedback loop, one allows for ti

AB - We provide algorithmically verifiable necessary and sufficient conditions for fundamental system theoretic properties of discrete-time linear systems subject to data losses. More precisely, the systems in our modeling framework are subject to disruptions (data losses) in the feedback loop, where the set of possible data loss sequences is captured by an automaton. As such, the results are applicable in the context of shared (wireless) communication networks and/or embedded architectures where some information on the data loss behaviour is available a priori. We propose an algorithm for deciding observability (or the absence of it) for such systems, and show how this algorithm can be used also to decide other properties including constructibility, controllability, reachability, null-controllability, detectability and stabilizability by means of relations that we establish among these properties. The main apparatus for our analysis is the celebrated Skolem's Theorem from Linear Algebra. Moreover, we study the relation between the model adopted in this paper and a previously introduced model where, instead of allowing dropouts in the feedback loop, one allows for ti

KW - Automata

KW - Automaton

KW - Constrained Switched System

KW - Controllability

KW - Data losses

KW - Linear systems

KW - Observability

KW - Switched systems

KW - Wireless communication

KW - Wireless Control

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

U2 - 10.1109/TAC.2017.2781374

DO - 10.1109/TAC.2017.2781374

M3 - Article

AN - SCOPUS:85038373596

VL - 63

SP - 3361

EP - 3376

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 10

ER -