Marco Todescato

Dr. Marco Todescato

Fraunhofer Italia Research, Bolzano, Trentino-Alto Adige, Italy
orcid

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 July 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
NBNicola Bastianello
Nicola Bastianello
RCRuggero Carli
Ruggero Carli
LSLuca Schenato
Luca Schenato
Marco TodescatoMarco Todescato
Marco Todescato
In this work we focus on the problem of minimizing the sum of convex cost functions in a distributed fashion over a peer-to-peer network. In particular, we are interested in the case in which communications between nodes are prone to failures and the agents are not synchronized among themselves. We address the problem proposing a modified version of the relaxed ADMM, which corresponds to the Peaceman-Rachford splitting method applied to the dual. By exploiting results from operator theory, we are able to prove the almost sure convergence of the proposed algorithm under general assumptions on the distribution of communication loss and node activation events. By further assuming the cost functions to be strongly convex, we prove the linear convergence of the algorithm in mean to a neighborhood of the optimal solution, and provide an upper bound to the convergence rate. Finally, we present numerical results testing the proposed method in different scenarios.

28 August 2014 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
ACAndrea Carron
Andrea Carron
Marco TodescatoMarco Todescato
Marco Todescato
RCRuggero Carli
Ruggero Carli
LSLuca Schenato
Luca Schenato
In this paper, we address the problem of optimal estimating the position of each agent in a network from relative noisy vectorial distances with its neighbors by means of only local communication and bounded complexity, independent of network size and topology. We propose a consensus-based algorithm with the use of local memory variables which allows asynchronous implementation, has guaranteed exponential convergence to the optimal solution under simple deterministic and randomized communication protocols, and requires minimal packet transmission. In the randomized scenario, we then study the rate of convergence in expectation of the estimation error and we argue that it can be used to obtain upper and lower bound for the rate of converge in mean square. In particular, we show that for regular graphs, such as Cayley, Ramanujan, and complete graphs, the convergence rate in expectation has the same asymptotic degradation of memoryless asynchronous consensus algorithms in terms of network size. In addition, we show that the asynchronous implementation is also robust to delays and communication failures. We finally complement the analytical results with some numerical simulations, comparing the proposed strategy with other algorithms which have been recently proposed in the literature.

3 July 2017 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
Marco TodescatoMarco Todescato
Marco Todescato
JSJohn W. Simpson-Porco
John W. Simpson-Porco
FDFlorian Dorfler
Florian Dorfler
RCRuggero Carli
Ruggero Carli
FBFrancesco Bullo
Francesco Bullo
A standard operational requirement in power systems is that the voltage magnitudes lie within prespecified bounds. Conventional engineering wisdom suggests that having a tightly regulated voltage profile should also guarantee that the system operates far from static bifurcation instabilities, such as voltage collapse. In general, however, these two objectives are distinct and must be separately enforced. We formulate an optimization problem that maximizes the distance to voltage collapse through injections of reactive power, subject to power flow and operational voltage constraints. By exploiting a linear approximation of the power flow equations, we arrive at a convex reformulation, which can be efficiently solved for the optimal injections. We then propose a distributed feedback controller, based on a dual-ascent algorithm, to solve for the prescribed optimization problem in real time. This is possible, thanks to a further manipulation of the problem into a form that is amenable for distributed implementation. We also address the planning problem of allocating control resources by recasting our problem in a sparsity-promoting framework. This allows us to choose a desired tradeoff between optimality of injections and the number of required actuators. We illustrate the performance of our results with the IEEE 30-bus network.

1 August 2020 in Automatica
Verified
Journal Article
Closed access
Marco TodescatoMarco Todescato
Marco Todescato
ACAndrea Carron
Andrea Carron
RCRuggero Carli
Ruggero Carli
GPGianluigi Pillonetto
Gianluigi Pillonetto
LSLuca Schenato
Luca Schenato

1 December 2016
Verified
Conference Paper
Closed access
ACAndrea Carron
Andrea Carron
Marco TodescatoMarco Todescato
Marco Todescato
RCRuggero Carli
Ruggero Carli
LSLuca Schenato
Luca Schenato
GPGianluigi Pillonetto
Gianluigi Pillonetto
In this work we study the problem of efficient non-parametric estimation for non-linear time-space dynamic Gaussian processes (GP). We propose a systematic and explicit procedure to address this problem by pairing GP regression with Kalman Filtering. Under a specific separability assumption of the modeling kernel and periodic sampling on a (possibly non-uniform) space-grid, we show how to build an exact finite dimensional discrete-time state-space representation for the modeled process. The major finding is that the state at instant k of the associated Kalman Filter represents a sufficient statistic to compute the minimum variance prediction of the process at instant k over any arbitrary finite subset of the space. Finally, we compare the proposed strategy with standard approaches.

1 June 2017 in Automatica
Verified
Journal Article
Closed access
Marco TodescatoMarco Todescato
Marco Todescato
ACAndrea Carron
Andrea Carron
RCRuggero Carli
Ruggero Carli
GPGianluigi Pillonetto
Gianluigi Pillonetto
LSLuca Schenato
Luca Schenato