arXiv subjects

Henrik Sandberg

Publications and source records attributed to Henrik Sandberg.

At least 109 records · Page 6Linked to original sources

arXiv2017

Secure Estimation and Zero-Error Secrecy Capacity

We study the problem of securely estimating the states of an unstable dynamical system subject to nonstochastic disturbances. The estimator obtains all its information through an uncertain channel which is subject to nonstochastic disturbances as well, and an eavesdropper obtains a disturbed version of the channel inputs through a second uncertain channel. An encoder observes and block-encodes the states in such a way that, upon sending the generated codeword, the estimator's error is bounded and such that a security criterion is satisfied ensuring that the eavesdropper obtains as little state information as possible. Two security criteria are considered and discussed with the help of a numerical example. A sufficient condition on the uncertain wiretap channel, i.e., the pair formed by the uncertain channel from encoder to estimator and the uncertain channel from encoder to eavesdropper, is derived which ensures that a bounded estimation error and security are achieved. This condition is also shown to be necessary for a subclass of uncertain wiretap channels. To formulate the condition, the zero-error secrecy capacity of uncertain wiretap channels is introduced, i.e., the maximal rate at which data can be transmitted from the encoder to the estimator in such a way that the eavesdropper is unable to reconstruct the transmitted data. Lastly, the zero-error secrecy capacity of uncertain wiretap channels is studied.

eess.SY↗

arXiv2017

On the Coherence of Large-Scale Networks with Distributed PI and PD Control

We consider distributed control of double-integrator networks, where agents are subject to stochastic disturbances. We study performance of such networks in terms of coherence, defined through an H2 norm metric that represents the variance of nodal state fluctuations. Specifically, we address known performance limitations of the standard consensus protocol, which cause this variance to scale unboundedly with network size for a large class of networks. We propose distributed proportional integral (PI) and proportional derivative (PD) controllers that relax these limitations and achieve bounded variance, in cases where agents can access an absolute measurement of one of their states. This case applies to, for example, frequency control of power networks and vehicular formation control with limited sensing. We discuss optimal tuning of the controllers with respect to network coherence and demonstrate our results in simulations.

math.OC↗

arXiv2017

Directed Information as Privacy Measure in Cloud-based Control

We consider cloud-based control scenarios in which clients with local control tasks outsource their computational or physical duties to a cloud service provider. In order to address privacy concerns in such a control architecture, we first investigate the issue of finding an appropriate privacy measure for clients who desire to keep local state information as private as possible during the control operation. Specifically, we justify the use of Kramer's notion of causally conditioned directed information as a measure of privacy loss based on an axiomatic argument. Then we propose a methodology to design an optimal "privacy filter" that minimizes privacy loss while a given level of control performance is guaranteed. We show in particular that the optimal privacy filter for cloud-based Linear-Quadratic-Gaussian (LQG) control can be synthesized by a Linear-Matrix-Inequality (LMI) algorithm. The trade-off in the design is illustrated by a numerical example.

math.OC↗

arXiv2017

Finite-time Consensus Protocols for Multi-dimensional Multi-agent Systems

Two finite-time consensus protocols are proposed for multi-dimensional multi-agent systems, using direction-preserving and component-wise signum controls respectively. Filippov solutions and non-smooth analysis techniques are adopted to handle discontinuities. Sufficient and necessary conditions are provided to guarantee finite-time convergence and boundedness of the solutions. It turns out that the number of agents which have continuous control law plays an essential role for finite-time convergence. In addition it is shown that the unit balls introduced by $\ell_p$ and $\ell_{\infty}$ norms are invariant for these two protocols respectively.

math.OC↗

arXiv2017

Nonlinear consensus protocols with applications to quantized systems

This paper studies multi-agent systems with nonlinear consensus protocols, i.e., only nonlinear measurements of the states are available to agents. The solutions of these systems are understood in Filippov sense since the possible discontinuity of the nonlinear controllers. Under the condition that the nonlinear functions are monotonic increasing without any continuous constraints, asymptotic stability is derived for systems defines on both directed and undirected graphs. The results can be applied to quantized consensus which extend some existing results from undirected graphs to directed ones.

math.OC↗

arXiv2017

Performance and Scalability of Voltage Controllers in Multi-Terminal HVDC Networks

