Sandro Zampieri

Sandro Zampieri

Auto-generated profile, based on publicly available information

Sandro Zampieri

Department of Information Engineering, University of Padova, Padua, Italy

Research Focus & Metrics

Academic Career Length

36Years (1991-Present)

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

Representative Publications

View All Publications
5 March 2007 in Proceedings of the IEEE
Verified
Journal Article
Closed access
GNGirish N. Nair
Girish N. Nair
FFFabio Fagnani
Fabio Fagnani
SZSandro Zampieri
Sandro Zampieri
RERobin J. Evans
Robin J. Evans
The emerging area of control with limited data rates incorporates ideas from both control and information theory. The data rate constraint introduces quantization into the feedback loop and gives the interconnected system a two-fold nature, continuous and symbolic. In this paper, we review the results available in the literature on data-rate-limited control. For linear systems, we show how fundamental tradeoffs between the data rate and control goals, such as stability, mean entry times, and asymptotic state norms, emerge naturally. While many classical tools from both control and information theory can still be used in this context, it turns out that the deepest results necessitate a novel, integrated view of both disciplines

11 March 2014 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
FPFabio Pasqualetti
Fabio Pasqualetti
SZSandro Zampieri
Sandro Zampieri
FBFrancesco Bullo
Francesco Bullo
This paper studies the problem of controlling complex networks, i.e., the joint problem of selecting a set of control nodes and of designing a control input to steer a network to a target state. For this problem, 1) we propose a metric to quantify the difficulty of the control problem as a function of the required control energy, 2) we derive bounds based on the system dynamics (network topology and weights) to characterize the tradeoff between the control energy and the number of control nodes, and 3) we propose an open-loop control strategy with performance guarantees. In our strategy, we select control nodes by relying on network partitioning, and we design the control input by leveraging optimal and distributed control techniques. Our findings show several control limitations and properties. For instance, for Schur stable and symmetric networks: 1) if the number of control nodes is constant, then the control energy increases exponentially with the number of network nodes; 2) if the number of control nodes is a fixed fraction of the network nodes, then certain networks can be controlled with constant energy independently of the network dimension; and 3) clustered networks may be easier to control because, for sufficiently many control nodes, the control energy depends only on the controllability properties of the clusters and on their coupling strength. We validate our results with examples from power networks, social networks and epidemics spreading.

5 February 2015 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
SBSaverio Bolognani
Saverio Bolognani
SZSandro Zampieri
Sandro Zampieri
We consider the problem of deriving an explicit approximate solution of the nonlinear power equations that describe a balanced power distribution network. We give sufficient conditions for the existence of a practical solution to the power flow equations, and we propose an approximation that is linear in the active and reactive power demands of the PQ buses. For this approximation, which is valid for generic power line impedances and grid topology, we derive a bound on the approximation error as a function of the grid parameters. We illustrate the quality of the approximation via simulations, we show how it can also model the presence of voltage controlled (PV) buses, and we discuss how it generalizes the DC power flow model to lossy networks.

25 April 2008 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
RCRuggero Carli
Ruggero Carli
ACAlessandro Chiuso
Alessandro Chiuso
LSLuca Schenato
Luca Schenato
SZSandro Zampieri
Sandro Zampieri
In this paper, we consider the problem of estimating the state of a dynamical system from distributed noisy measurements. Each agent constructs a local estimate based on its own measurements and on the estimates from its neighbors. Estimation is performed via a two stage strategy, the first being a Kalman-like measurement update which does not require communication, and the second being an estimate fusion using a consensus matrix. In particular we study the interaction between the consensus matrix, the number of messages exchanged per sampling time, and the Kalman gain for scalar systems. We prove that optimizing the consensus matrix for fastest convergence and using the centralized optimal gain is not necessarily the optimal strategy if the number of exchanged messages per sampling time is small. Moreover, we show that although the joint optimization of the consensus matrix and the Kalman gain is in general a non-convex problem, it is possible to compute them under some relevant scenarios. We also provide some numerical examples to clarify some of the analytical results and compare them with alternative estimation strategies.

25 April 2008 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
FFFabio Fagnani
Fabio Fagnani
SZSandro Zampieri
Sandro Zampieri
Various randomized consensus algorithms have been proposed in the literature. In some case randomness is due to the choice of a randomized network communication protocol. In other cases, randomness is simply caused by the potential unpredictability of the environment in which the distributed consensus algorithm is implemented. Conditions ensuring the convergence of these algorithms have already been proposed in the literature. As far as the rate of convergence of such algorithms, two approaches can be proposed. One is based on a mean square analysis, while a second is based on the concept of Lyapunov exponent. In this paper, by some concentration results, we prove that the mean square convergence analysis is the right approach when the number of agents is large. Differently from the existing literature, in this paper we do not stick to average preserving algorithms. Instead, we allow to reach consensus at a point which may differ from the average of the initial states. The advantage of such algorithms is that they do not require bidirectional communication among agents and thus they apply to more general contexts. Moreover, in many important contexts it is possible to prove that the displacement from the initial average tends to zero, when the number of agents goes to infinity.

20 October 2014 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SBSaverio Bolognani
Saverio Bolognani
RCRuggero Carli
Ruggero Carli
GCGuido Cavraro
Guido Cavraro
SZSandro Zampieri
Sandro Zampieri
We consider the problem of exploiting the microgenerators dispersed in the power distribution network in order to provide distributed reactive power compensation for power losses minimization and voltage regulation. In the proposed strategy, microgenerators are smart agents that can measure their phasorial voltage, share these data with the other agents on a cyber layer, and adjust the amount of reactive power injected into the grid, according to a feedback control law that descends from duality-based methods applied to the optimal reactive power flow problem. Convergence to the configuration of minimum losses and feasible voltages is proved analytically for both a synchronous and an asynchronous version of the algorithm, where agents update their state independently one from the other. Simulations are provided in order to illustrate the performance and the robustness of the algorithm, and the innovative feedback nature of such strategy is discussed.