Abstract / other · 2016
Fully observable networks with polytree structure
Donatello Materassi, Murti V. Salapaka*
2016 American Control Conference, pp: 4676 (tutorial paper: abstract)
Abstract
Summary form only given; The talk tackles the problem of reconstructing the tree-like topological structure of a network of linear dynamical systems. A distance function is defined in order to evaluate the �closeness� of two processes and some useful mathematical properties are derived. Theoretical results to guarantee the correctness of the identification procedure for networked linear systems characterized by a tree topology are provided as well. The talk also suggests the approximation of a complex connected network with a tree in order to detect the most meaningful interconnections.
BibTeX
@misc{materassi-2016-fully-observable-networks-with-polytree-structure,
title = {Fully observable networks with polytree structure},
author = {Donatello Materassi and Murti V. Salapaka*},
booktitle = {2016 American Control Conference, pp: 4676 (tutorial paper: abstract)},
year = {2016}
}