arXiv subjects

Hyungbo Shim

Publications and source records attributed to Hyungbo Shim.

At least 37 records · Page 2Linked to original sources

arXiv2022

Decentralized Design and Plug-and-Play Distributed Control for Linear Multi-Channel Systems

We propose a distributed control, in which many identical control agents are deployed for controlling a linear time-invariant plant that has multiple input-output channels. Each control agent can join or leave the control loop during the operation of stabilization without particular initialization over the whole networked agents. Once new control agents join the loop, they self-organize their control dynamics, which does not interfere the control by other active agents, which is achieved by local communication with the neighboring agents. The key idea enabling these features is the use of Bass' algorithm, which allows the distributed computation of stabilizing gains by solving a Lyapunov equation in a distributed manner.

eess.SY↗

arXiv2022

Data-Driven Inverse of Linear Systems and Application to Disturbance Observers

This work develops a data-based construction of inverse dynamics for LTI systems. Specifically, the problem addressed here is to find an input sequence from the corresponding output sequence based on pre-collected input and output data. The problem can be considered as a reverse of the recent use of behavioral approach, in which the output sequence is obtained for a given input sequence by solving an equation formed by pre-collected data. The condition under which the problem gives a solution is investigated and turns out to be L-delay invertibility of the plant and a certain degree of persistent excitation of the data input. The result is applied to form a data-driven disturbance observer. The plant dynamics augmented by the data-driven disturbance observer exhibits disturbance rejection without the model knowledge of the plant.

eess.SY↗

arXiv2022

Comparison of encrypted control approaches and tutorial on dynamic systems using LWE-based homomorphic encryption

Encrypted control has been introduced to protect controller data by encryption at the stage of computation and communication, by performing the computation directly on encrypted data. In this article, we first review and categorize recent relevant studies on encrypted control. Approaches based on homomorphic encryption, multi-party computation, and secret sharing are introduced, compared, and then discussed with respect to computational complexity, communication load, enabled operations, security, and research directions. We proceed to discuss a current challenge in the application of homomorphic encryption to dynamic systems, where arithmetic operations other than integer addition and multiplication are limited. We also introduce a homomorphic cryptosystem called ``GSW-LWE'' and discuss its benefits that allow for recursive multiplication of encrypted dynamic systems, without use of computationally expensive bootstrapping techniques.

cs.CR↗

arXiv2022

A Design Method of Distributed Algorithms via Discrete-time Blended Dynamics Theorem

We develop a discrete-time version of the blended dynamics theorem for the use of designing distributed computation algorithms. The blended dynamics theorem enables to predict the behavior of heterogeneous multi-agent systems. Therefore, once we get a blended dynamics for a particular computational task, design idea of node dynamics for individual heterogeneous agents can easily occur. In the continuous-time case, prediction by blended dynamics was enabled by high coupling gain among neighboring agents. In the discrete-time case, we propose an equivalent action, which we call multi-step coupling in this paper. Compared to the continuous-time case, the blended dynamics can have more variety depending on the coupling matrix. This benefit is demonstrated with three applications; distributed estimation of network size, distributed computation of the PageRank, and distributed computation of the degree sequence of a graph, which correspond to the coupling by doubly-stochastic, column-stochastic, and row-stochastic matrices, respectively.

eess.SY↗

arXiv2022

Model Reference Gaussian Process Regression: Data-Driven Output Feedback Controller

Data-driven controls using Gaussian process regression have recently gained much attention. In such approaches, system identification by Gaussian process regression is mostly followed by model-based controller designs. However, the outcomes of Gaussian process regression are often too complicated to apply conventional control designs, which makes the numerical design such as model predictive control employed in many cases. To overcome the restriction, our idea is to perform Gaussian process regression to the inverse of the plant with the same input/output data for the conventional regression. With the inverse, one can design a model reference controller without resorting to numerical control methods. This paper considers single-input single-output (SISO) discrete-time nonlinear systems of minimum phase with relative degree one. It is highlighted that the model reference Gaussian process regression controller is designed directly from pre-collected input/output data without system identification.

