Pattern identification in distributed systems

Melkior Ornik, Adam C. Sniderman, Mireille E. Broucke, Gabriele M.T. D'Eleuterio

Research output: Chapter in Book/Report/Conference proceedingConference contribution


A distributed system's interconnection structure emerges as a pattern in the system matrices. This pattern must be preserved through system analysis and control synthesis, and much has been written on these topics. A problem which has not received any attention to date is how to identify a pattern, given the linear system model. This paper proposes a method for identifying a pattern that is mathematically encoded through a commuting relationship with a base matrix. Our method generates the commuting relationship, when it exists. When it does not exist, our method produces the closest approximation to the commuting relationship. Further, it indicates which additional subsystem interconnections would render it achievable. We provide both an exact solution and an almost sure polynomial-time solution in the probabilistic sense. Finally, we give several examples to demonstrate the utility of this method for finding patterns in distributed systems.

Original languageEnglish (US)
Title of host publication2016 IEEE 55th Conference on Decision and Control, CDC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781509018376
StatePublished - Dec 27 2016
Externally publishedYes
Event55th IEEE Conference on Decision and Control, CDC 2016 - Las Vegas, United States
Duration: Dec 12 2016Dec 14 2016

Publication series

Name2016 IEEE 55th Conference on Decision and Control, CDC 2016


Other55th IEEE Conference on Decision and Control, CDC 2016
CountryUnited States
CityLas Vegas

ASJC Scopus subject areas

  • Artificial Intelligence
  • Decision Sciences (miscellaneous)
  • Control and Optimization

Fingerprint Dive into the research topics of 'Pattern identification in distributed systems'. Together they form a unique fingerprint.

Cite this