In this paper, we compare the transient performance of a multi-terminal high-voltage DC (MTDC) grid equipped with a slack bus for voltage control to that of two distributed control schemes: a standard droop controller and a distributed averaging proportional-integral (DAPI) controller. We evaluate performance in terms of an H2 metric that quantifies expected deviations from nominal voltages, and show that the transient performance of a droop or DAPI controlled MTDC grid is always superior to that of an MTDC grid with a slack bus. In particular, by studying systems built up over lattice networks, we show that the H2 norm of a slack bus controlled system may scale unboundedly with network size, while the norm remains uniformly bounded with droop or DAPI control. We simulate the control strategies on radial MTDC networks to demonstrate that the transient performance for the slack bus controlled system deteriorates significantly as the network grows, which is not the case with the distributed control strategies.

math.OC↗

arXiv2016

Optimal State Estimation with Measurements Corrupted by Laplace Noise

Optimal state estimation for linear discrete-time systems is considered. Motivated by the literature on differential privacy, the measurements are assumed to be corrupted by Laplace noise. The optimal least mean square error estimate of the state is approximated using a randomized method. The method relies on that the Laplace noise can be rewritten as Gaussian noise scaled by Rayleigh random variable. The probability of the event that the distance between the approximation and the best estimate is smaller than a constant is determined as function of the number of parallel Kalman filters that is used in the randomized method. This estimator is then compared with the optimal linear estimator, the maximum a posteriori (MAP) estimate of the state, and the particle filter.

math.OC↗

arXiv2016

Uncertain Wiretap Channels and Secure Estimation

Uncertain wiretap channels are introduced. Their zero-error secrecy capacity is defined. If the sensor-estimator channel is perfect, it is also calculated. Further properties are discussed. The problem of estimating a dynamical system with nonstochastic disturbances is studied where the sensor is connected to the estimator and an eavesdropper via an uncertain wiretap channel. The estimator should obtain a uniformly bounded estimation error whereas the eavesdropper's error should tend to infinity. It is proved that the system can be estimated securely if the zero-error capacity of the sensor-estimator channel is strictly larger than the logarithm of the system's unstable pole and the zero-error secrecy capacity of the uncertain wiretap channel is positive.

eess.SY↗

arXiv2016

From Control System Security Indices to Attack Identifiability

In this paper, we investigate detectability and identifiability of attacks on linear dynamical systems that are subjected to external disturbances. We generalize a concept for a security index, which was previously introduced for static systems. The generalized index exactly quantifies the resources necessary for targeted attacks to be undetectable and unidentifiable in the presence of disturbances. This information is useful for both risk assessment and for the design of anomaly detectors. Finally, we show how techniques from the fault detection literature can be used to decouple disturbances and to identify attacks, under certain sparsity constraints.

eess.SY↗

arXiv2016

Nonlinear consensus protocols with applications to quantized systems

Two types of general nonlinear consensus protocols are considered in this paper, namely the systems with nonlinear measurement and communication of the agents' states, respectively. The solutions of the systems are understood in the sense of Filippov to handle the possible discontinuity of the nonlinear functions. For each case, we prove the asymptotic stability of the systems defined on both directed and undirected graphs. Then we reinterpret the results about the general models for a specific type of systems, i.e., the quantized consensus protocols, which extend some existing results (e.g., [1,2]) from undirected graphs to directed ones.

math.OC↗

arXiv2016

Rate of Prefix-free Codes in LQG Control Systems

In this paper, we consider a discrete time linear quadratic Gaussian (LQG) control problem in which state information of the plant is encoded in a variable-length binary codeword at every time step, and a control input is determined based on the codewords generated in the past. We derive a lower bound of the rate achievable by the class of prefix-free codes attaining the required LQG control performance. This lower bound coincides with the infimum of a certain directed information expression, and is computable by semidefinite programming (SDP). Based on a technique by Silva et al., we also provide an upper bound of the best achievable rate by constructing a controller equipped with a uniform quantizer with subtractive dither and Shannon-Fano coding. The gap between the obtained lower and upper bounds is less than $0.754r+1$ bits per time step regardless of the required LQG control performance, where $r$ is the rank of a signal-to-noise ratio matrix obtained by SDP, which is no greater than the dimension of the state.

math.OC↗

arXiv2016

Improving performance of droop-controlled microgrids through distributed PI-control

This paper investigates transient performance of inverter-based microgrids in terms of the resistive power losses incurred in regulating frequency under persistent stochastic disturbances. We model the inverters as second-order oscillators and compare two algorithms for frequency regulation: the standard frequency droop controller and a distributed proportional-integral (PI) controller. The transient power losses can be quantified using an input-output H2 norm. We show that the distributed PI-controller, which has previously been proposed for secondary frequency control (the elimination of static errors), also has the potential to significantly improve performance by reducing transient power losses. This loss reduction is shown to be larger in a loosely interconnected network than in a highly interconnected one, whereas losses do not depend on connectivity if standard droop control is employed. Moreover, our results indicate that there is an optimal tuning of the distributed PI-controller for loss reduction. Overall, our results provide an additional argument in favor of distributed algorithms for secondary frequency control in microgrids.

