Heungseob Kim
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Heungseob Kim has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Byoungho Choi
Department of Smart Manufacturing Engineering, Changwon National University, Changwon-si 51140, Republic of Korea
2 shared publications - Kybeom Kwon
Agency for Defense Development 3 , Daejeon 34186, South Korea
2 shared publications Seokjun Seo
2 shared publications- Seunghyeon Yu
Department of Smart Manufacturing Engineering, Changwon National University, Changwon-si 51140, Republic of Korea
2 shared publications Air Force 3Rd Flying Training Wing
1 shared publication- Cheolkyu Jee
Aerospace Technology Research Institute Agency for Defense Development Daejeon Korea
1 shared publication
Latest Publications
- Open Access
A Cell-Based Ocean-Current-Aware Travel-Time Cost Formulation for Offline 3D Path Planning of Underwater Vehicles
Underwater vehicles must operate efficiently within the limits of their onboard resources, and travel time is a primary operational objective for extending submerged endurance and range. Ocean currents significantly affect vehicle motion and travel time, either aiding or impeding propulsion depending on their direction and magnitude. This study proposes a cell-based, ocean-current-aware cost formulation for offline three-dimensional (3D) underwater path planning. A 3D grid map integrating ocean current vectors and underwater terrain is constructed, and rather than modifying a specific search algorithm, the proposed approach defines a travel-time-based cost at the cell-transition level by incorporating current effects into the vehicle’s effective velocity. Because the cost operates at the cell-transition level, it can be adopted by standard grid-search planners such as Dijkstra’s, A*, and D* without modification. Simulation experiments over the Tsushima–Jeju corridor using two measured current fields from the Korea Hydrographic and Oceanographic Agency show that identical fields aided westbound transits (−2.4% and −4.4% travel time versus a current-unaware baseline) while opposing eastbound transits (+1.3% and +1.8%), with the planner exploiting favorable flows and detouring to mitigate adverse flows; these effects amplified roughly threefold as the vehicle speed decreased from 15 to 6 knots. A* and Dijkstra’s algorithms returned identical optimal costs under the same formulation, confirming planner independence. The results demonstrate that embedding measured current information at the map level yields realistic, condition-dependent, minimum-travel-time routes for offline mission planning.
Open AccessA Cell-Based Ocean-Current-Aware Travel-Time Cost Formulation for Offline 3D Path Planning of Underwater Vehicles
Underwater vehicles must operate efficiently within the limits of their onboard resources, and travel time is a primary operational objective for extending submerged endurance and range. Ocean currents significantly affect vehicle motion and travel time, either aiding or impeding propulsion depending on their direction and magnitude. This study proposes a cell-based, ocean-current-aware cost formulation for offline three-dimensional (3D) underwater path planning. A 3D grid map integrating ocean current vectors and underwater terrain is constructed, and rather than modifying a specific search algorithm, the proposed approach defines a travel-time-based cost at the cell-transition level by incorporating current effects into the vehicle’s effective velocity. Because the cost operates at the cell-transition level, it can be adopted by standard grid-search planners such as Dijkstra’s, A*, and D* without modification. Simulation experiments over the Tsushima–Jeju corridor using two measured current fields from the Korea Hydrographic and Oceanographic Agency show that identical fields aided westbound transits (−2.4% and −4.4% travel time versus a current-unaware baseline) while opposing eastbound transits (+1.3% and +1.8%), with the planner exploiting favorable flows and detouring to mitigate adverse flows; these effects amplified roughly threefold as the vehicle speed decreased from 15 to 6 knots. A* and Dijkstra’s algorithms returned identical optimal costs under the same formulation, confirming planner independence. The results demonstrate that embedding measured current information at the map level yields realistic, condition-dependent, minimum-travel-time routes for offline mission planning.
- Open Access
- 13 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2925
Exact Reliability Model for a Mixed Redundant System with Heterogeneous Components and Component Sequencing
A mixed redundancy, in which some components of a subsystem operate under active redundancy while the others wait in cold standby, has recently been shown to achieve a higher system reliability than the traditional active and standby strategies within equivalent resources. Existing reliability models for the strategy, however, either provide only a lower bound of the subsystem reliability or restrict the components to be identical with exponential or Erlang lifetimes. This study proposes an exact reliability model for a mixed redundant system composed of heterogeneous components. The time to failure of every candidate component is described by a generalized phase-type distribution (PHD), and a structured continuous-time Markov chain (CTMC) integrates the active redundant module, the standby components—installed in a specified sequence recorded by an ordered component-index set—and an imperfect fault detector/switch. Because the model yields the infinitesimal generator of the subsystem lifetime, it provides not only the exact reliability but also the hazard function and the moments of the system lifetime. Building on a pre-computed database that enumerates every feasible subsystem structure, the redundancy allocation problem determining the component types, their number and sequence, and the number of active redundancies is formulated as a compact binary integer linear program and solved to optimality. Benchmark experiments show that the previous approximate function underestimates the achievable design by an average maximum possible improvement (MPI) of 15.6%, and that permitting heterogeneous components raises the optimal system reliability by a further 7.3% on average—up to 18.7% as the resource budget grows.
- 13 August 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (16) , 2925
Open AccessExact Reliability Model for a Mixed Redundant System with Heterogeneous Components and Component Sequencing
A mixed redundancy, in which some components of a subsystem operate under active redundancy while the others wait in cold standby, has recently been shown to achieve a higher system reliability than the traditional active and standby strategies within equivalent resources. Existing reliability models for the strategy, however, either provide only a lower bound of the subsystem reliability or restrict the components to be identical with exponential or Erlang lifetimes. This study proposes an exact reliability model for a mixed redundant system composed of heterogeneous components. The time to failure of every candidate component is described by a generalized phase-type distribution (PHD), and a structured continuous-time Markov chain (CTMC) integrates the active redundant module, the standby components—installed in a specified sequence recorded by an ordered component-index set—and an imperfect fault detector/switch. Because the model yields the infinitesimal generator of the subsystem lifetime, it provides not only the exact reliability but also the hazard function and the moments of the system lifetime. Building on a pre-computed database that enumerates every feasible subsystem structure, the redundancy allocation problem determining the component types, their number and sequence, and the number of active redundancies is formulated as a compact binary integer linear program and solved to optimality. Benchmark experiments show that the previous approximate function underestimates the achievable design by an average maximum possible improvement (MPI) of 15.6%, and that permitting heterogeneous components raises the optimal system reliability by a further 7.3% on average—up to 18.7% as the resource budget grows.
- Open Access
- 26 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1770
An Optimization Framework for Allocating and Scheduling Multiple Tasks of Multiple Logistics Robots
This study addresses the multi-robot task allocation (MRTA) problem for logistics robots operating in zone-picking warehouse environments. With the rapid growth of e-commerce and the Fourth Industrial Revolution, logistics robots are increasingly deployed to manage high-volume order fulfillment. However, efficiently assigning tasks to multiple robots is a complex and computationally intensive problem. To address this, we propose a five-step optimization framework that reduces computation time while maintaining practical applicability. The first step calculates and stores distances and paths between product locations using the A* algorithm, enabling reuse in subsequent computations. The second step performs hierarchical clustering of orders based on spatial similarity and capacity constraints to reduce the problem size. In the third step, the traveling salesman problem (TSP) is formulated to determine the optimal execution sequence within each cluster. The fourth step uses a mixed integer linear programming (MILP) model to allocate clusters to robots while minimizing the overall makespan. Finally, the fifth step incorporates battery constraints by optimizing the task sequence and partial charging schedule for each robot. Numerical experiments were conducted using up to 1000 orders and 100 robots, and the results confirmed that the proposed method is scalable and effective for large-scale scenarios.
- 26 May 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1770
Open AccessAn Optimization Framework for Allocating and Scheduling Multiple Tasks of Multiple Logistics Robots
This study addresses the multi-robot task allocation (MRTA) problem for logistics robots operating in zone-picking warehouse environments. With the rapid growth of e-commerce and the Fourth Industrial Revolution, logistics robots are increasingly deployed to manage high-volume order fulfillment. However, efficiently assigning tasks to multiple robots is a complex and computationally intensive problem. To address this, we propose a five-step optimization framework that reduces computation time while maintaining practical applicability. The first step calculates and stores distances and paths between product locations using the A* algorithm, enabling reuse in subsequent computations. The second step performs hierarchical clustering of orders based on spatial similarity and capacity constraints to reduce the problem size. In the third step, the traveling salesman problem (TSP) is formulated to determine the optimal execution sequence within each cluster. The fourth step uses a mixed integer linear programming (MILP) model to allocate clusters to robots while minimizing the overall makespan. Finally, the fifth step incorporates battery constraints by optimizing the task sequence and partial charging schedule for each robot. Numerical experiments were conducted using up to 1000 orders and 100 robots, and the results confirmed that the proposed method is scalable and effective for large-scale scenarios.
- Open Access
- 16 April 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (8) , 1191
Lifetime Distribution for a Mixed Redundant System with Imperfect Switch and Components Having Phase–Type Time-to-Failure Distribution
Recently, a mixed redundancy was introduced among the redundant design strategies to achieve a more reliable system within the equivalent resources. This study deals with a lifetime distribution for a mixed redundant system with an imperfect fault detector/switch. The lifetime distribution model was formulated using a structured continuous Markov chain (CTMC) and considers the time-to-failure (TTF) distribution of a component as a phase-type distribution (PHD). The model’s versatility and practicality are enhanced because the PHD can represent diverse degradation patterns of the components exposed to varied operating environments. The model provides accurate reliability for a mixed redundant system by advancing the approximate reliability function suggested in previous studies. Furthermore, the model would be useful in system design and management because it provides information such as the nth moment of the system’s lifetime distribution. In numerical experiments on some examples, the mixed redundancy was confirmed to devise a more reliable system than the existing active and standby redundancies, and the improvement effect increased as the number of redundant components decreased. The optimal structure for maximizing the expected lifetime of the system changes depends on the reliability of the components and fault detector/switch.
- 16 April 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (8) , 1191
Open AccessLifetime Distribution for a Mixed Redundant System with Imperfect Switch and Components Having Phase–Type Time-to-Failure Distribution
Recently, a mixed redundancy was introduced among the redundant design strategies to achieve a more reliable system within the equivalent resources. This study deals with a lifetime distribution for a mixed redundant system with an imperfect fault detector/switch. The lifetime distribution model was formulated using a structured continuous Markov chain (CTMC) and considers the time-to-failure (TTF) distribution of a component as a phase-type distribution (PHD). The model’s versatility and practicality are enhanced because the PHD can represent diverse degradation patterns of the components exposed to varied operating environments. The model provides accurate reliability for a mixed redundant system by advancing the approximate reliability function suggested in previous studies. Furthermore, the model would be useful in system design and management because it provides information such as the nth moment of the system’s lifetime distribution. In numerical experiments on some examples, the mixed redundancy was confirmed to devise a more reliable system than the existing active and standby redundancies, and the improvement effect increased as the number of redundant components decreased. The optimal structure for maximizing the expected lifetime of the system changes depends on the reliability of the components and fault detector/switch.
- Open Access
Mixed-Integer Linear Programming Model for Scheduling Missions and Communications of Multiple Satellites
Satellites have been developed and operated for various purposes. The global satellite market is growing rapidly as the number of satellites and their mission diversity increase. Satellites revolve around the Earth to perform missions and communicate with ground stations repeatedly and sequentially. However, because satellites are orbiting the Earth, there is a limited time window for missions to a specific area and communication with ground stations. Thus, in an environment where multiple satellites and multiple ground stations (MS-MGs) are operated, scheduling missions and communications to maximize the utilization of satellites is a complex problem. For the MS-MG scheduling problem, this study proposes a mixed-integer linear programming (MILP) model to assign time windows for missions and communications with ground stations to individual satellites. The MILP model is based on the concept of a time-space network and includes constraints reflecting on the space mission environment of satellites. The objective function and constraints of the MILP model were validated through numerical experiments based on actual data from Korean satellites.
Open AccessMixed-Integer Linear Programming Model for Scheduling Missions and Communications of Multiple Satellites
Satellites have been developed and operated for various purposes. The global satellite market is growing rapidly as the number of satellites and their mission diversity increase. Satellites revolve around the Earth to perform missions and communicate with ground stations repeatedly and sequentially. However, because satellites are orbiting the Earth, there is a limited time window for missions to a specific area and communication with ground stations. Thus, in an environment where multiple satellites and multiple ground stations (MS-MGs) are operated, scheduling missions and communications to maximize the utilization of satellites is a complex problem. For the MS-MG scheduling problem, this study proposes a mixed-integer linear programming (MILP) model to assign time windows for missions and communications with ground stations to individual satellites. The MILP model is based on the concept of a time-space network and includes constraints reflecting on the space mission environment of satellites. The objective function and constraints of the MILP model were validated through numerical experiments based on actual data from Korean satellites.
- 30 December 2022
- Published by The Society of Korea Industrial and Systems Engineering in Journal of Society of Korea Industrial and Systems Engineering
- Vol. 45 (4) , 157-166
A Study on Defect Prediction through Real-time Monitoring of Die-Casting Process Equipment
- 30 December 2022
- Published by The Society of Korea Industrial and Systems Engineering in Journal of Society of Korea Industrial and Systems Engineering
- Vol. 45 (4) , 157-166
A Study on Defect Prediction through Real-time Monitoring of Die-Casting Process Equipment
- 28 June 2022
- Published by Wiley in Systems Engineering
- Vol. 25 (5) , 489-509
Enhancing decision knowledge by developing a quantitative framework for holistic exploratory acquisition policy analysis
An acquisition policy's diverse stakeholders may have heterogeneous needs. Furthermore, stakeholders may be unsure of their preferences due to a highly qualitative analysis of alternatives in the early stages of the acquisition policy development process. Lacking system knowledge and evidence, stakeholders may push back policy priorities or delay decisions. In such cases, it is necessary to increase stakeholders’ knowledge about the acquisition policy options’ impacts. This study proposes a systematic and quantitative framework development process and outlines a holistic exploratory policy analysis. Stakeholders’ needs are systematically identified and measurement areas and elements are derived from those needs. Evaluation methods are then created through a sensible quantification process to measure the impact of introducing each alternative. The framework provides information on the effects of various policy options, an analysis of each alternative's most crucial policy option, and other valuable analysis results. Finally, we present a case study to illustrate the development process and application of the framework when introducing a new military training system such as Live, Virtual, and Constructive synthetic training systems.
- 28 June 2022
- Published by Wiley in Systems Engineering
- Vol. 25 (5) , 489-509
Enhancing decision knowledge by developing a quantitative framework for holistic exploratory acquisition policy analysis
An acquisition policy's diverse stakeholders may have heterogeneous needs. Furthermore, stakeholders may be unsure of their preferences due to a highly qualitative analysis of alternatives in the early stages of the acquisition policy development process. Lacking system knowledge and evidence, stakeholders may push back policy priorities or delay decisions. In such cases, it is necessary to increase stakeholders’ knowledge about the acquisition policy options’ impacts. This study proposes a systematic and quantitative framework development process and outlines a holistic exploratory policy analysis. Stakeholders’ needs are systematically identified and measurement areas and elements are derived from those needs. Evaluation methods are then created through a sensible quantification process to measure the impact of introducing each alternative. The framework provides information on the effects of various policy options, an analysis of each alternative's most crucial policy option, and other valuable analysis results. Finally, we present a case study to illustrate the development process and application of the framework when introducing a new military training system such as Live, Virtual, and Constructive synthetic training systems.
- 31 March 2022
- Published by The Korean Reliability Society in Journal of Applied Reliability
- Vol. 22 (1) , 96-108
Framework for Optimal Reliability Design Considering System Usage Patterns Based on Big Data
Purpose: This study presents a framework for the robust reliability design of a multi-functional system by considering various usage patterns of an existing system. Methods: The framework consists of four stages: 1) identifying the critical component in a multi-functional system, 2) collecting and analyzing data from users, 3) designing for optimal system reliability, and 4) validating system reliability in various operating environments. Moreover, the framework includes failure mode and effects analysis (FMEA), big data on system usage, the redundancy allocation problem (RAP), and the genetic algorithm (GA). Conclusion: By using a framework that considers the usage pattern of a system, it was possible to achieve target reliability and a robust design for various usage patterns. Compared to the usage patterns experienced by many users in the existing structure, it was confirmed that most users experienced few (or no) failures. In addition, the framework was robust during the verification stage.
- 31 March 2022
- Published by The Korean Reliability Society in Journal of Applied Reliability
- Vol. 22 (1) , 96-108
Framework for Optimal Reliability Design Considering System Usage Patterns Based on Big Data
Purpose: This study presents a framework for the robust reliability design of a multi-functional system by considering various usage patterns of an existing system. Methods: The framework consists of four stages: 1) identifying the critical component in a multi-functional system, 2) collecting and analyzing data from users, 3) designing for optimal system reliability, and 4) validating system reliability in various operating environments. Moreover, the framework includes failure mode and effects analysis (FMEA), big data on system usage, the redundancy allocation problem (RAP), and the genetic algorithm (GA). Conclusion: By using a framework that considers the usage pattern of a system, it was possible to achieve target reliability and a robust design for various usage patterns. Compared to the usage patterns experienced by many users in the existing structure, it was confirmed that most users experienced few (or no) failures. In addition, the framework was robust during the verification stage.