Jin-Gu Kang

Mr. Jin-Gu Kang

Department of Computer Science and Engineering, Dongguk University, Seoul
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
6 January 2021 in Sensors
Verified
Journal Article
Open access
PDF file
Jin-Gu KangJin-Gu Kang
Jin-Gu Kang
DLDong-Woo Lim
Dong-Woo Lim
YCYong-Sik Choi
Yong-Sik Choi
WJWoo-Jin Jang
Woo-Jin Jang
Jin-Woo JungJin-Woo Jung
Jin-Woo Jung
This paper proposed a triangular inequality-based rewiring method for the rapidly exploring random tree (RRT)-Connect robot path-planning algorithm that guarantees the planning time compared to the RRT algorithm, to bring it closer to the optimum. To check the proposed algorithm’s performance, this paper compared the RRT and RRT-Connect algorithms in various environments through simulation. From these experimental results, the proposed algorithm shows both quicker planning time and shorter path length than the RRT algorithm and shorter path length than the RRT-Connect algorithm with a similar number of samples and planning time.

14 February 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Jin-Woo JungJin-Woo Jung
Jin-Woo Jung
BSByung-Chul So
Byung-Chul So
Jin-Gu KangJin-Gu Kang
Jin-Gu Kang
DLDong-Woo Lim
Dong-Woo Lim
YSYunsik Son
Yunsik Son
The Expanded Douglas–Peucker (EDP) polygonal approximation algorithm and its application method for the Opposite Angle-Based Exact Cell Decomposition (OAECD) are proposed for the mobile robot path-planning problem with curvilinear obstacles. The performance of the proposed algorithm is compared with the existing Douglas–Peucker (DP) polygonal approximation and vertical cell decomposition algorithm. The experimental results show that the path generated by the OAECD algorithm with EDP approximation appears much more natural and efficient than the path generated by the vertical cell decomposition algorithm with DP approximation.

8 November 2021 in Sensors
Verified
Journal Article
Open access
PDF file
TKTae-Won Kang
Tae-Won Kang
Jin-Gu KangJin-Gu Kang
Jin-Gu Kang
Jin-Woo JungJin-Woo Jung
Jin-Woo Jung
This paper proposes a post-processing method called bidirectional interpolation method for sampling-based path planning algorithms, such as rapidly-exploring random tree (RRT). The proposed algorithm applies interpolation to the path generated by the sampling-based path planning algorithm. In this study, the proposed algorithm is applied to the path created by RRT-connect and six environmental maps were used for the verification. It was visually and quantitatively confirmed that, in all maps, not only path lengths but also the piecewise linear shape were decreased compared to the path generated by RRT-connect. To check the proposed algorithm’s performance, visibility graph, RRT-connect algorithm, Triangular-RRT-connect algorithm and post triangular processing of midpoint interpolation (PTPMI) were compared in various environmental maps through simulation. Based on these experimental results, the proposed algorithm shows similar planning time but shorter path length than previous RRT-like algorithms as well as RRT-like algorithms with PTPMI having a similar number of samples.

25 October 2019 in Energies
Verified
Journal Article
Open access
PDF file
GKgayoung kim
gayoung kim
Jin-Gu KangJin-Gu Kang
Jin-Gu Kang
MRMinjoong Rim
Minjoong Rim
This paper proposes a new protocol that can be used to reduce transmission delay and energy consumption effectively. This will be done by adjusting the duty-cycle (DC) ratio of the receiver node and the contention window size of the sender node according to the traffic congestion for various devices in the Internet of Things (IoT). In the conventional duty-cycle MAC protocol, the data transmission delay latency and unnecessary energy consumption are caused by a high collision rate. This is because the receiver node cannot sufficiently process the data of the transmitting node during the traffic peak time when the transmission and reception have the same duty-cycle ratio. To solve this problem, this paper proposes an algorithm that changes the duty-cycle ratio of the receiver and broadcasts the contention window size of the senders through Early Acknowledgment (E-ACK) at peak time and off/peak time. The proposed algorithm, according to peak and off/peak time, can transmit data with fewer delays and minimizes energy consumption.

17 April 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Jin-Woo JungJin-Woo Jung
Jin-Woo Jung
JPJung-Soo Park
Jung-Soo Park
TKTae-Won Kang
Tae-Won Kang
Jin-Gu KangJin-Gu Kang
Jin-Gu Kang
HKHyun-Wook Kang
Hyun-Wook Kang
Environment maps must first be generated to drive mobile robots automatically. Path planning is performed based on the information given in an environment map. Various types of sensors, such as ultrasonic and laser sensors, are used by mobile robots to acquire data on its surrounding environment. Among these, the laser sensor, which has the property of being able to go straight and high accuracy, is used most often. However, the beams from laser sensors are refracted and reflected when it meets a transparent obstacle, thus generating noise. Therefore, in this paper, a state-of-the-art algorithm was proposed to detect transparent obstacles by analyzing the pattern of the reflected noise generated when a laser meets a transparent obstacle. The experiment was carried out using the environment map generated by the aforementioned method and gave results demonstrating that the robot could avoid transparent obstacles while it was moving towards the destination.

13 September 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Jin-Gu KangJin-Gu Kang
Jin-Gu Kang
YCYong-Sik Choi
Yong-Sik Choi
Jin-Woo JungJin-Woo Jung
Jin-Woo Jung
It is difficult to guarantee optimality using the sampling-based rapidly-exploring random tree (RRT) method. To solve the problem, this paper proposes the post triangular processing of the midpoint interpolation method to minimize the planning time and shorten the path length of the sampling-based algorithm. The proposed method makes a path that is closer to the optimal path and somewhat solves the sharp path problem through the interpolation process. Experiments were conducted to verify the performance of the proposed method. Applying the method proposed in this paper to the RRT algorithm increases the efficiency of optimization by minimizing the planning time.