Searcharxiv⌕ Search

arXiv subjects

Giacomo Baggio

Publications and source records attributed to Giacomo Baggio.

29 records · Page 2Linked to original sources
arXiv2019

Data-Driven Minimum-Energy Controls for Linear Systems

In this paper we study the problem of computing minimum-energy controls for linear systems from experimental data. The design of open-loop minimum-energy control inputs to steer a linear system between two different states in finite time is a classic problem in control theory, whose solution can be computed in closed form using the system matrices and its controllability Gramian. Yet, the computation of these inputs is known to be ill-conditioned, especially when the system is large, the control horizon long, and the system model uncertain. Due to these limitations, open-loop minimum-energy controls and the associated state trajectories have remained primarily of theoretical value. Surprisingly, in this paper we show that open-loop minimum-energy controls can be learned exactly from experimental data, with a finite number of control experiments over the same time horizon, without knowledge or estimation of the system model, and with an algorithm that is significantly more reliable than the direct model-based computation. These findings promote a new philosophy of controlling large, uncertain, linear systems where data is abundantly available.

math.OC↗
arXiv2019

Stability Conditions for Cluster Synchronization in Networks of Heterogeneous Kuramoto Oscillators

In this paper we study cluster synchronization in networks of oscillators with heterogenous Kuramoto dynamics, where multiple groups of oscillators with identical phases coexist in a connected network. Cluster synchronization is at the basis of several biological and technological processes; yet the underlying mechanisms to enable cluster synchronization of Kuramoto oscillators have remained elusive. In this paper we derive quantitative conditions on the network weights, cluster configuration, and oscillators' natural frequency that ensure asymptotic stability of the cluster synchronization manifold; that is, the ability to recover the desired cluster synchronization configuration following a perturbation of the oscillators' states. Qualitatively, our results show that cluster synchronization is stable when the intra-cluster coupling is sufficiently stronger than the inter-cluster coupling, the natural frequencies of the oscillators in distinct clusters are sufficiently different, or, in the case of two clusters, when the intra-cluster dynamics is homogeneous. We illustrate and validate the effectiveness of our theoretical results via numerical studies.

math.OC↗
arXiv2018

Conal Distances Between Rational Spectral Densities

The paper generalizes Thompson and Hilbert metric to the space of spectral densities. The resulting complete metric space has the differentiable structure of a Finsler manifold with explicit geodesics. The resulting distances are filtering invariant, can be computed efficiently, and admit geodesic paths that preserve rationality; these are properties of fundamental importance in many engineering applications.

math.OC↗
arXiv2018

Further Results on the Convergence of the Pavon-Ferrante Algorithm for Spectral Estimation

In this paper, we provide a detailed analysis of the global convergence properties of an extensively studied and extremely effective fixed-point algorithm for the Kullback-Leibler approximation of spectral densities, proposed by Pavon and Ferrante in [Pavon and Ferrante, 2006]. Our main result states that the algorithm globally converges to one of its fixed points.

math.OC↗
arXiv2017

Parametrization of Minimal Spectral Factors of Discrete-Time Rational Spectral Densities

In this paper, the problem of providing a complete parametrization of the minimal spectral factors of a discrete-time rational spectral density is considered. The desired parametrization, given in terms of the all-pass divisors of a certain all-pass function, is established in the most general setting: after several partial results, mostly in the continuous-time case, this is indeed the first complete parametrization obtained without resorting to any facilitating assumption. This result provides a positive answer to a conjecture raised in [Baggio and Ferrante, 2016].

math.OC↗
arXiv2017

LTI Stochastic Processes: a Behavioral Perspective

This paper revisits the definition of linear time-invariant (LTI) stochastic process within a behavioral systems framework. Building on [Willems, 2013], we derive a canonical representation of an LTI stochastic process and a physically grounded notion of interconnection between independent stochastic processes. We use this framework to analyze the invariance properties enjoyed by distances between spectral densities of LTI processes.

eess.SY↗
arXiv2016

On the Role of Network Centrality in the Controllability of Complex Networks

In recent years complex networks have gained increasing attention in different fields of science and engineering. The problem of controlling these networks is an interesting and challenging problem to investigate. In this paper we look at the controllability problem focusing on the energy needed for the control. Precisely not only we want to analyze whether a network can be controlled, but we also want to establish whether the control can be performed using a limited amount of energy. We restrict our study to irreducible and (marginally) stable networks and we find that the leading right and left eigenvectors of the network matrix play a crucial role in this analysis. Interestingly, our results suggest the existence of a connection between controllability and network centrality, a well-known concept in network science. In case the network is reversible, the latter connection involves the PageRank, an extensively studied type of centrality measure. Finally, the proposed results are applied to examples concerning random graphs.

math.OC↗
arXiv2015

On Minimal Spectral Factors with Zeroes and Poles lying on Prescribed Region

In this paper, we consider a general discrete-time spectral factorization problem for rational matrix-valued functions. We build on a recent result establishing existence of a spectral factor whose zeroes and poles lie in any pair of prescribed regions of the complex plane featuring a geometry compatible with symplectic symmetry. In this general setting, uniqueness of the spectral factor is not guaranteed. It was, however, conjectured that if we further impose stochastic minimality, uniqueness can be recovered. The main result of his paper is a proof of this conjecture.

math.OC↗
arXiv2015

On the Factorization of Rational Discrete-Time Spectral Densities

In this paper, we consider an arbitrary matrix-valued, rational spectral density $Φ(z)$. We show with a constructive proof that $Φ(z)$ admits a factorization of the form $Φ(z)=W^\top (z^{-1})W(z)$, where $W(z)$ is stochastically minimal. Moreover, $W(z)$ and its right inverse are analytic in regions that may be selected with the only constraint that they satisfy some symplectic-type conditions. By suitably selecting the analyticity regions, this extremely general result particularizes into a corollary that may be viewed as the discrete-time counterpart of the matrix factorization method devised by Youla in his celebrated work (Youla, 1961).

math.OC↗
arXiv2012

Quantum State Preparation by Controlled Dissipation in Finite Time: From Classical to Quantum Controllers

We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are available in a number of scalable quantum technologies (complete unitary control on the target system, an ancillary resettable qubit and controlled-not gates between the target and the ancilla), and can be seen as a "quantum-controller" implementation of a sequence of classical feedback loops. We show how a large degree of flexibility exists in engineering the required conditional operations, and make explicit contact with a stabilization protocol used for dissipative quantum state preparation and entanglement generation in recent experiments with trapped ions.

quant-ph↗