eess.SY↗

arXiv2022

Data-driven Output-feedback Predictive Control: Unknown Plant's Order and Measurement Noise

The aim of this paper is to propose a new data-driven control scheme for multi-input-multi-output linear time-invariant systems whose system model are completely unknown. Using a non-minimal input-output realization, the proposed method can be applied to the case where the system order is unknown, provided that its upper bound is known. A workaround against measurement noise is proposed and it is shown through simulation study that the proposed method is superior to the conventional methods when dealing with input/output data corrupted by measurement noise.

eess.SY↗

arXiv2021

Dynamic controller that operates over homomorphically encrypted data for infinite time horizon

In this paper, we present a dynamic feedback controller that computes the next state and the control signal over encrypted data using homomorphic properties of cryptosystems, whose performance is equivalent to the linear dynamic controllers over real-valued data. Assuming that the input as well as the output of the plant is encrypted and transmitted back to the controller, it is shown that the state matrix of any linear time-invariant controller can be always converted to a matrix of integer components. This allows the dynamic feedback controller to operate for infinite time horizon without decryption or reset of its internal state. For implementation in practice, we illustrate the use of a cryptosystem that is based on the Learning With Errors problem, which allows both multiplication and addition over encrypted data. It is also shown that the effect of injected random numbers during encryption for security can be maintained within a small bound by way of the closed-loop stability.

eess.SY↗

arXiv2021

Toward nonlinear dynamic control over encrypted data for infinite time horizon

Recent studies on encrypted control using homomorphic encryption allow secure operation by directly performing computations on encrypted data without decryption. Implementing dynamic controllers on encrypted data presents unique challenges due to limitations on the number of operations on an encrypted message. Hence, it may not be possible to perform the recursive operations for an infinite time horizon. In this note, we demonstrate that it is possible to run a dynamic controller over encrypted data for an infinite time horizon if the output of the controller can be represented as a function of a fixed number of previous inputs and outputs. The presented implementation requires encryption at both input and output of the plant. We identify a class of nonlinear systems that can accommodate the proposed implementation. The closed-loop performance can be guaranteed using the proposed encrypted controller by ensuring that quantization error is made arbitrarily small with appropriate choice of parameters. We show that the proposed method is amenable to linear systems (as a subset of the said nonlinear systems) with performance guarantees.

eess.SY↗

arXiv2021

Synchronization with prescribed transient behavior: Heterogeneous multi-agent systems under funnel coupling Extended arXiv version

In this paper, we introduce a nonlinear time-varying coupling law, which can be designed in a fully decentralized manner and achieves approximate synchronization with arbitrary precision, under only mild assumptions on the individual vector fields and the underlying (undirected) graph structure. The proposed coupling law is motivated by the so-called funnel control method studied in adaptive control under the observation that arbitrary precision synchronization can be achieved for heterogeneous multi-agent systems by a high-gain coupling; consequently we call our novel synchronization method `(node-wise) funnel coupling.' By adjusting the conventional proof technique in the funnel control study, we are even able to obtain asymptotic synchronization with the same funnel coupling law. Moreover, the emergent collective behavior that arises for a heterogeneous multi-agent system when enforcing arbitrary precision synchronization by the proposed funnel coupling law, is analyzed in this paper. In particular, we introduce a single scalar dynamics called `emergent dynamics' which describes the emergent synchronized behavior of the multi-agent system under funnel coupling. Characterization of the emergent dynamics is important because, for instance, one can design the emergent dynamics first such that the solution trajectory behaves as desired, and then, provide a design guideline to each agent so that the constructed vector fields yield the desired emergent dynamics. We illustrate this idea via the example of a distributed median solver based on funnel coupling.

eess.SY↗

arXiv2021

Design of heterogeneous multi-agent system for distributed computation

