Hyung-Seok Park
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hyung-Seok Park has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Kyung-Joon Park
Department of Electrical Engineering and Computer Science, Daegu Gyeongbuk Institute of Science and Technology (DGIST), Daegu, South Korea
6 shared publications - Jiyeong Chae
Department of Electrical Engineering and Computer Science, Daegu Gyeongbuk Institute of Science and Technology (DGIST), Daegu, South Korea
2 shared publications - Sanghoon Lee
Department of Electrical Engineering and Computer Science, Daegu Gyeongbuk Institute of Science and Technology (DGIST), Daegu, South Korea
2 shared publications - Sihoon Moon
Department of Electrical Engineering and Computer Science, Daegu Gyeongbuk Institute of Science and Technology, Daegu, South Korea
2 shared publications - Doo-Sik Um
Electrical Engineering and Computer Science, Daegu Gyeongbuk Institute of Science and Technology, Daegu, Republic of Korea
1 shared publication - Hoon Sung Chwa
Daegu Gyeongbuk Institute of Science and Technology (DGIST)
1 shared publication
Latest Publications
- Open Access
Probabilistic Latency Analysis of the Data Distribution Service in ROS 2
Robot Operating System 2 (ROS 2) is now the de facto standard for robotic communication, pairing UDP transport with the Data Distribution Service (DDS) publish-subscribe middleware. DDS achieves reliability through periodic heartbeats that solicit acknowledgments for missing samples and trigger selective retransmissions. In lossy wireless networks, the tight coupling among heartbeat period, IP fragmentation, and retransmission interval obscures end to end latency behavior and leaves practitioners with little guidance on how to tune these parameters. To address these challenges, we propose a probabilistic latency analysis (PLA) that analytically models the reliable transmission process of ROS 2 DDS communication using a discrete state approach. By systematically analyzing both middleware level and transport level events, PLA computes the steady state probability distribution of unacknowledged messages and the retransmission latency. We validate our PLA across 270 scenarios, exploring variations in packet delivery ratios, message sizes, and both publishing and retransmission intervals, demonstrating a close alignment between analytical predictions and experimental results. Our findings establish a theoretical basis to systematically optimize reliability, latency, and performance in wireless industrial robotics.
Open AccessProbabilistic Latency Analysis of the Data Distribution Service in ROS 2
Robot Operating System 2 (ROS 2) is now the de facto standard for robotic communication, pairing UDP transport with the Data Distribution Service (DDS) publish-subscribe middleware. DDS achieves reliability through periodic heartbeats that solicit acknowledgments for missing samples and trigger selective retransmissions. In lossy wireless networks, the tight coupling among heartbeat period, IP fragmentation, and retransmission interval obscures end to end latency behavior and leaves practitioners with little guidance on how to tune these parameters. To address these challenges, we propose a probabilistic latency analysis (PLA) that analytically models the reliable transmission process of ROS 2 DDS communication using a discrete state approach. By systematically analyzing both middleware level and transport level events, PLA computes the steady state probability distribution of unacknowledged messages and the retransmission latency. We validate our PLA across 270 scenarios, exploring variations in packet delivery ratios, message sizes, and both publishing and retransmission intervals, demonstrating a close alignment between analytical predictions and experimental results. Our findings establish a theoretical basis to systematically optimize reliability, latency, and performance in wireless industrial robotics.
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-14
PINMAP: A Cost-Efficient Algorithm for Glass Detection and Mapping Using Low-Cost 2-D LiDAR
Autonomous Mobile Robots (AMRs) have seen rapid adoption due to their ability to autonomously navigate, avoid obstacles, and collaborate efficiently in complex environments. AMRs equipped with LiDAR-based Simultaneous Localization and Mapping (SLAM) are effective in obstacle-rich settings. However, SLAM approaches, particularly those using low-cost 2D LiDAR, face challenges in accurately detecting and mapping glass surfaces. AMRs may interpret glass as open space, potentially leading to collisions. In this paper, we propose a novel framework, Probabilistic Incremental Navigation-based Mapping with Accumulative Point cloud data (PINMAP), which enables glass detection and mapping without additional sensor hardware or high-cost LiDAR systems. The proposed PINMAP framework offers three key advantages: First, PINMAP achieves accurate detection and mapping of transparent obstacles, such as glass, using only low-cost 2D LiDAR. Second, PINMAP distinguishes between static and temporary obstacles, effectively adapting to dynamic environments. Finally, PINMAP significantly reduces mapping costs by eliminating the need for manual labeling of glass and temporary obstacles. We empirically validate the performance of PINMAP through extensive experiments, including highly dynamic real-world scenarios.
- 7 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-14
PINMAP: A Cost-Efficient Algorithm for Glass Detection and Mapping Using Low-Cost 2-D LiDAR
Autonomous Mobile Robots (AMRs) have seen rapid adoption due to their ability to autonomously navigate, avoid obstacles, and collaborate efficiently in complex environments. AMRs equipped with LiDAR-based Simultaneous Localization and Mapping (SLAM) are effective in obstacle-rich settings. However, SLAM approaches, particularly those using low-cost 2D LiDAR, face challenges in accurately detecting and mapping glass surfaces. AMRs may interpret glass as open space, potentially leading to collisions. In this paper, we propose a novel framework, Probabilistic Incremental Navigation-based Mapping with Accumulative Point cloud data (PINMAP), which enables glass detection and mapping without additional sensor hardware or high-cost LiDAR systems. The proposed PINMAP framework offers three key advantages: First, PINMAP achieves accurate detection and mapping of transparent obstacles, such as glass, using only low-cost 2D LiDAR. Second, PINMAP distinguishes between static and temporary obstacles, effectively adapting to dynamic environments. Finally, PINMAP significantly reduces mapping costs by eliminating the need for manual labeling of glass and temporary obstacles. We empirically validate the performance of PINMAP through extensive experiments, including highly dynamic real-world scenarios.
- Open Access
Predictive Forwarding Rule Caching for Latency Reduction in Dynamic SDN
In mission-critical environments such as industrial and military settings, the use of unmanned vehicles is on the rise. These scenarios typically involve a ground control system (GCS) and nodes such as unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs). The GCS and nodes exchange different types of information, including control data that direct unmanned vehicle movements and sensor data that capture real-world environmental conditions. The GCS and nodes communicate wirelessly, leading to loss or delays in control and sensor data. Minimizing these issues is crucial to ensure nodes operate as intended over wireless links. In dynamic networks, distributed path calculation methods lead to increased network traffic, as each node independently exchanges control messages to discover new routes. This heightened traffic results in internal interference, causing communication delays and data loss. In contrast, software-defined networking (SDN) offers a centralized approach by calculating paths for all nodes from a single point, reducing network traffic. However, shifting from a distributed to a centralized approach with SDN does not inherently guarantee faster route creation. The speed of generating new routes remains independent of whether the approach is centralized, so SDN does not always lead to faster results. Therefore, a key challenge remains: determining how to create new routes as quickly as possible even within an SDN framework. This paper introduces a caching technique for forwarding rules based on predicted link states in SDN, which was named the CRIMSON (Cashing Routing Information in Mobile SDN Network) algorithm. The CRIMSON algorithm detects network link state changes caused by node mobility and caches new forwarding rules based on predicted topology changes. We validated that the CRIMSON algorithm consistently reduces end-to-end latency by an average of 88.96% and 59.49% compared to conventional reactive and proactive modes, respectively.
Open AccessPredictive Forwarding Rule Caching for Latency Reduction in Dynamic SDN
In mission-critical environments such as industrial and military settings, the use of unmanned vehicles is on the rise. These scenarios typically involve a ground control system (GCS) and nodes such as unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs). The GCS and nodes exchange different types of information, including control data that direct unmanned vehicle movements and sensor data that capture real-world environmental conditions. The GCS and nodes communicate wirelessly, leading to loss or delays in control and sensor data. Minimizing these issues is crucial to ensure nodes operate as intended over wireless links. In dynamic networks, distributed path calculation methods lead to increased network traffic, as each node independently exchanges control messages to discover new routes. This heightened traffic results in internal interference, causing communication delays and data loss. In contrast, software-defined networking (SDN) offers a centralized approach by calculating paths for all nodes from a single point, reducing network traffic. However, shifting from a distributed to a centralized approach with SDN does not inherently guarantee faster route creation. The speed of generating new routes remains independent of whether the approach is centralized, so SDN does not always lead to faster results. Therefore, a key challenge remains: determining how to create new routes as quickly as possible even within an SDN framework. This paper introduces a caching technique for forwarding rules based on predicted link states in SDN, which was named the CRIMSON (Cashing Routing Information in Mobile SDN Network) algorithm. The CRIMSON algorithm detects network link state changes caused by node mobility and caches new forwarding rules based on predicted topology changes. We validated that the CRIMSON algorithm consistently reduces end-to-end latency by an average of 88.96% and 59.49% compared to conventional reactive and proactive modes, respectively.
- 30 November 2023
- Published by Institute of Control, Robotics and Systems in Journal of Institute of Control, Robotics and Systems
- Vol. 29 (11) , 854-858
Fast Routing With Rule Caching in Lossy Mobile SDN
Unmanned Aerial Vehicles (UAVs) and Unmanned Ground Vehicles (UGVs) have been actively employed for tasks that are challenging for humans, such as scenarios like battlefield and disaster. Swarm unmanned systems, comprising UAVs and UGVs, experience dynamic additions or removals of unmanned aircraft. In this paper, we propose a rule caching-based recovery technique for achieving rapid forwarding rule establishment for additional UAVs deployed for recovery in wireless Software-defined Networking (SDN) based swarm unmanned systems. To validate the proposed algorithm, we conducted experiments by setting up a testbed using ODROID and a controller. Our results demonstrate that the proposed algorithm improves forwarding rule establishment performance by up to 50.3%.
- 30 November 2023
- Published by Institute of Control, Robotics and Systems in Journal of Institute of Control, Robotics and Systems
- Vol. 29 (11) , 854-858
Fast Routing With Rule Caching in Lossy Mobile SDN
Unmanned Aerial Vehicles (UAVs) and Unmanned Ground Vehicles (UGVs) have been actively employed for tasks that are challenging for humans, such as scenarios like battlefield and disaster. Swarm unmanned systems, comprising UAVs and UGVs, experience dynamic additions or removals of unmanned aircraft. In this paper, we propose a rule caching-based recovery technique for achieving rapid forwarding rule establishment for additional UAVs deployed for recovery in wireless Software-defined Networking (SDN) based swarm unmanned systems. To validate the proposed algorithm, we conducted experiments by setting up a testbed using ODROID and a controller. Our results demonstrate that the proposed algorithm improves forwarding rule establishment performance by up to 50.3%.
- Open Access
- 1 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 19 (8) , 9123-9133
CAPL: Criticality-Aware Adaptive Path Learning for Industrial Wireless Sensor–Actuator Networks
Wireless technologies, such as WirelessHART, are being adopted in industrial wireless sensor–actuator networks (IWSAN), which are required to provide reliable quality of control (QoC). This article focuses on adaptively selecting the best network path for reliable QoC in the IWSAN. The main challenge is estimating the time-varying packet delivery ratio (PDR) of each path. The IWSAN path selection problem in a multi-armed bandit (MAB) framework is formulated. A novel algorithm criticality-aware adaptive path learning (CAPL) is proposed, which determines the criticality of each packet according to the degree of QoC degradation if it is lost. The key novelty of CAPL is that it simultaneously considers the fundamental exploration–exploitation trade-off in MAB and QoC in the IWSAN. CAPL uses low-criticality packets for exploration to measure the PDR so that it can minimize the impact of exploration on QoC degradation. CAPL with extensive simulation and empirical studies for DC motor position control is validated.
- 1 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 19 (8) , 9123-9133
Open AccessCAPL: Criticality-Aware Adaptive Path Learning for Industrial Wireless Sensor–Actuator Networks
Wireless technologies, such as WirelessHART, are being adopted in industrial wireless sensor–actuator networks (IWSAN), which are required to provide reliable quality of control (QoC). This article focuses on adaptively selecting the best network path for reliable QoC in the IWSAN. The main challenge is estimating the time-varying packet delivery ratio (PDR) of each path. The IWSAN path selection problem in a multi-armed bandit (MAB) framework is formulated. A novel algorithm criticality-aware adaptive path learning (CAPL) is proposed, which determines the criticality of each packet according to the degree of QoC degradation if it is lost. The key novelty of CAPL is that it simultaneously considers the fundamental exploration–exploitation trade-off in MAB and QoC in the IWSAN. CAPL uses low-criticality packets for exploration to measure the PDR so that it can minimize the impact of exploration on QoC degradation. CAPL with extensive simulation and empirical studies for DC motor position control is validated.
- Open Access
- 2 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 16 (3) , 4849-4860
AdaptiveHART: An Adaptive Real-Time MAC Protocol for Industrial Internet-of-Things
Wireless sensor–actuator networks (WSAN) for real-time reliable communications are being embraced in the Industrial Internet of Things. One key property required for WSAN is adaptability with respect to dynamic environments. Most existing studies assume that a network manager computes global schedules and disseminates schedule information to every node whenever the network parameters need to be updated. Such a centralized approach may degrade control performance due to nonreal-time response to dynamic environments. In this article, we introduce a novel time division multiple access MAC protocol, AdaptiveHART, which updates the network parameters in real-time without the dissemination intervals. AdaptiveHART achieves a reduction in adaptation latency up to 74%, maximum schedulable ratio, and control performance up to 75% than the conventional WirelessHART. We assess our protocol using a stochastic response time analysis, which provides an accurate end-to-end delay distribution and a schedulability condition that can guarantee real-time performance in WSAN.
- 2 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 16 (3) , 4849-4860
Open AccessAdaptiveHART: An Adaptive Real-Time MAC Protocol for Industrial Internet-of-Things
Wireless sensor–actuator networks (WSAN) for real-time reliable communications are being embraced in the Industrial Internet of Things. One key property required for WSAN is adaptability with respect to dynamic environments. Most existing studies assume that a network manager computes global schedules and disseminates schedule information to every node whenever the network parameters need to be updated. Such a centralized approach may degrade control performance due to nonreal-time response to dynamic environments. In this article, we introduce a novel time division multiple access MAC protocol, AdaptiveHART, which updates the network parameters in real-time without the dissemination intervals. AdaptiveHART achieves a reduction in adaptation latency up to 74%, maximum schedulable ratio, and control performance up to 75% than the conventional WirelessHART. We assess our protocol using a stochastic response time analysis, which provides an accurate end-to-end delay distribution and a schedulability condition that can guarantee real-time performance in WSAN.