Jin Gyu Lee
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
Jin Gyu Lee has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Hyungbo Shim
Department of Electrical and Computer Engineering, ASRI, Seoul National University, Seoul, South Korea
10 shared publications Hyungbo Shim
ARSI, Department of Electrical and Computer Engineering Seoul National University Seoul Korea
9 shared publications- Junsoo Kim
Department of Electrical and Information Engineering, Seoul National University of Science and Technology, Seoul, South Korea
4 shared publications Stephan Trenn
4 shared publications- Cyrus Mostajeran
Nanyang Technological University Singapore
3 shared publications - Graham Van Goffrier
University of Southampton
3 shared publications
Latest Publications
- 16 August 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 217
Distributed phase synchronization through neuromorphic entrainment by synchronized integrate-and-fire neurons
- 16 August 2026
- Published by Elsevier in Systems & Control Letters
- Vol. 217
Distributed phase synchronization through neuromorphic entrainment by synchronized integrate-and-fire neurons
- 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.
- 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.
- 27 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1682-1687
A Distributed Observer Accommodating a Broad Range of Intermittent Communication Scenarios
This paper proposes a distributed observer that utilizes intermittent communication and accommodates a broad range of scenarios, including asynchronous operation, unidirectional communication, packet loss, and communication delays. An analysis over jointly connected switching topology supports this and provides a condition for exponential convergence of the estimation error. This condition can be used to determine a communication rate. The analysis is valid when the unobservable subspace of each agent admits an invariant orthogonal complement. This is a property that is always achievable via a coordinate transformation when the system matrix is diagonalizable over the complex field.
- 27 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 1682-1687
A Distributed Observer Accommodating a Broad Range of Intermittent Communication Scenarios
This paper proposes a distributed observer that utilizes intermittent communication and accommodates a broad range of scenarios, including asynchronous operation, unidirectional communication, packet loss, and communication delays. An analysis over jointly connected switching topology supports this and provides a condition for exponential convergence of the estimation error. This condition can be used to determine a communication rate. The analysis is valid when the unobservable subspace of each agent admits an invariant orthogonal complement. This is a property that is always achievable via a coordinate transformation when the system matrix is diagonalizable over the complex field.
- Open Access
- 11 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (2) , 1267-1272
Complexity Reduction for Resilient State Estimation of Uniformly Observable Nonlinear Systems
A resilient state estimation scheme for uniformly observable nonlinear systems, based on a method for local identification of sensor attacks, is presented. The estimation problem is combinatorial in nature, and so many methods require substantial computational and storage resources as the number of sensors increases. To reduce the complexity, the proposed method performs the attack identification with local subsets of the measurements, not with the set of all measurements. A condition for nonlinear attack identification is introduced as a relaxed version of existing redundant observability condition. It is shown that an attack identification can be performed even when the entire state cannot be recovered from the measurements. As a result, although a portion of measurements are compromised, they can be locally identified and excluded from the state estimation, and thus, the true state can be recovered. Simulation results demonstrate the effectiveness of the proposed scheme.
- 11 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (2) , 1267-1272
Open AccessComplexity Reduction for Resilient State Estimation of Uniformly Observable Nonlinear Systems
A resilient state estimation scheme for uniformly observable nonlinear systems, based on a method for local identification of sensor attacks, is presented. The estimation problem is combinatorial in nature, and so many methods require substantial computational and storage resources as the number of sensors increases. To reduce the complexity, the proposed method performs the attack identification with local subsets of the measurements, not with the set of all measurements. A condition for nonlinear attack identification is introduced as a relaxed version of existing redundant observability condition. It is shown that an attack identification can be performed even when the entire state cannot be recovered from the measurements. As a result, although a portion of measurements are compromised, they can be locally identified and excluded from the state estimation, and thus, the true state can be recovered. Simulation results demonstrate the effectiveness of the proposed scheme.
- Open Access
- 22 May 2024
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 34 (13) , 8785-8801
Maintaining and steering a formation in an unknown dynamic environment via a consistent distributed dynamic map
- 22 May 2024
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 34 (13) , 8785-8801
Open AccessMaintaining and steering a formation in an unknown dynamic environment via a consistent distributed dynamic map
- Open Access
Node-wise monotone barrier coupling law for formation control
We study a node-wise monotone barrier coupling law, motivated by the synaptic coupling of neural central pattern generators. It is illustrated that this coupling imitates the desirable properties of neural central pattern generators. In particular, the coupling law 1) allows us to assign multiple central patterns on the circle and 2) allows for rapid switching between different patterns via simple `kicks'. In the end, we achieve full control by partitioning the state space by utilizing a barrier effect and assigning a unique steady-state behavior to each element of the resulting partition. We analyze the global behavior and study the viability of the design.
Open AccessNode-wise monotone barrier coupling law for formation control
We study a node-wise monotone barrier coupling law, motivated by the synaptic coupling of neural central pattern generators. It is illustrated that this coupling imitates the desirable properties of neural central pattern generators. In particular, the coupling law 1) allows us to assign multiple central patterns on the circle and 2) allows for rapid switching between different patterns via simple `kicks'. In the end, we achieve full control by partitioning the state space by utilizing a barrier effect and assigning a unique steady-state behavior to each element of the resulting partition. We analyze the global behavior and study the viability of the design.
- Open Access
Node-Wise Monotone Barrier Coupling Law for Formation Control
We study a node-wise monotone barrier coupling law, motivated by the synaptic coupling of neural central pattern generators. It is illustrated that this coupling imitates the desirable properties of neural central pattern generators. In particular, the coupling law (1) allows us to assign multiple central patterns on the circle and (2) allows for rapid switching between different patterns via simple ‘kicks’. In the end, we achieve full control by partitioning the state space by utilizing a barrier effect and assigning a unique steady-state behavior to each element of the resulting partition. We analyze the global behavior and study the viability of the design.
Open AccessNode-Wise Monotone Barrier Coupling Law for Formation Control
We study a node-wise monotone barrier coupling law, motivated by the synaptic coupling of neural central pattern generators. It is illustrated that this coupling imitates the desirable properties of neural central pattern generators. In particular, the coupling law (1) allows us to assign multiple central patterns on the circle and (2) allows for rapid switching between different patterns via simple ‘kicks’. In the end, we achieve full control by partitioning the state space by utilizing a barrier effect and assigning a unique steady-state behavior to each element of the resulting partition. We analyze the global behavior and study the viability of the design.
- Open Access
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1486-1491
Realization from Moments: The Linear Case
By exploiting the time-domain notion of moments we recover a time-domain counterpart of the fact that a certain number of steady-state responses is sufficient to realize a linear system. This may pave the way to a realization theory for nonlinear systems based on their steady-state responses.
- 13 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1486-1491
Open AccessRealization from Moments: The Linear Case
By exploiting the time-domain notion of moments we recover a time-domain counterpart of the fact that a certain number of steady-state responses is sufficient to realize a linear system. This may pave the way to a realization theory for nonlinear systems based on their steady-state responses.
- 28 October 2023
- Published by Elsevier in Automatica
- Vol. 159
A design method of distributed algorithms via discrete-time blended dynamics theorem
- 28 October 2023
- Published by Elsevier in Automatica
- Vol. 159
A design method of distributed algorithms via discrete-time blended dynamics theorem