Seung Heon Oh

Seung Heon Oh

Auto-generated profile, based on publicly available information

Seung Heon Oh

Department of Naval Architecture and Ocean Engineering, Seoul National University, Seoul, Republic of Korea

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
20 October 2025 in IEEE Transactions on Cybernetics
Verified
Journal Article
Open access
SOSeung Heon Oh
Seung Heon Oh
GBGeon Woong Byeon
Geon Woong Byeon
YCYoung-In Cho
Young-In Cho
SKSeungmin Kwon
Seungmin Kwon
Jong Hun WooJong Hun Woo
Jong Hun Woo
Selecting targets to attack and assigning weapons are among the most critical decisions on the battlefield. The decision problem is represented as a dynamic weapon-target assignment (DWTA) problem. While deep reinforcement learning (DRL) is the state-of-the-art approach for DWTA, previous studies have limitations in three key aspects: 1) representing topological relationships on the battlefield; 2) scalability to increased problem sizes; and 3) performance metric relevance. To overcome these limitations, this study aims to solve the DWTA problem by leveraging DRL and graph neural networks (GNNs), with a novel partially observable Markov decision process (POMDP) design, including graph-based action representation, observation features, and reward design. Experiments are conducted across multiple military domains, including naval and ground combat, comparing the proposed approach with existing heuristic and meta-heuristic methodologies. The effectiveness of the GNN and decision-making pattern is extensively analyzed through comprehensive experimental validation.

30 October 2025 in Journal of Computational Design and Engineering
Verified
Journal Article
Open access
SOSeung Heon Oh
Seung Heon Oh
YCYoung-In Cho
Young-In Cho
HOHyunjin Oh
Hyunjin Oh
JBJiwon Baek
Jiwon Baek
SHSeung Woo Han
Seung Woo Han
Jong Hun WooJong Hun Woo
Jong Hun Woo
This paper addresses a critical research gap in applying deep reinforcement learning to job shop scheduling problems by focusing on state feature design, which has been largely treated as an empirical matter. We present three key contributions: (1) a state feature design framework for reinforcement learning application in scheduling domain: dynamics equation (DE) and predicting state value based on nominal reward (PSVNR) perspectives, (2) the concept of ‘undercooked’ lower bounds that balance computational efficiency with bound tightness, and (3) successful integration of graph attention networks, transformer architecture, and the proposed ‘undercooked’ lower bounds into a unified framework. Our approach outperforms existing methods on 81$\%$ of the benchmark data sets, demonstrating exceptional generalizability and scalability. Through extensive experimentation, we explore and analyse the relationship between lower bound tightness and state value prediction accuracy, suggesting a meaningful connection between classical optimization techniques and modern learning-based approaches. The theoretical framework we develop provides clear guidelines for state feature design in reinforcement learning applications to scheduling problems, while our practical implementation shows significant performance improvements over state-of-the-art methods.

30 April 2026 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
SHSeung Woo Han
Seung Woo Han
SOSeung Heon Oh
Seung Heon Oh
Jong Hun WooJong Hun Woo
Jong Hun Woo

3 November 2025 in Applied Ocean Research
Verified
Journal Article
Open access
GBGeon Woong Byeon
Geon Woong Byeon
SOSeung Heon Oh
Seung Heon Oh
MKMyo Jung Kwak
Myo Jung Kwak
JYJoon Young Yoon
Joon Young Yoon
WHWonHeum Han
WonHeum Han
Jong Hun WooJong Hun Woo
Jong Hun Woo

7 September 2024
Verified
Book Chapter
Closed access
PDF file
SOSeung Heon Oh
Seung Heon Oh
YCYoung-In Cho
Young-In Cho
SHSeung-Woo Han
Seung-Woo Han
JWJong-Hun Woo
Jong-Hun Woo

4 March 2025 in TechRxiv
Verified
Preprint
Open access
SOSeung Heon Oh
Seung Heon Oh
GBGeon Woong Byeon
Geon Woong Byeon
YCYoung In Cho
Young In Cho
SKSeungmin Kwon
Seungmin Kwon
JWJong Hun Woo
Jong Hun Woo
Selecting a threat to attack is one of the most important decisions on the battlefield. The decision problem is represented as a Weapon-Target Assignment problem (WTA) problem. In the previous studies, dynamic programming, linear programming, metaheuristics, and heuristic methods have been applied to solve this problem. However, previous studies have been limited by oversimplified-model, computational burden, lack of adaptability to disruptive events, and recalculation when the problem size changes. To overcome these limitations, this study aims to solve WTA by using reinforcement learning and graph neural networks. The proposed method has high practicality by reflecting the real-world decision-making framework, OODA-loop (Observe-Orient-Decide). Experiments are conducted in various environments, and the effectiveness of the proposed method is demonstrated by comparing it with existing heuristic and meta-heuristic methodologies. The proposed method introduces a groundbreaking methodology for intelligent decision-making in tactical command and control traditionally considered exclusive to human-expert.