math.OC↗

arXiv2016

Performance metrics for droop-controlled microgrids with variable voltage dynamics

This paper investigates the performance of a microgrid with droop-controlled inverters in terms of the total power losses incurred in maintaining synchrony under persistent small disturbances. The inverters are modeled with variable frequencies and voltages under droop control. For small fluctuations from a steady state, these transient power losses can be quantified by an input-output H2 norm of a linear system subject to distributed disturbances. We evaluate this H2 norm under the assumption of a dominantly inductive network with identical inverters. The results indicate that while phase synchronization, in accordance with previous findings, produces losses that scale with a network's size but only weakly depend on its connectivity, the losses associated with the voltage control will be larger in a highly connected network than in a loosely connected one. The typically higher rate of convergence in a highly interconnected network thus comes at a cost of higher losses associated with the power flows used to reach the steady state.

math.OC↗

arXiv2015

Control of MTDC Transmission Systems under Local Information

High-voltage direct current (HVDC) is a commonly used technology for long-distance electric power transmission, mainly due to its low resistive losses. In this paper a distributed controller for multi-terminal high-voltage direct current (MTDC) transmission systems is considered. Sufficient conditions for when the proposed controller renders the closed-loop system asymptotically stable are provided. Provided that the closed loop system is asymptotically stable, it is shown that in steady-state a weighted average of the deviations from the nominal voltages is zero. Furthermore, a quadratic cost of the current injections is minimized asymptotically.

math.OC↗

arXiv2015

Distributed Controllers for Multi-Terminal HVDC Transmission Systems

High-voltage direct current (HVDC) is an increasingly commonly used technology for long-distance electric power transmission, mainly due to its low resistive losses. In this paper the voltage-droop method (VDM) is reviewed, and three novel distributed controllers for multi-terminal HVDC (MTDC) transmission systems are proposed. Sufficient conditions for when the proposed controllers render the equilibrium of the closed-loop system asymptotically stable are provided. These conditions give insight into suitable controller architecture, e.g., that the communication graph should be identical with the graph of the MTDC system, including edge weights. Provided that the equilibria of the closed-loop systems are asymptotically stable, it is shown that the voltages asymptotically converge to within predefined bounds. Furthermore, a quadratic cost of the injected currents is asymptotically minimized. The proposed controllers are evaluated on a four-bus MTDC system.

math.OC↗

arXiv2015

Weak Resilience of Networked Control Systems

In this paper, we propose a method to establish a networked control system that maintains its stability in the presence of certain undesirable incidents on local controllers. We call such networked control systems weakly resilient. We first derive a necessary and sufficient condition for the weak resilience of networked systems. Networked systems do not generally satisfy this condition. Therefore, we provide a method for designing a compensator which ensures the weak resilience of the compensated system. Finally, we illustrate the efficiency of the proposed method by a power system example based on the IEEE 14-bus test system.

eess.SY↗

arXiv2015

Quadratic Gaussian Privacy Games

A game-theoretic model for analysing the effects of privacy on strategic communication between agents is devised. In the model, a sender wishes to provide an accurate measurement of the state to a receiver while also protecting its private information (which is correlated with the state) private from a malicious agent that may eavesdrop on its communications with the receiver. A family of nontrivial equilibria, in which the communicated messages carry information, is constructed and its properties are studied.

math.OC↗

arXiv2015

Differentially Private State Estimation in Distribution Networks with Smart Meters

State estimation is routinely being performed in high-voltage power transmission grids in order to assist in operation and to detect faulty equipment. In low- and medium-voltage power distribution grids, on the other hand, few real-time measurements are traditionally available, and operation is often conducted based on predicted and historical data. Today, in many parts of the world, smart meters have been deployed at many customers, and their measurements could in principle be shared with the operators in real time to enable improved state estimation. However, customers may feel reluctance in doing so due to privacy concerns. We therefore propose state estimation schemes for a distribution grid model, which ensure differential privacy to the customers. In particular, the state estimation schemes optimize different performance criteria, and a trade-off between a lower bound on the estimation performance versus the customers' differential privacy is derived. The proposed framework is general enough to be applicable also to other distribution networks, such as water and gas networks.

math.OC↗