Jung Hoon Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jung Hoon Kim has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Tomomichi Hagiwara
Kyoto University
7 shared publications - Hae Yeon Park
Department of Electrical Engineering Pohang University of Science and Technology (POSTECH) Pohang 37673 Republic of Korea
6 shared publications - Hyung Tae Choi
Department of Electrical Engineering Pohang University of Science and Technology (POSTECH) Pohang Republic of Korea
6 shared publications Tomomichi Hagiwara
Department of Electrical Engineering Kyoto University Kyoto Japan
5 shared publications- Dohyeok Kwak
Department of Electrical Engineering Pohang University of Science and Technology (POSTECH) Pohang Korea
4 shared publications Hyung Tae Choi
4 shared publications
Latest Publications
- 1 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (3) , 734-736
An Operator-Theoretic Approach to Repetitive Control of Uncertain Robot Manipulators
Dear Editor, This letter develops an operator-theoretic approach to repetitive control of uncertain robot manipulators with periodic signals.
- 1 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/CAA Journal of Automatica Sinica
- Vol. 13 (3) , 734-736
An Operator-Theoretic Approach to Repetitive Control of Uncertain Robot Manipulators
Dear Editor, This letter develops an operator-theoretic approach to repetitive control of uncertain robot manipulators with periodic signals.
- 9 March 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
The L∞/L2‐Gain Analysis for Periodic Event‐Triggered Control Systems: Discretization Approach and Convergence Rate Analysis
This paper is concerned with the ‐gain (i.e., the gain from to ) analysis of periodic event‐triggered control (PETC) systems, where the feedback loop between a continuous‐time plant and a discrete‐time controller is activated intermittently based on a periodic event‐triggering mechanism. To take into account the hybrid continuous/discrete‐time behavior of PETC systems, their operator‐based description is first established by using the continuous‐time lifting technique. To facilitate the ‐gain analysis for PETC systems, we derive their fast‐lifted representation by dividing the sampling interval into subintervals with an equal width. This allows us to develop an approach by which the output function on each subinterval is approximated by a constant function. The proposed PCA approach converts a PETC system into a discrete‐time event‐triggered control (ETC) system, whose ‐gains are shown to converge to the ‐gains of the original PETC system in the order of , where is the PCA parameter. On the basis of the convergence property, the ‐gain of PETC systems is further characterized in terms of some linear matrix inequalities (LMIs). Finally, a numerical example is given to verify the effectiveness of the arguments developed in this paper.
- 9 March 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
The L∞/L2‐Gain Analysis for Periodic Event‐Triggered Control Systems: Discretization Approach and Convergence Rate Analysis
This paper is concerned with the ‐gain (i.e., the gain from to ) analysis of periodic event‐triggered control (PETC) systems, where the feedback loop between a continuous‐time plant and a discrete‐time controller is activated intermittently based on a periodic event‐triggering mechanism. To take into account the hybrid continuous/discrete‐time behavior of PETC systems, their operator‐based description is first established by using the continuous‐time lifting technique. To facilitate the ‐gain analysis for PETC systems, we derive their fast‐lifted representation by dividing the sampling interval into subintervals with an equal width. This allows us to develop an approach by which the output function on each subinterval is approximated by a constant function. The proposed PCA approach converts a PETC system into a discrete‐time event‐triggered control (ETC) system, whose ‐gains are shown to converge to the ‐gains of the original PETC system in the order of , where is the PCA parameter. On the basis of the convergence property, the ‐gain of PETC systems is further characterized in terms of some linear matrix inequalities (LMIs). Finally, a numerical example is given to verify the effectiveness of the arguments developed in this paper.
- 26 January 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
A Modified Lifting for Aperiodic Sampled‐Data Systems and L1$ {L}_1 $‐Induced Norm AnalysisThis paper is concerned with sampled‐data systems with uncertain sampling intervals by introducing a modified version of the existing lifting technique, which is tailored only for periodic sampled‐data systems. The modified lifting technique is equipped with an aperiodic truncation and a norm‐preserving normalization for functions, and converts an aperiodic sampled‐data system to an operator‐based linear time‐varying discrete‐time system. This allows us to derive a tractable expression for the ‐induced norm of aperiodic sampled‐data systems. For a sophisticated analysis of the ‐induced norm, a gridding‐based approach is applied to the set of admissible sampling sequences, by which an approximate but asymptotically exact value of this induced norm is obtained. More precisely, the ‐induced norm is reduced to the maximum of the 1‐norms of finite‐dimensional matrices over a gridding‐based finite‐dimensional set, ensuring that the associated error converges to 0 as the gridding parameter becomes larger. Finally, a numerical study is conducted to verify the effectiveness of the proposed method.
- 26 January 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
A Modified Lifting for Aperiodic Sampled‐Data Systems and L1$ {L}_1 $‐Induced Norm AnalysisThis paper is concerned with sampled‐data systems with uncertain sampling intervals by introducing a modified version of the existing lifting technique, which is tailored only for periodic sampled‐data systems. The modified lifting technique is equipped with an aperiodic truncation and a norm‐preserving normalization for functions, and converts an aperiodic sampled‐data system to an operator‐based linear time‐varying discrete‐time system. This allows us to derive a tractable expression for the ‐induced norm of aperiodic sampled‐data systems. For a sophisticated analysis of the ‐induced norm, a gridding‐based approach is applied to the set of admissible sampling sequences, by which an approximate but asymptotically exact value of this induced norm is obtained. More precisely, the ‐induced norm is reduced to the maximum of the 1‐norms of finite‐dimensional matrices over a gridding‐based finite‐dimensional set, ensuring that the associated error converges to 0 as the gridding parameter becomes larger. Finally, a numerical study is conducted to verify the effectiveness of the proposed method.
- 14 January 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 36 (7) , 3819-3837
A Predefined‐Time L∞ Control of Robot Manipulators
This paper is concerned with developing a new synthesis framework for a predefined‐time controller with respect to robot manipulators in the presence of external disturbances, by which predefined‐time stability and a finite ‐gain are ensured. We first develop a stabilizing controller by using the passivity properties of robot manipulators. Then, it is shown that the developed controller makes the state of the resulting closed‐loop system converge to zero within a predefined‐time when no uncertain element exists. Regarding the effectiveness of the developed controller for uncertain elements in robot manipulators, we show that the gain from the disturbance to the state of the closed‐loop system is bounded by a certain performance level . Finally, some experimental results are given to demonstrate the theoretical validity and the practical effectiveness of the overall proposed arguments in a comparative fashion.
- 14 January 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 36 (7) , 3819-3837
A Predefined‐Time L∞ Control of Robot Manipulators
This paper is concerned with developing a new synthesis framework for a predefined‐time controller with respect to robot manipulators in the presence of external disturbances, by which predefined‐time stability and a finite ‐gain are ensured. We first develop a stabilizing controller by using the passivity properties of robot manipulators. Then, it is shown that the developed controller makes the state of the resulting closed‐loop system converge to zero within a predefined‐time when no uncertain element exists. Regarding the effectiveness of the developed controller for uncertain elements in robot manipulators, we show that the gain from the disturbance to the state of the closed‐loop system is bounded by a certain performance level . Finally, some experimental results are given to demonstrate the theoretical validity and the practical effectiveness of the overall proposed arguments in a comparative fashion.
- Open Access
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 11 (10) , 34141-34171
Polyhedral-type reachable set estimation with generalized initial conditions: From positive systems to general linear delay systems
This work developed a polyhedral set-based approach for bounding reachable sets of linear systems with nonzero polyhedral initial sets. We first considered linear positive systems and established sufficient conditions for constructing polyhedral bounds of reachable sets in both delay-free and time-varying-delay cases. For systems without delays, the conventional polyhedral set-bounding approach was extended to accommodate nontrivial initial sets given in polyhedral form. For systems with time-varying delays, the conventional auxiliary functional used for reachable set bounding was generalized to account for the effect of time-varying delays. The proposed framework was then extended to general linear systems that are not necessarily positive. In particular, for the case with delays, the auxiliary functional established for positive systems was further generalized by employing absolute values of the state. The resulting sufficient conditions provided polyhedral reachable set bounds for both delay-free and time-varying-delay systems, and all the proposed bounding sets were shown to be computed via linear programming. Several numerical examples are provided to illustrate the effects of nonzero initial sets and time-varying delay parameters on the resulting bounds, and to demonstrate the applicability of the proposed approach to general linear systems.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 11 (10) , 34141-34171
Open AccessPolyhedral-type reachable set estimation with generalized initial conditions: From positive systems to general linear delay systems
This work developed a polyhedral set-based approach for bounding reachable sets of linear systems with nonzero polyhedral initial sets. We first considered linear positive systems and established sufficient conditions for constructing polyhedral bounds of reachable sets in both delay-free and time-varying-delay cases. For systems without delays, the conventional polyhedral set-bounding approach was extended to accommodate nontrivial initial sets given in polyhedral form. For systems with time-varying delays, the conventional auxiliary functional used for reachable set bounding was generalized to account for the effect of time-varying delays. The proposed framework was then extended to general linear systems that are not necessarily positive. In particular, for the case with delays, the auxiliary functional established for positive systems was further generalized by employing absolute values of the state. The resulting sufficient conditions provided polyhedral reachable set bounds for both delay-free and time-varying-delay systems, and all the proposed bounding sets were shown to be computed via linear programming. Several numerical examples are provided to illustrate the effects of nonzero initial sets and time-varying delay parameters on the resulting bounds, and to demonstrate the applicability of the proposed approach to general linear systems.
- Open Access
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 11 (9) , 30460-30483
A monodromy operator-based interpretation for repetitive control of robot manipulators with controller synthesis and stability analysis
A monodromy operator-based interpretation for repetitive control of robot manipulators subject to periodic reference and disturbance signals is established in this paper. An inverse dynamics strategy is first employed to convert the coupled nonlinear input–output relation of a robot manipulator into a decoupled linear time-invariant (LTI) representation, for which the conventional repetitive control approach can be applied. Such an application leads to a unified expression, i.e., a delay-feedback system, suitable for both controller synthesis and stability analysis. Two linear matrix inequality (LMI) formulations are established to obtain repetitive controllers that minimize the $ H_\infty $ and generalized $ H_2 $ norms from the disturbance to the tracking error, respectively. The resulting closed-loop systems are shown to be exponentially stable if and only if the spectrum radii of their monodromy operators are less than $ 1 $. We further show that the exponential stability also implies the input-to-state stability (ISS) under bounded disturbances. Finally, simulation comparisons are presented to demonstrate the effectiveness of the overall arguments.- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 11 (9) , 30460-30483
Open AccessA monodromy operator-based interpretation for repetitive control of robot manipulators with controller synthesis and stability analysis
A monodromy operator-based interpretation for repetitive control of robot manipulators subject to periodic reference and disturbance signals is established in this paper. An inverse dynamics strategy is first employed to convert the coupled nonlinear input–output relation of a robot manipulator into a decoupled linear time-invariant (LTI) representation, for which the conventional repetitive control approach can be applied. Such an application leads to a unified expression, i.e., a delay-feedback system, suitable for both controller synthesis and stability analysis. Two linear matrix inequality (LMI) formulations are established to obtain repetitive controllers that minimize the $ H_\infty $ and generalized $ H_2 $ norms from the disturbance to the tracking error, respectively. The resulting closed-loop systems are shown to be exponentially stable if and only if the spectrum radii of their monodromy operators are less than $ 1 $. We further show that the exponential stability also implies the input-to-state stability (ISS) under bounded disturbances. Finally, simulation comparisons are presented to demonstrate the effectiveness of the overall arguments. - 28 August 2025
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 36 (2) , 802-815
A Generalized Framework for the L1$ {L}_1 $ Optimal Controller Synthesis in Sampled‐Data SystemsThis article introduces a generalized framework for the optimal control of sampled‐data systems, in which an optimal discrete‐time controller is designed to minimize the continuous‐time ‐induced norm of the feedback system for a given continuous‐time plant. This article aims at deriving a discrete‐time plant (approximately) equivalent to the original continuous‐time plant in the sense of the optimal control, by which the hybrid continuous/discrete‐time optimal control problem is reducible to the pure discrete‐time optimal control problem. To this end, we first develop a method for approximating the input function and the kernel function of the input operator together with the hold function of the output operator in the lifted description of sampled‐data systems by piecewise linear functions. More precisely, this method is based on dividing the sampling interval by subintervals with equal width and taking the freedom in the point on each subinterval around which associated functions are expanded to the Taylor series. The piecewise linear approximations lead to discretizing the continuous‐time plant, and a discrete‐time optimal controller for the resulting discrete‐time system is shown to approximately minimize the ‐induced norm of the original sampled‐data system in the relevant order of . We further show that the Taylor expansion taken around the central point of each of the subintervals might achieve the most quantitatively improved discretization in terms of the optimal control. Finally, the overall arguments developed in this article are demonstrated through some numerical studies.
- 28 August 2025
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 36 (2) , 802-815
A Generalized Framework for the L1$ {L}_1 $ Optimal Controller Synthesis in Sampled‐Data SystemsThis article introduces a generalized framework for the optimal control of sampled‐data systems, in which an optimal discrete‐time controller is designed to minimize the continuous‐time ‐induced norm of the feedback system for a given continuous‐time plant. This article aims at deriving a discrete‐time plant (approximately) equivalent to the original continuous‐time plant in the sense of the optimal control, by which the hybrid continuous/discrete‐time optimal control problem is reducible to the pure discrete‐time optimal control problem. To this end, we first develop a method for approximating the input function and the kernel function of the input operator together with the hold function of the output operator in the lifted description of sampled‐data systems by piecewise linear functions. More precisely, this method is based on dividing the sampling interval by subintervals with equal width and taking the freedom in the point on each subinterval around which associated functions are expanded to the Taylor series. The piecewise linear approximations lead to discretizing the continuous‐time plant, and a discrete‐time optimal controller for the resulting discrete‐time system is shown to approximately minimize the ‐induced norm of the original sampled‐data system in the relevant order of . We further show that the Taylor expansion taken around the central point of each of the subintervals might achieve the most quantitatively improved discretization in terms of the optimal control. Finally, the overall arguments developed in this article are demonstrated through some numerical studies.
- Open Access
- 6 April 2025
- Published by Wiley in Advanced Intelligent Systems
- Vol. 7 (5)
A Novel Anomaly Forecasting in Time‐Series Data: Feedback Connection between Forecasting and Detecting Algorithms with Applications to Power Systems
This article is concerned with developing a novel structure of machine learning‐based anomaly forecasting, by which both forecasting the future states and detecting the anomalies in these states can be achieved at the same time. The main idea of this article is to introduce a feedback connection to combine several algorithms with respect to the forecasting and the detecting in a single algorithm. More precisely, Xgboost and long short‐term memory are used for forecastor and one‐class support vector machine and robust random cut forest are used for detector. Combining those 2 × 2 schemes leads to the overall four algorithms, and future anomalies can be detected before they occur. The effectiveness of the proposed algorithms is verified through some comparative simulations of an IEEE 3‐bus system with various faults. More interestingly, the detecting accuracies obtained through the two schemes of taking robust random cut forest are shown to be improved by 10% than those of employing the one‐class support vector machine. For the forecasting part, Xgboost is regarded as involving the fastest prediction speed for online implementations, and thus the combination of Xgboost and robust random cut forest can be the most suitable choice for anomaly forecasting for power system fault events.
- 6 April 2025
- Published by Wiley in Advanced Intelligent Systems
- Vol. 7 (5)
Open AccessA Novel Anomaly Forecasting in Time‐Series Data: Feedback Connection between Forecasting and Detecting Algorithms with Applications to Power Systems
This article is concerned with developing a novel structure of machine learning‐based anomaly forecasting, by which both forecasting the future states and detecting the anomalies in these states can be achieved at the same time. The main idea of this article is to introduce a feedback connection to combine several algorithms with respect to the forecasting and the detecting in a single algorithm. More precisely, Xgboost and long short‐term memory are used for forecastor and one‐class support vector machine and robust random cut forest are used for detector. Combining those 2 × 2 schemes leads to the overall four algorithms, and future anomalies can be detected before they occur. The effectiveness of the proposed algorithms is verified through some comparative simulations of an IEEE 3‐bus system with various faults. More interestingly, the detecting accuracies obtained through the two schemes of taking robust random cut forest are shown to be improved by 10% than those of employing the one‐class support vector machine. For the forecasting part, Xgboost is regarded as involving the fastest prediction speed for online implementations, and thus the combination of Xgboost and robust random cut forest can be the most suitable choice for anomaly forecasting for power system fault events.