arXiv subjects

Hyungbo Shim

Publications and source records attributed to Hyungbo Shim.

At least 19 recordsLinked to original sources

arXiv2026

Demonstration of Space Robot Teleoperation over a Lossy and Delayed Network using ATMOS

We present a demonstration showcasing the Autonomy Testbed for Multi-purpose Orbiting Systems (ATMOS), a planar spacecraft-analog robot designed for hardware-in-the-loop evaluation of guidance and control strategies in microgravity-like conditions. Using ATMOS as the physical test platform, we investigate the design, analysis, and performance evaluation of control architectures for remotely operated spacecraft under round-trip communication delays. In this work, we develop and experimentally validate a control strategy that combines state prediction and trajectory tracking control to perform a docking maneuver, accounting for time-varying random communication latency between ground operators and the ATMOS system. The demonstration includes a long-distance remote control experiment between Seoul and Stockholm, introducing realistic intercontinental delays and variability. The results highlight the capability of ATMOS to support rapid, reliable, and cost-effective testing of spacecraft teleoperation concepts, establishing a first step toward robust validation of on-orbit operations in microgravity-like environments.

cs.RO↗

arXiv2026

Emergent Behavior Is Robust to Communication Delays at the Cost of Slower System Evolution

Previous works have shown that strong coupling among heterogeneous agents enforces practical synchronization, leading to collective behavior governed by emergent dynamics. However, it remains an open question whether emergent behavior persists in the presence of communication delays, as high-gain methods are typically sensitive to delays. To address this problem, we instead slow down the agent dynamics, reproducing the synchronization mechanism of strong coupling on a slow time scale. As a result, the emergence of collective behavior is guaranteed despite arbitrary constant communication delays. This, however, comes at a cost: delays induce a derivative-like term, thereby scaling down the vector field of the emergent dynamics. The amount of the scaling is explicitly characterized as a function of the coupling weights and the delay lengths. We further suggest that this delay-induced slowdown, which is of independent interest, may be a general feature of diffusive coupling under suitable assumptions.

eess.SY↗

arXiv2026

Stability of Slow-Fast Nonlinear Dynamics: Non-Periodic Case

We present sufficient conditions for the semi-global exponential stability of nonlinear systems whose dynamics have both slow and fast time variations. Unlike most existing results, the fast variation is non-periodic, thereby allowing a wider class of systems, especially switched systems with fast (non-periodic) switching and those with quasi-periodic variations; we therefore rely on general averaging to construct an average system. It is assumed that the average system admits a time-invariant equilibrium that is globally exponentially stable when the slow variation is frozen, i.e., remaining at a fixed value. This slow variation is allowed to be discontinuous in time, provided its total variation (flows and jumps) is bounded. The main result is illustrated using a nonlinear switched system with slow-fast non-periodic switching.

eess.SY↗

arXiv2026

Inverse Learning-Based Output Feedback Control of Nonlinear Systems with Verifiable Guarantees

In this paper, we present a data-driven output feedback controller for nonlinear systems that achieves practical output regulation, using noise-free input/output measurement data. The proposed controller is based on (i) an inverse model of the system identified via kernel interpolation, which maps a desired output and the current state to the corresponding desired control input; and (ii) a data-driven reference selection framework that actively chooses a suitable desired output from the dataset which has been used for the identification. We establish a verifiable sufficient condition on the dataset under which the proposed controller guarantees practical output regulation. Numerical simulations demonstrate the effectiveness of the proposed controller, with additional evaluations in the presence of output measurement noise to assess its robustness empirically.

eess.SY↗

arXiv2026

Blended Dynamics and Emergence in Open Quantum Networks

In this paper, we develop a blended dynamics framework for open quantum networks with diffusive couplings. The network consists of qubits interconnected through Hamiltonian couplings, environmental dissipation, and consensus-like diffusive interactions. Such networks commonly arise in spontaneous emission processes and non-Hermitian quantum computing, and their evolution follows a Lindblad master equation. Blended dynamics theory is well established in the classical setting as a tool for analyzing emergent behaviors in heterogeneous networks with diffusive couplings. Its key insight is to blend the local dynamics rather than the trajectories of individual nodes. Perturbation analysis then shows that, under sufficiently strong coupling, all node trajectories tend to stay close to those of the blended system over time. We first show that this theory extends naturally to the reduced-state dynamics of quantum networks, revealing classical-like clustering phenomena in which qubits converge to a shared equilibrium or a common trajectory determined by the quantum blended reduced-state dynamics. We then extend the analysis to qubit coherent states using quantum Laplacians and induced graphs, proving orbit attraction of the network density operator toward the quantum blended coherent dynamics, establishing the emergence of intrinsically quantum and dynamically clustering behaviors. Finally, numerical examples validate the theoretical results.

quant-ph↗

