Keecheon Kim

Prof. Keecheon Kim


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
30 March 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
KKKeecheon Kim
Keecheon Kim
This study examines various factors and conditions that are related with the performance of reinforcement learning, and defines a multi-agent DQN system (N-DQN) model to improve them. N-DQN model is implemented in this paper with examples of maze finding and ping-pong as examples of delayed reward system, where delayed reward occurs, which makes general DQN learning difficult to apply. The implemented N-DQN shows about 3.5 times higher learning performance compared to the Q-Learning algorithm in the reward-sparse environment in the performance evaluation, and compared to DQN, it shows about 1.1 times faster goal achievement speed. In addition, through the implementation of the prioritized experience replay and the implementation of the reward acquisition section segmentation policy, such a problem as positive-bias of the existing reinforcement learning models seldom or never occurred. However, according to the characteristics of the architecture that uses many numbers of actors in parallel, the need for additional research on light-weighting the system for further performance improvement has raised. This paper describes in detail the structure of the proposed multi-agent N_DQN architecture, the contents of various algorithms used, and the specification for its implementation.

1 March 2009
Verified
Conference Paper
Closed access
ZNZhang Ning
Zhang Ning
YJYunho Jung
Yunho Jung
YJYan Jin
Yan Jin
KKKeecheon Kim
Keecheon Kim
In this paper, we try to proposal a new mechanism for optimizing the route of the Greedy parts of GPSR. By studying the GPSR, we find that the Greedy part of GPSR is not always to find the most optimized route, especially in the denser scenario. So according to this problem, we try to propose a mechanism to find an optimized route. In our proposal, we give out a formula to compute a unique value for each of neighbors. The one with the smallest value will be chosen as the next forwarding hop. The main advantage of our mechanism is that it integrates the influence of both of the denser and sparse environment. Therefore, wherever we located, we can always find an optimized route comparing with GPSR. In this paper, we also give out a mathematical model to evaluate the performance of our proposal. Basing on the model, we use ns to simulate the highway condition. Form the result, we find that our proposal is better that GPSR at aspect of time delay. But in the packet delivery ratio, it doesn't bring us a remarkable improvement. In the following part, I will describe them in detail.

11 May 2022 in IEEE Access
Verified
Journal Article
Open access
KKKeecheon Kim
Keecheon Kim
This paper suggests and implements how to apply the reinforcement learning on delayed reward system which is known to be complex to apply the machine learning technology such as Q-learning. Such games as Tetris game is known to be a delayed reward system because of its characteristics of generating sparse reward in learning process. Tetris game requires the actor’s quick judgment ability and speed of response because the blocks must be stacked in an optimal location quickly, considering the random shape and rotation of appearing blocks. Also, since the number of cases is very large due to the various block types and order, if a human-being is playing the game, the performance is limited by simply relying on human memorization capability. Therefore, we applied a reinforcement learning implemented in this study for this delayed reward system. We find that the general legacy reinforcement learning method shows its limitation in improving the performance. Hence, we apply the heuristic to increase the decision accuracy as the weighting method of reward. As a result, we were able to obtain high scores in games. Although it is not yet possible to say that this heuristic(rule-based) approach has completely conquered the game. In several experiments, this hybrid reinforcement learning shows better playability than human in terms of learning speed, as well as high scores. In this paper, it is shown that general Q-learning is not suitable for delayed reward system. And a hybrid learning that adds prioritized experience replay tactics, and the related techniques and algorithms are introduced to increase the reinforcement learning performance.

17 April 2025 in Electronics
Verified
Journal Article
Open access
PDF file
MYMinseong Yoon
Minseong Yoon
SDSeo Dongjun
Seo Dongjun
SKSoYoung Kim
SoYoung Kim
KKKeecheon Kim
Keecheon Kim
For the commercialization of connected vehicles and smart cities, extensive research is carried out on autonomous driving, Vehicle-to-Everything (V2X) communication, and platooning. However, limitations remain, such as restrictions to highway environments, and studies are conducted separately due to challenges in ensuring reliability and real-time performance under external influences. This paper proposes a cooperative autonomous driving system based on V2X network implemented in the CARLA simulator, which simulates an urban environment to optimize vehicle-embedded systems and ensure safety and real-time performance. First, the proposed Throttle–Steer–Brake (TSB) driving technique reduces the computational overhead for following vehicles by utilizing the control commands of a leading vehicle. Second, a V2X network is designed to support object perception, cluster escape, and joining. Third, an urban perception system is developed and validated for safety. Finally, pseudonymized vehicle identifiers, Advanced Encryption Standard (AES), and the Edwards-curve Digital Signature Algorithm (EdDSA) are employed for data reliability and security. The system is validated in processing time and accuracy, confirming feasibility for real-world application. TSB driving demonstrates a computation speed approximately 466 times faster than conventional waypoints-based driving. Accurate urban perception and V2X communication enable safe cluster escape and joining, establishing a foundation for cooperative autonomous driving with improved safety and real-time capabilities.

7 November 2016 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
MWMin Wei
Min Wei
KKKeecheon Kim
Keecheon Kim
Wireless sensor networks are already employed in numerous applications including military, industry, and health. Among the several inherent limitations in wireless sensor network, security is a critical concern. The declared security functions of wireless devices should be well verified. In this study, a security testing method based on security levels is proposed for wireless sensor networks. In addition, an experimental security testing platform for WIA-PA-based wireless sensor networks is implemented. The test results show that the platform is a feasible platform for assessing device security levels in wireless sensor networks.

26 February 2026 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YHYUSEONG HA
YUSEONG HA
KKKeecheon Kim
Keecheon Kim
Intrusion detectors are often evaluated using average metrics at unconstrained thresholds, yet deployments require explicit control over false alarms. We investigate zero-day (out-of-distribution, OOD) intrusion detection under a target-FPR calibrated protocol, where a threshold is set on benign validation traffic to satisfy a target false positive rate α and transferred, unchanged, to a seen-test and OOD-test. Using CICIDS2017-derived host-session nodes aggregated in 1 min and 5 min windows, we compare tabular baselines, message-passing GNNs on a rule-based graph, and employ a method that builds a k-nearest-neighbor similarity graph with lightweight feature pre-smoothing. Robustness is measured using the OOD violation ratio, percentile tail risk, and feasibility under explicit false-alarm budgets. Base-graph GNNs exhibit heavy-tailed false-alarm amplification under OOD shifts: at α = 0.001, the p95 violation ratio reaches 68.50 (1 m) and 67.95 (5 m). In contrast, the proposed method reduces p95 to 3.41 (1 m) and 1.15 (5 m) and improves budget feasibility. We further verify robustness beyond a single held-out family by evaluating additional unseen-family splits (e.g., DDoS and DDoS+DoS) under the same calibrated operating point. We also quantify deployment-oriented cost via edge-list size and practical parsing/loading time. These findings suggest that similarity-based graphs with light pre-smoothing improve deployability under distribution shifts.