activity
20132025
most citedData-driven control via Petersen's lemma

157 citations · 551 across the 47 of their papers we have counts for

collaborators
Showing 2018Show all

7 papers · 1 filter

eess.SY2018★ 6 cited

Data Rates for Stabilizing Control under Denial-of-Service Attacks

Shuai Feng, Ahmet Cetinkaya, Hideaki Ishii +2

We study communication-constrained networked control problems for linear time-invariant systems in the presence of Denial-of-Service (DoS) attacks, namely attacks that prevent tran…

eess.SY2018★ 1 cited

Self-Triggered Network Coordination over Noisy Communication Channels

Mingming Shi, Pietro Tesi, Claudio De Persis

This paper investigates coordination problems over packet-based communication channels. We consider the scenario in which the communication between network nodes is corrupted by un…

math.OC2018

Necessary and Sufficient Topological Conditions for Identifiability of Dynamical Networks

Henk J. van Waarde, Pietro Tesi, M. Kanat Camlibel

This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node…

math.OC2018

Topological Conditions for Identifiability of Dynamical Networks with Partial Node Measurements

Henk J. van Waarde, Pietro Tesi, M. Kanat Camlibel

This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node…

eess.SY2018

Classification for Dynamical Systems: Model-based Approach and Support Vector Machines

Giorgio Battistelli, Pietro Tesi

We consider the problem of classifying trajectories generated by dynamical systems. We investigate a model-based approach, the common approach in control engineering, and a data-dr…

math.OC2018

Identifiability of Undirected Dynamical Networks: a Graph-Theoretic Approach

Henk J. van Waarde, Pietro Tesi, M. Kanat Camlibel

This paper deals with identifiability of undirected dynamical networks with single-integrator node dynamics. We assume that the graph structure of such networks is known, and aim t…