A group behavior of a heterogeneous multi-agent system is studied which obeys an "average of individual vector fields" under strong couplings among the agents. Under stability of the averaged dynamics (not asking stability of individual agents), the behavior of heterogeneous multi-agent system can be estimated by the solution to the averaged dynamics. A following idea is to "design" individual agent's dynamics such that the averaged dynamics performs the desired task. A few applications are discussed including estimation of the number of agents in a network, distributed least-squares or median solver, distributed optimization, distributed state estimation, and robust synchronization of coupled oscillators. Since stability of the averaged dynamics makes the initial conditions forgotten as time goes on, these algorithms are initialization-free and suitable for plug-and-play operation. At last, nonlinear couplings are also considered, which potentially asserts that enforced synchronization gives rise to an emergent behavior of a heterogeneous multi-agent system.

eess.SY↗

arXiv2021

A Tool for Analysis and Synthesis of Heterogeneous Multi-agent Systems under Rank-deficient Coupling

The behavior of heterogeneous multi-agent systems is studied when the coupling matrices are possibly all different and/or singular, that is, its rank is less than the system dimension. Rank-deficient coupling allows exchange of limited state information, which is suitable for the study of multi-agent systems under output coupling. We present a coordinate change that transforms the heterogeneous multi-agent system into a singularly perturbed form. The slow dynamics is still a reduced-order multi-agent system consisting of a weighted average of the vector fields of all agents, and some sub-dynamics of agents. The weighted average is an emergent dynamics, which we call a blended dynamics. By analyzing or synthesizing the blended dynamics, one can predict or design the behavior of a heterogeneous multi-agent system when the coupling gain is sufficiently large. For this result, stability of the blended dynamics is required. Since stability of the individual agent is not asked, the stability of the blended dynamics is the outcome of trading off the stability among the agents. It can be seen that, under the stability of the blended dynamics, the initial conditions of the individual agents are forgotten as time goes on, and thus, the behavior of the synthesized multi-agent system is initialization-free and is suitable for plug-and-play operation. As a showcase, we apply the proposed tool to four application problems; distributed state estimation for linear systems, practical synchronization of heterogeneous Van der Pol oscillators, estimation of the number of nodes in a network, and a problem of distributed optimization.

eess.SY↗

arXiv2021

Fully Distributed Resilient State Estimation based on Distributed Median Solver

In this paper, we present a scheme of fully distributed resilient state estimation for linear dynamical systems under sensor attacks. The proposed state observer consists of a network of local observers, where each of them utilizes local measurements and information transmitted from the neighbors. As a fully distributed scheme, it does not necessarily collect a majority of sensing data for the sake of attack identification, while the compromised sensors are eventually identified by the distributed network and excluded from the observers. For this, the overall network (not the individual local observer) is assumed to have redundant sensors and assumed to be connected. The proposed scheme is based on a novel design of a distributed median solver, which approximately recovers the median value of local estimates.

eess.SY↗

arXiv2021

Blended Dynamics Approach to Distributed Optimization: Sum Convexity and Convergence Rate

