Geonhyeok Park

Geonhyeok Park

Auto-generated profile, based on publicly available information

Geonhyeok Park

Department of Mechanical Engineering, Korea University, Seoul 02841, Republic of Korea

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
6 October 2022 in IEEE Access
Verified
Journal Article
Open access
JLJinwon Lee
Jinwon Lee
GPGeonhyeok Park
Geonhyeok Park
ICIkhyeon Cho
Ikhyeon Cho
KKKeundong Kang
Keundong Kang
DPDaehyun Pyo
Daehyun Pyo
WCWoojin Chung
Woojin Chung
Autonomous mobile robots have been used in outdoor delivery services. Delivery robots have to cope with dynamic obstacles and various environmental conditions. Although several successful technological solutions are available for indoor applications, there are still plenty of unsolved problems in outdoor environments. In this study, we concentrate on three technological challenges hindering the development of campus delivery robots. The first challenge is robust localization in various dynamic outdoor environments. Localization results obtained using lidars and Global Navigation Satellite System (GNSS) sensors show complementary advantages and disadvantages. The proposed localization strategy efficiently combines information from multiple sensors. The second challenge is safe navigation based on the detection of the traversable region. The presented terrain traversability analysis provides clear, real-time positive and negative obstacle information. The third challenge is the requirement of an effective path planning strategy to reduce the risk of collisions or deadlocks. We collected the appearance history of regional dynamic obstacles in the map. The resultant path was carefully generated to avoid crowded areas. Experimental verifications have been successfully conducted on the Korea University campus. The presented results clearly indicate that the proposed methods are essential to achieve safe and reliable navigation in dynamic, real-world environments.

9 July 2024 in Journal of Field Robotics
Verified
Journal Article
Open access
GPGeonhyeok Park
Geonhyeok Park
WCWoojin Chung
Woojin Chung
Accurate and robust localization is essential for autonomous mobile robots. Map matching based on Light Detection and Ranging (LiDAR) sensors has been widely adopted to estimate the global location of robots. However, map‐matching performance can be degraded when the environment changes or when sufficient features are unavailable. Indiscriminately incorporating inaccurate map‐matching poses for localization can significantly decrease the reliability of pose estimation. This paper aims to develop a robust LiDAR‐based localization method based on map matching. We focus on determining appropriate weights that are computed from the uncertainty of map‐matching poses. The uncertainty of map‐matching poses is estimated by the probability distribution over the poses. We exploit the normal distribution transform map to derive the probability distribution. A factor graph is employed to combine the map‐matching pose, LiDAR‐inertial odometry, and global navigation satellite system information. Experimental verification was successfully conducted outdoors on the university campus in three different scenarios, each involving changing or dynamic environments. We compared the performance of the proposed method with three LiDAR‐based localization methods. The experimental results show that robust localization performances can be achieved even when map‐matching poses are inaccurate in various outdoor environments. The experimental video can be found at https://youtu.be/L6p8gwxn4ak.

1 July 2026 in Sensors
Verified
Journal Article
Open access
PDF file
SPSeihoon Park
Seihoon Park
JLJinwon Lee
Jinwon Lee
GPGeonhyeok Park
Geonhyeok Park
ICIkhyeon Cho
Ikhyeon Cho
SMSeongjoon Moon
Seongjoon Moon
WCWoojin Chung
Woojin Chung
Multi-Agent Path Finding (MAPF) is a core technology for logistics automation in factories and warehouses. Guidance-based approaches that reflect the structural properties of factory environments have been widely adopted for computational efficiency and execution feasibility. However, these approaches generally assume static environments in which predefined guidance policies remain valid. Therefore, unexpected obstacles can cause inter-robot collisions or deadlocks. To make nominal MAPF plans robust against execution uncertainty, prior studies have incorporated bounded execution delays into MAPF. A representative method is k Robust Multi-Agent Path Finding (kR-MAPF), which models allowable execution delay using a global robustness parameter k. However, when large obstacle-induced delays are represented by a single global robustness parameter, kR-MAPF imposes unnecessary conservatism and increases the search space. This increase in search space raises planning runtime and reduces path efficiency in large-scale robot fleet operation. This paper proposes a multi-robot path planning framework that updates guidance policies for each segment based on real-time obstacle information. The proposed framework identifies robots affected by obstacles and selectively replans their paths, thereby reducing unnecessary computation while maintaining path planning success and path efficiency. Simulation results in a 100m×100m factory environment with up to 100 robots demonstrate that the proposed framework maintains a 100% success rate under all tested conditions. Compared with kR-MAPF with different values of k, the proposed framework reduces planning runtime by approximately 35–79% and flowtime by approximately 7–24%. These results demonstrate that obstacle-aware selective replanning can improve both real-time performance and path efficiency in dynamic factory environments. The proposed framework provides a technical basis for stable large-scale multi-robot operation in structured industrial environments.