Hyungbo Shim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hyungbo Shim has a total of 190 co-authors. Here are the top co-authors by number of shared publications:
J.H. Seo
18 shared publicationsJuhoon Back
Kwangwoon University
17 shared publicationsJin Heon Seo
15 shared publications- Hongkeun Kim
ARC-MEE, Future Convergence Engineering, School of Mechatronics Engineering, Korea University of Technology and Education, Cheonan, Republic of Korea
13 shared publications - Jin Heon Seo
School of Electrical Engineering, Seoul National Univ., Seoul Korea, South 151-742
12 shared publications - Jin Gyu Lee
Department of Electrical and Computer Engineering, ASRI, Seoul National University, Seoul, South Korea
10 shared publications
Latest Publications
- 8 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1267-1272
Fixed-Time Weight Balancing Over Digraphs Even Under Disturbances
In this paper, we propose a weight-balancing algorithm over directed graphs that guarantees fixed-time convergence, regardless of the initial conditions. Under bounded disturbances, we further present a modified fixed-time balancing algorithm and introduce an anchor agent so that the balancing weights remain positive constants. The proposed scheme can be used as an online weight-balancing mechanism for distributed algorithms that require weight-balanced digraphs. As a representative application, we apply it to distributed optimization and illustrate its performance under topology changes through simulations.
- 8 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 1267-1272
Fixed-Time Weight Balancing Over Digraphs Even Under Disturbances
In this paper, we propose a weight-balancing algorithm over directed graphs that guarantees fixed-time convergence, regardless of the initial conditions. Under bounded disturbances, we further present a modified fixed-time balancing algorithm and introduce an anchor agent so that the balancing weights remain positive constants. The proposed scheme can be used as an online weight-balancing mechanism for distributed algorithms that require weight-balanced digraphs. As a representative application, we apply it to distributed optimization and illustrate its performance under topology changes through simulations.
- 29 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. PP (3) , 1-12
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 defined over a finite field of integers and incorporate it into a Learning With Errors (LWE) based encryption scheme. We then present a method to further utilize the disclosed residue signal for implementing dynamic controllers over encrypted data, without requiring re-encryption even when they have non-integer state matrices.
- 29 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. PP (3) , 1-12
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 defined over a finite field of integers and incorporate it into a Learning With Errors (LWE) based encryption scheme. We then present a method to further utilize the disclosed residue signal for implementing dynamic controllers over encrypted data, without requiring re-encryption even when they have non-integer state matrices.
- 22 April 2026
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 24 (6) , 1297-1307
Low-Power Disturbance Observer for Linear Systems of High Relative Degree with Robust Stability Condition
- 22 April 2026
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 24 (6) , 1297-1307
Low-Power Disturbance Observer for Linear Systems of High Relative Degree with Robust Stability Condition
- 1 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (2) , 2896-2904
A Sliding Mode Approach to Asymptotic Recovery of Nominal Performance for Uncertain Linear Systems
- 1 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 73 (2) , 2896-2904
A Sliding Mode Approach to Asymptotic Recovery of Nominal Performance for Uncertain Linear Systems
- Open Access
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.
Open AccessBlended 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.
- Open Access
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.
Open AccessA 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.
- Open Access
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.
Open AccessInput-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.
- Open Access
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.
Open AccessA 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.
- Open Access
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 115167-115177
Data-Driven Displacement-Based Formation Control With Range-Only Measurements
This paper proposes an algorithm to coordinate a displacement-based formation of a multi-agent system when their local frames are not aligned. Agents can measure neither the relative positions nor orientations, but only the range (distance) to their neighbors. We demonstrate that persistently exciting data exchanged between two agents can be used to infer relative positions and orientations. In the proposed method, we address discrete-time distributed orientation estimation based on an averaging consensus protocol. An asymptotic stability analysis of the desired formation shape is presented and the proposed strategy is validated through simulation results.
- 1 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 115167-115177
Open AccessData-Driven Displacement-Based Formation Control With Range-Only Measurements
This paper proposes an algorithm to coordinate a displacement-based formation of a multi-agent system when their local frames are not aligned. Agents can measure neither the relative positions nor orientations, but only the range (distance) to their neighbors. We demonstrate that persistently exciting data exchanged between two agents can be used to infer relative positions and orientations. In the proposed method, we address discrete-time distributed orientation estimation based on an averaging consensus protocol. An asymptotic stability analysis of the desired formation shape is presented and the proposed strategy is validated through simulation results.