activity
20182022
most citedData-driven stabilization of nonlinear polynomial systems with noisy data

16 citations · 37 across the 5 of their papers we have counts for

collaborators
Showing math.OCShow all

6 papers · 1 filter

math.OC202112 cited

On the Certainty-Equivalence Approach to Direct Data-Driven LQR Design

Florian Dörfler, Pietro Tesi, Claudio De Persis

The linear quadratic regulator (LQR) problem is a cornerstone of automatic control, and it has been widely studied in the data-driven setting. The various data-driven approaches ca…

math.OC202016 cited

Data-driven stabilization of nonlinear polynomial systems with noisy data

Meichen Guo, Claudio De Persis, Pietro Tesi

In a recent paper we have shown how to learn controllers for unknown linear systems using finite-sized noisy data by solving linear matrix inequalities. In this note we extend this…

math.OC2020

Willems' Fundamental Lemma for State-space Systems and its Extension to Multiple Datasets

Henk J. van Waarde, Claudio De Persis, M. Kanat Camlibel +1

Willems et al.'s fundamental lemma asserts that all trajectories of a linear system can be obtained from a single given one, assuming that a persistency of excitation condition hol…

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…

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…