Joonwoo Ahn
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Joonwoo Ahn has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Jaeheung Park
Department of Intelligence and Information, Seoul National University, Seoul, Republic of Korea
5 shared publications - Minsoo Kim
Department of Intelligence and Information, Graduate School of Convergence Science and Technology, Seoul National University, Seoul, Republic of Korea
4 shared publications - Minsung Kim
Graduate School of Convergence Science and Technology, Seoul National University, Seoul, South Korea
2 shared publications - Yangwoo Lee
Dynamic Robotic Systems (DYROS) Lab, Graduate School of Convergence Science and Technology, Seoul National University, Seoul 08826, Republic of Korea
2 shared publications Jaeheung Park
Seoul National University
1 shared publicationJahoo Koo
Samsung Advanced Institute of Technology (SAIT), Samsung Electronics
1 shared publication
Latest Publications
- 21 April 2024
- Published by Springer Nature
- p. 91-104
Data Aggregation (DAgger) Algorithm Using Adversarial Agent Policy for Dynamic Situations
- 21 April 2024
- Published by Springer Nature
- p. 91-104
Data Aggregation (DAgger) Algorithm Using Adversarial Agent Policy for Dynamic Situations
- Open Access
Accurate Visual Simultaneous Localization and Mapping (SLAM) against Around View Monitor (AVM) Distortion Error Using Weighted Generalized Iterative Closest Point (GICP)
Accurately estimating the pose of a vehicle is important for autonomous parking. The study of around view monitor (AVM)-based visual Simultaneous Localization and Mapping (SLAM) has gained attention due to its affordability, commercial availability, and suitability for parking scenarios characterized by rapid rotations and back-and-forth movements of the vehicle. In real-world environments, however, the performance of AVM-based visual SLAM is degraded by AVM distortion errors resulting from an inaccurate camera calibration. Therefore, this paper presents an AVM-based visual SLAM for autonomous parking which is robust against AVM distortion errors. A deep learning network is employed to assign weights to parking line features based on the extent of the AVM distortion error. To obtain training data while minimizing human effort, three-dimensional (3D) Light Detection and Ranging (LiDAR) data and official parking lot guidelines are utilized. The output of the trained network model is incorporated into weighted Generalized Iterative Closest Point (GICP) for vehicle localization under distortion error conditions. The experimental results demonstrate that the proposed method reduces localization errors by an average of 39% compared with previous AVM-based visual SLAM approaches.
Open AccessAccurate Visual Simultaneous Localization and Mapping (SLAM) against Around View Monitor (AVM) Distortion Error Using Weighted Generalized Iterative Closest Point (GICP)
Accurately estimating the pose of a vehicle is important for autonomous parking. The study of around view monitor (AVM)-based visual Simultaneous Localization and Mapping (SLAM) has gained attention due to its affordability, commercial availability, and suitability for parking scenarios characterized by rapid rotations and back-and-forth movements of the vehicle. In real-world environments, however, the performance of AVM-based visual SLAM is degraded by AVM distortion errors resulting from an inaccurate camera calibration. Therefore, this paper presents an AVM-based visual SLAM for autonomous parking which is robust against AVM distortion errors. A deep learning network is employed to assign weights to parking line features based on the extent of the AVM distortion error. To obtain training data while minimizing human effort, three-dimensional (3D) Light Detection and Ranging (LiDAR) data and official parking lot guidelines are utilized. The output of the trained network model is incorporated into weighted Generalized Iterative Closest Point (GICP) for vehicle localization under distortion error conditions. The experimental results demonstrate that the proposed method reduces localization errors by an average of 39% compared with previous AVM-based visual SLAM approaches.
- 5 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (1) , 606-617
TargetTree-RRT*: Continuous-Curvature Path Planning Algorithm for Autonomous Parking in Complex Environments
Rapidly-exploring random tree (RRT) has been studied for autonomous parking as it quickly finds an initial path and is easily scalable in complex environments. However, the planning time increases by searching for the path in narrow parking spots. To reduce the planning time, the target tree algorithm, which substitutes a parking goal in RRT with a set (target tree) of backward parking paths, was proposed. However, as it consists of circular and straight paths, it deteriorates parking accuracy because of curvature-discontinuity. Moreover, the planning time increases in complex environments; backward paths can be blocked by obstacles. Therefore, this paper introduces the TargetTree-RRT* algorithm for complex environments. First, a target tree is designed using clothoid paths to address such curvature-discontinuity. Second, to reduce the planning time further, a cost function is defined to initialize a proper target tree that considers obstacles. By integrating with optimal-variant RRT and searching for the shortest path, the proposed TargetTree-RRT* algorithm obtains a near-optimal path as the sampling time increases. Experiment results in real environments showed that the vehicle parked more accurately, and continuous-curvature paths were obtained more quickly and with higher success rates than those acquired using other sampling-based and other types of planning algorithms. Note to Practitioners —This work was motivated by the need to develop a fast and practical path planning algorithm for autonomous parking, not only in simple environments but also in complex environments. Sampling-based planning algorithms have been studied in this area, with the advantages of rapid planning of an initial path and easily reflecting vehicle’s constraints. Nevertheless, in cluttered environments, it needs considerable time to obtain a path for the autonomous vehicle easy for tracking and precise parking. To address the aforementioned issue, this article presents the TargetTree-RRT* algorithm. It finds a path by replacing a parking goal with a set of pre-defined continuous-curvature paths considering cluttered environments. TargetTree-RRT* achieves better performance for real parking scenarios and rapidly obtains a near-optimal parking path, compared to other parking path planners. The proposed algorithm is not limited to autonomous vehicles. It can be applied to other unmanned vehicles or robots, such as autonomous underwater vehicles (AUVs). In any application where the goal of path planning can be replaced with predefined standardized paths, the proposed algorithm can be extended.
- 5 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (1) , 606-617
TargetTree-RRT*: Continuous-Curvature Path Planning Algorithm for Autonomous Parking in Complex Environments
Rapidly-exploring random tree (RRT) has been studied for autonomous parking as it quickly finds an initial path and is easily scalable in complex environments. However, the planning time increases by searching for the path in narrow parking spots. To reduce the planning time, the target tree algorithm, which substitutes a parking goal in RRT with a set (target tree) of backward parking paths, was proposed. However, as it consists of circular and straight paths, it deteriorates parking accuracy because of curvature-discontinuity. Moreover, the planning time increases in complex environments; backward paths can be blocked by obstacles. Therefore, this paper introduces the TargetTree-RRT* algorithm for complex environments. First, a target tree is designed using clothoid paths to address such curvature-discontinuity. Second, to reduce the planning time further, a cost function is defined to initialize a proper target tree that considers obstacles. By integrating with optimal-variant RRT and searching for the shortest path, the proposed TargetTree-RRT* algorithm obtains a near-optimal path as the sampling time increases. Experiment results in real environments showed that the vehicle parked more accurately, and continuous-curvature paths were obtained more quickly and with higher success rates than those acquired using other sampling-based and other types of planning algorithms. Note to Practitioners —This work was motivated by the need to develop a fast and practical path planning algorithm for autonomous parking, not only in simple environments but also in complex environments. Sampling-based planning algorithms have been studied in this area, with the advantages of rapid planning of an initial path and easily reflecting vehicle’s constraints. Nevertheless, in cluttered environments, it needs considerable time to obtain a path for the autonomous vehicle easy for tracking and precise parking. To address the aforementioned issue, this article presents the TargetTree-RRT* algorithm. It finds a path by replacing a parking goal with a set of pre-defined continuous-curvature paths considering cluttered environments. TargetTree-RRT* achieves better performance for real parking scenarios and rapidly obtains a near-optimal parking path, compared to other parking path planners. The proposed algorithm is not limited to autonomous vehicles. It can be applied to other unmanned vehicles or robots, such as autonomous underwater vehicles (AUVs). In any application where the goal of path planning can be replaced with predefined standardized paths, the proposed algorithm can be extended.
- Open Access
- 5 August 2022
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2022, 1-13
Vision-Based Branch Road Detection for Intersection Navigation in Unstructured Environment Using Multi-Task Network
Autonomous vehicles need a driving method to be less dependent on localization data to navigate intersections in unstructured environments because these data may not be accurate in such environments. Methods of distinguishing branch roads existing at intersections using vision and applying them to intersection navigation have been studied. Model-based detection methods recognize patterns of the branch roads, but are sensitive to sensor noise and difficult to apply to various complex situations. Therefore, this study proposes a method for detecting the branch roads at the intersection using deep learning. The proposed multi-task deep neural network distinguishes the branch road into a shape of rotated bounding boxes and also recognizes the drivable area to consider obstacles inside the box. Through the output of the network, an occupancy grid map consisting of one branch road at an intersection is obtained, which can be used as an input to the existing motion-planning algorithms that do not consider intersections. Experiments in real environments show that the proposed method detected the branch roads more accurately than the model-based detection method, and the vehicle drove safely at the intersection.
- 5 August 2022
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2022, 1-13
Open AccessVision-Based Branch Road Detection for Intersection Navigation in Unstructured Environment Using Multi-Task Network
Autonomous vehicles need a driving method to be less dependent on localization data to navigate intersections in unstructured environments because these data may not be accurate in such environments. Methods of distinguishing branch roads existing at intersections using vision and applying them to intersection navigation have been studied. Model-based detection methods recognize patterns of the branch roads, but are sensitive to sensor noise and difficult to apply to various complex situations. Therefore, this study proposes a method for detecting the branch roads at the intersection using deep learning. The proposed multi-task deep neural network distinguishes the branch road into a shape of rotated bounding boxes and also recognizes the drivable area to consider obstacles inside the box. Through the output of the network, an occupancy grid map consisting of one branch road at an intersection is obtained, which can be used as an input to the existing motion-planning algorithms that do not consider intersections. Experiments in real environments show that the proposed method detected the branch roads more accurately than the model-based detection method, and the vehicle drove safely at the intersection.
- 1 September 2021
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 16 (3) , 250-259
A Comparative Analysis of Path Planning and Tracking Performance According to the Consideration of Vehicle’s Constraints in Automated Parking Situations
- 1 September 2021
- Published by The Korea Robotics Society in Journal of Korea Robotics Society
- Vol. 16 (3) , 250-259
A Comparative Analysis of Path Planning and Tracking Performance According to the Consideration of Vehicle’s Constraints in Automated Parking Situations
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 24-28
Formation-Based Tracking Method for Human Following Robot
Mobile robots are widely used in real-world applications, and the interactions between a person and a robot are important. Following a person is one of the interaction functions of mobile robots. To implement this function, most robots track the person from behind. In this case, the person experiences two inconveniences. First, the person often looks back to check whether the robot is following her or him well. Second, it is difficult to operate the robot immediately. In this study, we develop a method that helps a robot follow a person without these inconveniences. A set of candidate goal positions are determined based on the location of a person and the density of obstacles. These positions include a preferred location and a safe location. The robot tracks the goal position that is decided by considering obstacles around itself. This method was tested in a simulation environment. Two performance metrics were defined, and the effectiveness of this method was verified using the metrics.
- 1 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 24-28
Formation-Based Tracking Method for Human Following Robot
Mobile robots are widely used in real-world applications, and the interactions between a person and a robot are important. Following a person is one of the interaction functions of mobile robots. To implement this function, most robots track the person from behind. In this case, the person experiences two inconveniences. First, the person often looks back to check whether the robot is following her or him well. Second, it is difficult to operate the robot immediately. In this study, we develop a method that helps a robot follow a person without these inconveniences. A set of candidate goal positions are determined based on the location of a person and the density of obstacles. These positions include a preferred location and a safe location. The robot tracks the goal position that is decided by considering obstacles around itself. This method was tested in a simulation environment. Two performance metrics were defined, and the effectiveness of this method was verified using the metrics.