Joon Won Kim
Research Subjects
Joon Won Kim has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Nam Eung Hwang
MUM-T, Hanwha Systems Co., Seongnam, Republic of Korea, Republic of Korea
3 shared publications - Byeong-Min Jeong
Division of Aerospace Engineering KAIST 305-701 Daejeon Republic of Korea
1 shared publication - Dae-Sung Jang
Department of Aerospace Engineering, Korea Aerospace University, Goyang, Republic of Korea
1 shared publication - Han-Lim Choi
Korea Advanced Institute of Science and Technology
1 shared publication - Philjoon Jung
SW Team (Land), Hanwha Systems Co., Seongnam-si 13524, Republic of Korea
1 shared publication - Suyeon Hong
MUM-T, Hanwha Systems Co., Seongnam, Republic of Korea, Republic of Korea
1 shared publication
Latest Publications
- Open Access
- 9 October 2026
- Published by MDPI AG in Preprints.org
Extension of Multi-Coverage Path Planning Algorithm for Polygon Region of Interest
Our previous work focused on generating multi-coverage paths to enable multiple drones to scan a region of interest as quickly as possible. However, it has a limitation in that it can only be applied to rectangular regions. To overcome the limitation, a method to extend the previous work is proposed so that it can generate multi-coverage paths for polygonal regions of interest as well. For the extension, it is necessary to identify the rectangular GRIDs to be scanned based on the polygonal region. It is based on whether the path passes through the interior of the rectangular GRID using linear equations. The GRID paths are generated for the determined polygonal GRID region, and final paths are generated by creating paths wrap around them. Each path is generated that starts and ends the scan near the drone’s initial position to finish scan as soon as possible. The extended algorithm is demonstrated within a polygonal region includes a rectangular area through simulations.
- 9 October 2026
- Published by MDPI AG in Preprints.org
Open AccessExtension of Multi-Coverage Path Planning Algorithm for Polygon Region of Interest
Our previous work focused on generating multi-coverage paths to enable multiple drones to scan a region of interest as quickly as possible. However, it has a limitation in that it can only be applied to rectangular regions. To overcome the limitation, a method to extend the previous work is proposed so that it can generate multi-coverage paths for polygonal regions of interest as well. For the extension, it is necessary to identify the rectangular GRIDs to be scanned based on the polygonal region. It is based on whether the path passes through the interior of the rectangular GRID using linear equations. The GRID paths are generated for the determined polygonal GRID region, and final paths are generated by creating paths wrap around them. Each path is generated that starts and ends the scan near the drone’s initial position to finish scan as soon as possible. The extended algorithm is demonstrated within a polygonal region includes a rectangular area through simulations.
- Open Access
Rule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest
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.
Open AccessRule-Based Multiple Coverage Path Planning Algorithm for Scanning a Region of Interest
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.
- Open Access
Makespan-Minimizing Heterogeneous Task Allocation under Temporal Constraints
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.
Open AccessMakespan-Minimizing Heterogeneous Task Allocation under Temporal Constraints
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.