This paper studies the application of the blended dynamics approach towards distributed optimization problem where the global cost function is given by a sum of local cost functions. The benefits include (i) individual cost function need not be convex as long as the global cost function is strongly convex and (ii) the convergence rate of the distributed algorithm is arbitrarily close to the convergence rate of the centralized one. Two particular continuous-time algorithms are presented using the proportional-integral-type couplings. One has benefit of `initialization-free,' so that agents can join or leave the network during the operation. The other one has the minimal amount of communication information. After presenting a general theorem that can be used for designing distributed algorithms, we particularly present a distributed heavy-ball method and discuss its strength over other methods.

math.OC↗

arXiv2021

Disturbance Observer

Disturbance observer is an inner-loop output-feedback controller whose role is to reject external disturbances and to make the outer-loop baseline controller robust against plant's uncertainties. Therefore, the closed-loop system with the DOB approximates the nominal closed-loop by the baseline controller and the nominal plant model with no disturbances. This article presents how the disturbance observer works under what conditions, and how one can design a disturbance observer to guarantee robust stability and to recover the nominal performance not only in the steady-state but also for the transient response under large uncertainty and disturbance.

eess.SY↗

arXiv2021

Zero-dynamics Attack, Variations, and Countermeasures

This chapter presents an overview on actuator attacks that exploit zero dynamics, and countermeasures against them. First, zero-dynamics attack is re-introduced based on a canonical representation called normal form. Then it is shown that the target dynamic system is at elevated risk if the associated zero dynamics is unstable. From there on, several questions are raised in series to ensure when the target system is immune to the attack of this kind. The first question is: Is the target system secure from zero-dynamics attack if it does not have any unstable zeros? An answer provided for this question is: No, the target system may still be at risk due to another attack surface emerging in the process of implementation. This is followed by a series of next questions, and in the course of providing answers, variants of the classic zero-dynamics attack are presented, from which the vulnerability of the target system is explored in depth. At the end, countermeasures are proposed to render the attack ineffective. Because it is known that the zero-dynamics in continuous-time systems cannot be modified by feedback, the main idea of the countermeasure is to relocate any unstable zero to a stable region in the stage of digital implementation through modified digital samplers and holders. Adversaries can still attack actuators, but due to the re-located zeros, they are of little use in damaging the target system.

eess.SY↗

arXiv2019

Distributed Algorithm for Economic Dispatch Problem with Separable Losses

Economic dispatch problem for a networked power system has been considered. The objective is to minimize the total generation cost while meeting the overall supply-demand balance and generation capacity. In particular, a more practical scenario has been studied by considering the power losses. A non-convex optimization problem has been formulated where the non-convexity comes from the nonlinear equality constraint representing the supply-demand balance with the power losses. It is shown that the optimization problem can be solved using convex relaxation and dual decomposition. A simple distributed algorithm is proposed to solve the optimization problem. Specifically, the proposed algorithm does not require any initialization process and hence robust to various changes in operating condition. In addition, the behavior of the proposed algorithm is analyzed when the problem is infeasible.

eess.SY↗

arXiv2019

Comprehensive Introduction to Fully Homomorphic Encryption for Dynamic Feedback Controller via LWE-based Cryptosystem

The cryptosystem based on the Learning-with-Errors (LWE) problem is considered as a post-quantum cryptosystem, because it is not based on the factoring problem with large primes which is easily solved by a quantum computer. Moreover, the LWE-based cryptosystem allows fully homomorphic arithmetics so that two encrypted variables can be added and multiplied without decrypting them. This chapter provides a comprehensive introduction to the LWE-based cryptosystem with examples. A key to the security of the LWE-based cryptosystem is the injection of random errors in the ciphertexts, which however hinders unlimited recursive operation of homomorphic arithmetics on ciphertexts due to the growth of the error. We show that this limitation can be overcome when the cryptosystem is used for a dynamic feedback controller that guarantees stability of the closed-loop system. Finally, we illustrate through MATLAB codes how the LWE-based cryptosystem can be customized to build a secure feedback control system. This chapter is written for the control engineers who do not have background on cryptosystems.

eess.SY↗

arXiv2019

Output feedback based event-triggered sliding mode control for delta operator systems

In this paper, we present an output feedback based design of event-triggered sliding mode control for delta operator systems. For discrete-time systems, multi-rate output sampling based state estimation technique is very useful if the output information is available. But at high sampling rates, the discrete-time representation of the system using shift operator becomes numerically ill-conditioned and as a result, the observability matrix becomes singular as the sampling period tends to zero. Here, a new formulation of multi-rate state estimation (MRSE) for a small sampling period is presented. We first propose a new observability matrix and then discuss its relationship with the observability matrix defined in the conventional sense. For the delta operator system with matched uncertainty, we have presented the design of MRSE based sliding mode control (SMC). Additionally, to make the control efficient in terms of resource utilization, MRSE based event-triggered SMC is proposed. The absence of Zeno phenomenon is guaranteed as the control input is inherently discrete in nature. Finally, the effectiveness of the proposed method is illustrated through numerical simulations, considering a ball and beam system and a general linear system as a numerical example.

eess.SY↗