Hongkeun Kim

Hongkeun Kim

Auto-generated profile, based on publicly available information

Hongkeun Kim

ARC-MEE, Future Convergence Engineering, School of Mechatronics Engineering, Korea University of Technology and Education, Cheonan, Republic of Korea

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 October 2010 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
HKHongkeun Kim
Hongkeun Kim
HSHyungbo Shim
Hyungbo Shim
JSJin Heon Seo
Jin Heon Seo
This technical note studies the output consensus problem for a class of heterogeneous uncertain linear multi-agent systems. All the agents can be of any order (which might widely differ among the agents) and possess parametric uncertainties that range over an arbitrarily large compact set. The controller uses only the output information of the plant; moreover, the delivered information throughout the communication network is also restricted to the output of each agent. Based on the output regulation theory, it is shown that the output consensus is reached if the (state) consensus is achieved within the internal models among the agent's controllers (even though the plant's outputs, rather than the internal model's outputs, are communicated). The internal models can be designed and embedded into the controller, which provides considerable flexibility to designers in terms of the type of signals that are agreed on among the agents.

1 March 2017 in Automatica
Verified
Journal Article
Closed access
BPBong Seok Park
Bong Seok Park
JKJi-Wook Kwon
Ji-Wook Kwon
HKHongkeun Kim
Hongkeun Kim

1 January 2013 in Automatica
Verified
Journal Article
Closed access
HKHongkeun Kim
Hongkeun Kim
HSHyungbo Shim
Hyungbo Shim
JBJuhoon Back
Juhoon Back
JSJin Heon Seo
Jin Heon Seo

17 May 2012 in IET Control Theory & Applications
Verified
Journal Article
Closed access
JSJ.H. Seo
J.H. Seo
Juhoon BackJuhoon Back
Juhoon Back
HKH. Kim
H. Kim
HSH. Shim
H. Shim
This study addresses a challenging problem on the consensus of multi-agent systems, that is, simultaneously deals with the high-order linear multi-agent systems (including single and double integrators, and harmonic oscillators) and time-varying interaction topology. The interaction topology is assumed to switch among a finite number of connected undirected graphs having a non-vanishing dwell time. It is also constrained that each agent can use only the system outputs of its neighbouring agents for the purpose of feedback. Under these conditions, the authors propose two high-gain dynamic consensus protocols, one with multiple time-scale based and the other single time-scale, for the uniform rank systems without finite zeros. An example is provided to validate the proposed protocols.

1 February 2016 in Automatica
Verified
Journal Article
Closed access
HKHongkeun Kim
Hongkeun Kim
SKSeongjun Kim
Seongjun Kim
JBJuhoon Back
Juhoon Back
HSHyungbo Shim
Hyungbo Shim
JSJin Heon Seo
Jin Heon Seo

15 August 2013 in International Journal of Systems Science
Verified
Journal Article
Closed access
DVDmitry Vengertsev
Dmitry Vengertsev
HKHongkeun Kim
Hongkeun Kim
JSJin Heon Seo
Jin Heon Seo
HSHyungbo Shim
Hyungbo Shim
Consensus problem for high-order multi-agent systems is considered under deterministic and Markovian switching topologies. Only relative output information of agents is assumed to be available through the networks. First, a necessary and sufficient condition for achieving a consensus under a fixed communication network is presented. Based on this result and the stability of switched systems, a high-order multi-agent system with the proposed low-gain controller is shown to reach a consensus under deterministic switching network if the total time when the network is disconnected is, in some senses, smaller than the total time of the network being connected. Furthermore, the conditions sufficient for a high-order multi-agent system to reach an almost sure and mean-square consensus, under Markovian switching networks, are presented. Finally, illustrative examples are given to demonstrate the results.