Nam Eung Hwang

Mr. Nam Eung Hwang

Hanwha Systems, Seongnam-si, Republic of Korea
orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
4 July 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Nam Eung HwangNam Eung Hwang
Nam Eung Hwang
HKHyung Jun Kim
Hyung Jun Kim
JKJae Gwan Kim
Jae Gwan Kim
In this paper, we propose a centralized task allocation and an alignment technique based on constraint table and alignment rules. For task allocation, a scoring scheme has to be set. The existing time-discounted scoring scheme has two problems; if the score is calculated based on arrival time, the agent who arrives in a task point first may finish the task late, and if the score is calculated based on end-time of the task, agents who have the same score may appear because of temporal constraints. Therefore, a modified time-discounted reward scheme based on both arrival and end-time is proposed. Additionally, an accumulated distance cost scheme is proposed for minimum fuel consumption. The constraint table made by tasks that are already aligned is also considered in scoring. For centralized task alignment based on the constraint table and alignment rules, a technique based on sequential greedy algorithm is proposed. Resolving conflicts on alignment is described in detail using constraint table and alignment rules, which are composed of four basic principles. We demonstrate simulations about task allocation and alignment for multi-agent with coupled constraints. Simple and complicated cases are used to verify the scoring schemes and the proposed techniques. Additionally, a huge case is used to show computational efficiency. The results are feasibly good when the constraints are properly set.

14 December 2023 in Aerospace
Verified
Journal Article
Open access
PDF file
BJByeong-Min Jeong
Byeong-Min Jeong
YOYun-Seo Oh
Yun-Seo Oh
DJDae-Sung Jang
Dae-Sung Jang
Nam Eung HwangNam Eung Hwang
Nam Eung Hwang
JKJoon-Won Kim
Joon-Won Kim
HCHan-Lim Choi
Han-Lim Choi
Task allocation is an essential element for determining the capability of multi-UAV systems to perform various tasks. This paper presents a procedure called a “rebalancing algorithm” for generating task-performing routes in heterogeneous multi-UAV systems. The algorithm adopts a greedy-based heuristic approach to find solutions efficiently in dynamically changing environments. A novel variable named “loitering” is introduced to satisfy temporal constraints, resulting in improved performance compared to heuristic algorithms: a sequential greedy algorithm, a genetic algorithm, and simulated annealing. The rebalancing algorithm is divided into two phases to minimize the makespan, i.e., the initial allocation and reallocation phases. Simulation results demonstrate the proposed algorithm’s effectiveness in highly constrained conditions and its suitability for heterogeneous systems. Additionally, the results show a reduction in calculation time and improved performance compared to the heuristic algorithms.

15 March 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Nam Eung HwangNam Eung Hwang
Nam Eung Hwang
HKHyung Jun Kim
Hyung Jun Kim
JKJae Gwan Kim
Jae Gwan Kim
Most mission planning algorithms solve multi-robot-multi-mission problems based on mixed integer linear programming. In these algorithms, the rewards (or costs) of missions for each robot are calculated according to the purpose of the user. Then, the (robot-mission) pair that has maximum rewards (or minimum costs) is found in the rewards (or costs) table and the mission is allocated to the robot. However, it is hard to design the reward for minimizing total mission completion time because not only a robot, but also the whole robots’ mission plans must be considered to achieve the purpose. In this paper, we propose centralized mission planning for multi-robot-multi-mission problems, minimizing total mission completion time. First, mission planning for single-robot-multi-mission problems is proposed because it is easy to solve. Then, this method is applied for multi-robot-multi-mission problems, adding a mission-plan-adjustment step. To show the excellent performance of the suggested algorithm in diverse situations, we demonstrate simulations for 3 representative cases: a simple case, which is composed of 3 robots and 8 missions, a medium case, which is composed of 4 robots and 30 missions, and a huge case, which is composed of 6 robots and 50 missions. The total mission completion time of the proposed algorithm for each case is lower than the results of the existing algorithm.

14 May 2025 in Drones
Verified
Journal Article
Open access
PDF file
Nam Eung HwangNam Eung Hwang
Nam Eung Hwang
JKJoon-Won Kim
Joon-Won Kim
PJPhiljoon Jung
Philjoon Jung
This paper considers the multiple path planning problem to cover a region of interest using vertical takeoff and landing (VTOL) drones. Drones are used not only to explore unknown areas but also to view areas from the air that are difficult for people to approach by cars, boats, etc. Hence, the coverage path planning for drones should work regardless of whether the drone is inside or outside the region of interest. The proposed algorithm starts by adjusting the region of interest based on the capturing area. Once the region of interest is determined, multiple path plans are created based on the pre-derived rules for generating an optimal path under the general case and the drone’s performance, such as speed, maximum flight time, etc. The aim is to minimize the time to cover the whole region of interest. Hence, the following criteria are applied to determine the appropriateness of the generated paths: (1) whether the start and end points of the path are located as close as possible to the drone’s position, (2) whether the number of generated paths is appropriate, and (3) whether the makespan differences between the paths are small. The performance of the proposed algorithm is verified by numerous simulations.

29 August 2024 in Defence Science Journal
Verified
Journal Article
Open access
PDF file
Nam Eung HwangNam Eung Hwang
Nam Eung Hwang
HKHyung Jun K.
Hyung Jun K.
Target-based weapon-target assignment (WTA) aims to minimize the total value of enemies. It means that maximizing the total reduced value of the enemies is the objective of the target-based WTA. The reward of an assignment is typically set as the reduction in the enemy’s value when an ally and an enemy have combat, and the value is calculated by multiplying the current value of the enemy by the probability of the enemy’s survival after the combat. However, allies may be assigned to enemies who are far away if the reward is calculated similarly. Additionally, a method of calculating battle probability that reflects the characteristics and deployment of enemies and allies is needed in order to apply it in the defense industry. In this paper, we propose a target-based static weapon-target assignment to solve these problems. First, we propose a method to calculate battle probabilities for one-to-one, one-to-many, many-to-one, and many-to-many combat. The probabilities are composed of 4 cases; ally-survival-enemy-survival, ally-survival-enemy-destroyed, ally-destroyed-enemy-survival, and ally-destroyed-enemy-destroyed. Then a time-discounted reward for assignment based on the battle probabilities is calculated to consider the time it takes to have combat. Finally, the tank combat simulation results are discussed. The performance of the proposed WTA algorithm is highlighted through an analysis of assignment results and a comparison of outcomes based on the application of time-discounted rewards.

28 February 2022
Verified
Journal Article
Closed access
Nam Eung HwangNam Eung Hwang
Nam Eung Hwang
BKByung-Soo Kim
Byung-Soo Kim