Jung Kyu Park

Jung Kyu Park


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
1 June 2018 in Nuclear Engineering and Technology
Verified
Journal Article
Open access
JPJung Kyu Park
Jung Kyu Park
EFEduardo B. Farfán
Eduardo B. Farfán
CEChristian Enriquez
Christian Enriquez

6 October 2024 in International Journal of Precision Engineering and Manufacturing
Verified
Journal Article
Closed access
PDF file
JLJun-Sik Lee
Jun-Sik Lee
KYKi-Cheol Yun
Ki-Cheol Yun
JPJung Kyu Park
Jung Kyu Park

21 January 2020 in BioResources
Verified
Journal Article
Closed access
EPEun Young Park
Eun Young Park
JPJung Kyu Park
Jung Kyu Park

24 February 2025 in Applied Sciences
Verified
Journal Article
Open access
PDF file
YBYoungmi Baek
Youngmi Baek
JPJung Kyu Park
Jung Kyu Park
In this paper, we address the challenge of memory consumption in mobile robot navigation, particularly when using grid-based maps for accurate environment representation. While grid-based maps are widely used, their large memory requirements make them unsuitable for embedded systems. To overcome this limitation, we propose a novel path planning algorithm that rapidly generates secure paths using a hybrid map. This hybrid map significantly reduces memory usage compared to grid-based maps while maintaining the efficiency of a topological map. Experimental results demonstrate that the proposed method requires only 1.5% of the computation time needed for grid-based path planning, ensuring faster and more efficient navigation. Furthermore, the approach provides robust and secure paths, making it ideal for mobile robot applications. This method holds promise for advancing autonomous navigation in resource-constrained environments.

3 February 2025 in Electronics
Verified
Journal Article
Open access
PDF file
JPJung Kyu Park
Jung Kyu Park
YBYoungmi Baek
Youngmi Baek
When cyber–physical systems (CPSs) are connected to the Internet or other CPSs with connectivity, external adversaries can potentially gain access to the CPS and attempt to control the electronic control units (ECUs). In particular, the lack of confidentiality and integrity in the controller area networks (CANs) of CPSs makes it difficult to distinguish malicious data from legitimate data. The security vulnerabilities of CPSs, which are frequently exposed to adversaries, pose the risk of destabilizing the lives of humans. Therefore, we propose a real-time adaptive and lightweight anomaly detection (RALAD) mechanism that efficiently and securely detects anomalies within a given virtual group though verification of the data integrity and key management of stateless synchronization based on a chaotic system while driving. These characteristics prevent an adversary from authenticating maliciously modified messages even though it captures legitimate messages on the CAN bus. RALAD shows a clear difference from others in terms of (1) its unique secret key-sharing method and approach to secret key generation for each message, (2) safe controlling support after detecting anomalies, and (3) its software-based solution that eliminates the need for hardware secure modules. It leads to freedom from the issues of additional cost, weight, and wiring in CPSs. The proposed method achieves real-time anomaly detection, and the experiment results show a 100% detection rate for all attacks. This demonstrates that RALAD maintains high reliability and efficiency, even under various bus load conditions and attack rates.

31 July 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
CLCheol Won Lee
Cheol Won Lee
JLJun Dong Lee
Jun Dong Lee
JAJunho Ahn
Junho Ahn
HOHyung-Jun Oh
Hyung-Jun Oh
JPJung Kyu Park
Jung Kyu Park
HJHeung Seok Jeon
Heung Seok Jeon
The grid map, representing area information with the number of cells, is a widely used mapping scheme for mobile robots and simultaneous localization and mapping (SLAM) processes. However, the tremendous amount of cells in a grid map for a detailed map representation results in overheads for memory space and computing paths in mobile robots. Therefore, to overcome the overhead of the grid map, this study proposes a new low overhead mapping scheme which the authors call as the Rmap that represents an area with variable sizes of rectangles instead of the number of cells in the grid map. This mapping scheme also provides an exploration path for obtaining new information for the unknown area. This study evaluated the performance of the Rmap in real environments as well as in simulation environments. The experiment results show that the Rmap can reduce the overhead of a grid map. In one of our experimental environments, the Rmap represented an area with 85% less memory than the grid map. The Rmap also showed better coverage performance compared with other previous algorithms.