arXiv2025

A Note on Emergent Behavior in Multi-agent Systems Enabled by Neuro-spike Communication

In this note, we present a novel synchronization framework for heterogeneous multi-agent systems enabled by neuro-spike communication, which induces emergence. Unlike conventional synchronization strategies that require continuous transmission of full-state data packets, our approach utilizes a bio-inspired neuromorphic amplifier to achieve practical synchronization via intermittent, 1-bit Dirac delta pulses. The proposed method drastically improves communication efficiency in terms of bandwidth and energy by minimizing the information payload to a single bit, with intermittent and asynchronous communication. We provide a rigorous convergence analysis of the proposed method and validate the proposed scheme through numerical examples.

eess.SY↗

arXiv2025

Input-Output Data-Driven Representation: Non-Minimality and Stability

Many recent data-driven control approaches for linear time-invariant systems are based on finite-horizon prediction of output trajectories using input-output data matrices. When applied recursively, this predictor forms a dynamic system representation. This data-driven representation is generally non-minimal, containing latent poles in addition to the system's original poles. In this article, we show that these latent poles are guaranteed to be stable through the use of the Moore-Penrose inverses of the data matrices, regardless of the system's stability and even in the presence of small noise in data. This result obviates the need to eliminate the latent poles through procedures that resort to low-rank approximation in data-driven control and analysis. It is then applied to construct a stabilizable and detectable realization from data, from which we design an output feedback linear quadratic regulator (LQR) controller. Furthermore, we extend this principle to data-driven inversion, enabling asymptotic unknown input estimation for minimum-phase systems.

eess.SY↗

arXiv2025

A polynomial-based QCQP solver for encrypted optimization

In this paper, we present a novel method for solving a class of quadratically constrained quadratic optimization problems using only additions and multiplications. This approach enables solving constrained optimization problems on private data since the operations involved are compatible with the capabilities of homomorphic encryption schemes. To solve the constrained optimization problem, a sequence of polynomial penalty functions of increasing degree is introduced, which are sufficiently steep at the boundary of the feasible set. Adding the penalty function to the original cost function creates a sequence of unconstrained optimization problems whose minimizer always lies in the admissible set and converges to the minimizer of the constrained problem. A gradient descent method is used to generate a sequence of iterates associated with these problems. For the algorithm, it is shown that the iterate converges to a minimizer of the original problem, and the feasible set is positively invariant under the iteration. Finally, the method is demonstrated on an illustrative cryptographic problem, finding the smaller value of two numbers, and the encrypted implementability is discussed.

math.OC↗

arXiv2025

Adaptation of Parameters in Heterogeneous Multi-agent Systems

This paper proposes an adaptation mechanism for heterogeneous multi-agent systems to align the agents' internal parameters, based on enforced consensus through strong couplings. Unlike homogeneous systems, where exact consensus is attainable, the heterogeneity in node dynamics precludes perfect synchronization. Nonetheless, previous work has demonstrated that strong coupling can induce approximate consensus, whereby the agents exhibit emergent collective behavior governed by the so-called blended dynamics. Building on this observation, we introduce an adaptation law that gradually aligns the internal parameters of agents without requiring direct parameter communication. The proposed method reuses the same coupling signal employed for state synchronization, which may result in a biologically or sociologically plausible adaptation process. Under a persistent excitation condition, we prove that the linearly parametrized vector fields of the agents converge to each other, thereby making the dynamics asymptotically homogeneous, and leading to exact consensus of the state variables.

eess.SY↗

arXiv2025

Determination of Bandwidth of Q-filter in Disturbance Observers to Guarantee Transient and Steady State Performance under Measurement Noise

Q-filter-based disturbance observer (DOB) is one of the most widely used robust controller due to its design simplicity. Such simplicity arises from that reducing the time constant of low pass filters, not only ensures robust stability but also enhances nominal performance recovery -- ability to recover the trajectory of nominal closed-loop system. However, in contrast to noise-free environment, excessively small time constant can rather damage the nominal performance recovery under measurement noise. That is, minimizing time constant is no longer immediately guaranteeing nominal performance recovery. Motivated by this observation, this paper concentrates on determination of time constant to ensure transient and steady state performance. This analysis uses Lyapunov method based on the coordinate change inspired by the singular perturbation theory. As a result, we present an affordable noise level and open interval for the time constant that guarantees both the required performances. The analysis can also lead to theoretical demonstration on that excessively reducing time constant is assured to achieve target performance only for noise-free case.

eess.SY↗

arXiv2024

A Learning With Errors based encryption scheme for dynamic controllers that discloses residue signal for anomaly detection

