Duckhyun Suh
Duckhyun Suh has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Jooyoung Kim
LIG Defense & Aerospace, Seongnam 13488, Republic of Korea
3 shared publications - Sungjun Shim3 shared publications
- Beom-Joon Park
AI Robotics R&D Division, Korea Institute of Robotics & Technology Convergence (KIRO), 4 Jagok-ro 7-gil, Gangnam-gu, Seoul 06372, Republic of Korea
2 shared publications - Byeongho Lee
Center for Humanoid Research, Korea Institute of Science and Technology, Seoul, South Korea
2 shared publications - Frank Chongwoo Park
Seoul National University
2 shared publications - Ha-Yoon Song
AI Robotics R&D Division, Korea Institute of Robotics & Technology Convergence (KIRO), 4 Jagok-ro 7-gil, Gangnam-gu, Seoul 06372, Republic of Korea
2 shared publications
Latest Publications
- 31 October 2026
- Published by Korean Institute of Information Technology in The Journal of Korean Institute of Information Technology
- Vol. 24 (10) , 137-145
Performance Comparison of Thermal Human Detection Models for Small Reconnaissance Robots
- 31 October 2026
- Published by Korean Institute of Information Technology in The Journal of Korean Institute of Information Technology
- Vol. 24 (10) , 137-145
Performance Comparison of Thermal Human Detection Models for Small Reconnaissance Robots
- Open Access
- 17 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (20) , 10295
Capability-Conditioned Relay Placement for Geometrically Feasible Chains in Multi-Robot Teams with Heterogeneous Communication Ranges
Multi-robot task allocation can place relay and mission goals in one matrix; whether this controls geometric relay-chain feasibility in execution had not been established. A deployed unified formulation was evaluated in closed-loop Robot Operating System 2 (ROS 2)/Gazebo simulation on six identical robots with synthetic ranges and no simulated radio, as component-level assurance for human-supervised systems, not a mission-success estimate. As deployed, a mission task displaced a relay in 20/20 trials; a cost-divisor capability model assigned hops beyond holders’ ranges. After two established repairs, capability-conditioned relay placement (CCRP) chose relay positions and holders jointly, bounding each hop by both holders’ ranges. On the mixed-range fleet, CCRP formed a geometrically feasible chain in 10/10 trials, in s (median) against s for equal-hop placement in one session (in-session gains – s, not all significant). Across five arrangement–target cells, plans were reproduced in 100/100 trials. CCRP’s median formation time was lower in all four cells whose holders differed, significantly in two; in one, the capability-blind fall-through held no chain. CCRP produced geometrically feasible plans and, on the mixed-range fleet, faster chain formation; stalls beside stationary robots remained outside its distance objective. No transfer to untested maps, radios or hardware is claimed.- 17 October 2026
- Published by MDPI AG in Applied Sciences
- Vol. 16 (20) , 10295
Open AccessCapability-Conditioned Relay Placement for Geometrically Feasible Chains in Multi-Robot Teams with Heterogeneous Communication Ranges
Multi-robot task allocation can place relay and mission goals in one matrix; whether this controls geometric relay-chain feasibility in execution had not been established. A deployed unified formulation was evaluated in closed-loop Robot Operating System 2 (ROS 2)/Gazebo simulation on six identical robots with synthetic ranges and no simulated radio, as component-level assurance for human-supervised systems, not a mission-success estimate. As deployed, a mission task displaced a relay in 20/20 trials; a cost-divisor capability model assigned hops beyond holders’ ranges. After two established repairs, capability-conditioned relay placement (CCRP) chose relay positions and holders jointly, bounding each hop by both holders’ ranges. On the mixed-range fleet, CCRP formed a geometrically feasible chain in 10/10 trials, in s (median) against s for equal-hop placement in one session (in-session gains – s, not all significant). Across five arrangement–target cells, plans were reproduced in 100/100 trials. CCRP’s median formation time was lower in all four cells whose holders differed, significantly in two; in one, the capability-blind fall-through held no chain. CCRP produced geometrically feasible plans and, on the mixed-range fleet, faster chain formation; stalls beside stationary robots remained outside its distance objective. No transfer to untested maps, radios or hardware is claimed. - Open Access
- 5 April 2026
- Published by The Korea Institute of Military Science and Technology in Journal of the Korea Institute of Military Science and Technology
- Vol. 29 (2) , 142-155
Cohesion-Based Genetic Algorithm for Small Heterogeneous Robot Coalition Formation and Task Allocation in Unstructured Indoor Exploration
Traditional single task-multi robot-instantaneous assignment(ST-MR-IA) methods often suffer from rigidity under resource constraints and unbalanced resource usage. To address these issues, this paper proposes a genetic algorithm-based approach for coalition formation and task allocation in heterogeneous multi-robot systems(MRS) operating in unstructured environments. Leveraging GA flexibility, the proposed method identifies near-optimal solutions even with insufficient resources. By incorporating spatial cohesion, it groups proximal robots to minimize path deviation, ensuring consistent travel distances and balanced resource consumption. Gazebo simulations across three mission scenarios validate that this approach significantly improves mission feasibility and efficiency compared to linear programming-based algorithms.
- 5 April 2026
- Published by The Korea Institute of Military Science and Technology in Journal of the Korea Institute of Military Science and Technology
- Vol. 29 (2) , 142-155
Open AccessCohesion-Based Genetic Algorithm for Small Heterogeneous Robot Coalition Formation and Task Allocation in Unstructured Indoor Exploration
Traditional single task-multi robot-instantaneous assignment(ST-MR-IA) methods often suffer from rigidity under resource constraints and unbalanced resource usage. To address these issues, this paper proposes a genetic algorithm-based approach for coalition formation and task allocation in heterogeneous multi-robot systems(MRS) operating in unstructured environments. Leveraging GA flexibility, the proposed method identifies near-optimal solutions even with insufficient resources. By incorporating spatial cohesion, it groups proximal robots to minimize path deviation, ensuring consistent travel distances and balanced resource consumption. Gazebo simulations across three mission scenarios validate that this approach significantly improves mission feasibility and efficiency compared to linear programming-based algorithms.
- 28 February 2026
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 21 (1) , 26-32
Improving Reinforcement Learning-Based Indoor Exploration Through Uncertainty Estimation
- 28 February 2026
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 21 (1) , 26-32
Improving Reinforcement Learning-Based Indoor Exploration Through Uncertainty Estimation
- 28 November 2025
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 20 (4) , 555-561
Decentralized Frontier-based Exploration Method Under Constrained Global Information
- 28 November 2025
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 20 (4) , 555-561
Decentralized Frontier-based Exploration Method Under Constrained Global Information
- 29 August 2025
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 20 (3) , 464-470
A Random 2D Environment Generation Framework for Learning-Based Navigation in Office Buildings
- 29 August 2025
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 20 (3) , 464-470
A Random 2D Environment Generation Framework for Learning-Based Navigation in Office Buildings