Although encrypted control systems ensure confidentiality of private data, it is challenging to detect anomalies without the secret key as all signals remain encrypted. To address this issue, we propose a homomorphic encryption scheme for dynamic controllers that automatically discloses the residue signal for anomaly detection, while keeping all other signals private. To this end, we characterize the zero-dynamics of an encrypted dynamic system over a finite field of integers and incorporate it into a Learning With Errors (LWE) based scheme. We then present a method to further utilize the disclosed residue signal for implementing dynamic controllers over encrypted data, which does not involve re-encryption even when they have non-integer state matrices.

eess.SY↗

arXiv2024

Mode Consensus Algorithms With Finite Convergence Time

This paper studies the distributed mode consensus problem in a multi-agent system, in which the agents each possess a certain attribute and they aim to agree upon the mode (the most frequent attribute owned by the agents) via distributed computation. Three algorithms are proposed. The first one directly calculates the frequency of all attributes at every agent, with protocols based on blended dynamics, and then returns the most frequent attribute as the mode. Assuming knowledge at each agent of a lower bound of the mode frequency as a priori information, the second algorithm is able to reduce the number of frequencies to be computed at every agent if the lower bound is large. The third algorithm further eliminates the need for this information by introducing an adaptive updating mechanism. The algorithms find the mode in finite time, and estimates of convergence time are provided. The proposed first and second algorithms enjoy the plug-and-play property with a dwell time.

eess.SY↗

arXiv2024

Fully Decentralized Design of Initialization-free Distributed Network Size Estimation

In this paper, we propose a distributed scheme for estimating the network size, which refers to the total number of agents in a network. By leveraging a synchronization technique for multi-agent systems, we devise an agent dynamics that ensures convergence to an equilibrium point located near the network size regardless of its initial condition. Our approach is based on an assumption that each agent has a unique identifier, and an estimation algorithm for obtaining the largest identifier value. By adopting this approach, we successfully implement the agent dynamics in a fully decentralized manner, ensuring accurate network size estimation even when some agents join or leave the network.

eess.SY↗

arXiv2023

Encrypted Dynamic Control exploiting Limited Number of Multiplications and a Method using RLWE-based Cryptosystem

In this paper, we present a method to encrypt dynamic controllers that can be implemented through most homomorphic encryption schemes, including somewhat, leveled fully, and fully homomorphic encryption. To this end, we represent the output of the given controller as a linear combination of a fixed number of previous inputs and outputs. As a result, the encrypted controller involves only a limited number of homomorphic multiplications on every encrypted data, assuming that the output is re-encrypted and transmitted back from the actuator. A guidance for parameter choice is also provided, ensuring that the encrypted controller achieves predefined performance for an infinite time horizon. Furthermore, we propose a customization of the method for Ring Learning With Errors (RLWE)-based cryptosystems, where a vector of messages can be encrypted into a single ciphertext and operated simultaneously, thus reducing computation and communication loads. Unlike previous results, the proposed customization does not require extra algorithms such as rotation, other than basic addition and multiplication. Simulation results demonstrate the effectiveness of the proposed method.

eess.SY↗

arXiv2023

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

This paper proposes a data-driven state feedback controller that enables reference tracking for nonlinear discrete-time systems. The controller is designed based on the identified inverse model of the system and a given reference model, assuming that the identification of the inverse model is carried out using only the system's state/input measurements. When its results are provided, we present conditions that guarantee a certain level of reference tracking performance, regardless of the identification method employed for the inverse model. Specifically, when Gaussian process regression (GPR) is used as the identification method, we propose sufficient conditions for the required data by applying some lemmas related to identification errors to the aforementioned conditions, ensuring that the Model reference-GPR (MR-GPR) controller can guarantee a certain level of reference tracking performance. Finally, an example is provided to demonstrate the effectiveness of the MR-GPR controller.

eess.SY↗

arXiv2023

Edge-wise funnel output synchronization of heterogeneous agents with relative degree one

When a group of heterogeneous node dynamics are diffusively coupled with a high coupling gain, the group exhibits a collective emergent behavior which is governed by a simple algebraic average of the node dynamics called the blended dynamics. This finding has been utilized for designing heterogeneous multi-agent systems by building the desired blended dynamics first and then splitting it into the node dynamics. However, to compute the magnitude of the coupling gain, each agent needs to know global information such as the number of participating nodes, the graph structure, and so on, which prevents a fully decentralized design of the node dynamics in conjunction with the coupling laws. To resolve this issue, the idea of funnel control, which is a method for adaptive gain selection, can be exploited for a node-wise coupling, but the price to pay is that the collective emergent behavior is no longer governed by a simple average of the node dynamics. Our analysis reveals that this drawback can be avoided by an edge-wise design premise, which is the idea that we present in this paper. After all, we gain benefits such as a fully decentralized design without global information, collective emergent behavior being governed by the blended dynamics, and the plug-and-play operation based on edge-wise handshaking between two nodes.

eess.SY↗

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↗