• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.94-96
• /
• 2021

In this paper, we develop a new navigation algorithm for industrial mobile robots to arrive at the destination in unknown environment. To achieve this, we suggest a navigation algorithm that combines Dynamic Window Approach (DWA) and Dijkstra path planning algorithm. We compare Local Dynamic Window Approach (LDWA), Global Dynamic Window Approach(GDWA), Rapidly-exploring Random Tree (RRT) Algorithm. The navigation algorithm using Dijkstra algorithm combined with LDWA and GDWA makes mobile robots to reach the destination. and obstacles faced during the path planning process of LDWA and GDWA. Then, we compare on time taken to arrive at the destination, obstacle avoidance and computation complexity of each algorithm. To overcome the limitation, we seek ways to use the optimized navigation algorithm for industrial use.

• The Journal of Korea Robotics Society
• /
• v.19 no.3
• /
• pp.236-243
• /
• 2024

This paper introduces a dual manipulator system designed to automate the packaging process of industrial coils, which exhibit higher variability than other structured industrial fields due to diverse commercial requirements. The conventional solution involves the direct-teaching method, where an operator instructs the robot on a target configuration. However, this method has distinct limitations, such as low flexibility in dealing with varied sizes and safety concerns for the operators handling large products. In this sense, this paper proposes a two-step approach for coil packaging: motion planning and assembly execution. The motion planning includes a Rapidly-exploring Random Tree algorithm and a smoothing method, allowing the robot to reach the target configuration. In the assembly execution, the packaging is considered a peg-in-hole assembly. Unlike typical peg-in-hole assembly handling two workpieces, the packaging includes three workpieces (e.g., coil, inner ring, side plate). To address this assembly, the paper suggests a suitable strategy for dual manipulation. Finally, the validity of the proposed system is demonstrated through experiments with three different sizes of coils, replicating real-world packaging situations.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.11
• /
• pp.765-778
• /
• 2013

This paper proposes a test case generation method for Stateflow model using the extended RRT method. The RRT method which has been popularly used for planning paths for complex systems also shows a good performance for test case generation. However, it does not consider the test coverage which is important for test case generation. The proposed extension method hires the concept of test goal achievement to increase test coverage and drives RRT extension in the direction that increases the goal achievement. Considering the concept, a RRT distance metric, random node generation method and modified RRT extension algorithm are proposed. The effectiveness of proposed algorithm is compared with that of the typical RRT algorithm through the experiment using the practical automotive ECUs.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.3
• /
• pp.192-198
• /
• 2016

Motion planning problem is still one of the important issues in robotic applications. In many real-time motion planning problems, it is advisable to find a feasible solution quickly and improve the found solution toward the optimal one before the previously-arranged motion plan ends. For such reasons, sampling-based approaches are becoming popular for real-time application. Especially the use of a rapidly exploring random $tree^*$ ($RRT^*$) algorithm is attractive in real-time application, because it is possible to approach an optimal solution by iterating itself. This paper presents a modified version of informed $RRT^*$ which is an extended version of $RRT^*$ to increase the rate of convergence to optimal solution by improving the sampling method of $RRT^*$. In online motion planning, the robot plans a path while simultaneously moving along the planned path. Therefore, the part of the path near the robot is less likely to be sampled extensively. For a better solution in online motion planning, we modified the sampling method of informed $RRT^*$ by combining with the sampling method to improve the path nearby robot. With comparison among basic $RRT^*$, informed $RRT^*$ and the proposed $RRT^*$ in online motion planning, the proposed $RRT^*$ showed the best result by representing the closest solution to optimum.

• Journal of Advanced Navigation Technology
• /
• v.27 no.4
• /
• pp.365-373
• /
• 2023

Unmanned aerial vehicles are widely used in various fields, and real-time path replanning is a critical factor in enhancing the safety and efficiency of these devices. In this paper, we propose a real-time path replanning technique based on RRT* and LOSPO. The proposed technique first generates an initial path using the RRT* algorithm and then optimizes the path using LOSPO. Additionally, the optimized path can be converted into a trajectory that considers actual time and the dynamic limits of the aircraft. In this process, environmental changes and collision risks are detected in real-time, and the path is replanned as needed to maintain safe operation. This method has been verified through simulation-based experiments. The results of this paper make a significant contribution to the research on real-time path replanning for UAVs, and by applying this technique to various situations, the safety and efficiency of UAVs can be improved.

• Journal of the Society of Naval Architects of Korea
• /
• v.61 no.5
• /
• pp.324-333
• /
• 2024

This paper focuses on the cooperation between Unmanned Aerial Vehicle (UAV) and Unmanned Surface Vessel (USV). It aims to develop efficient guidance and control algorithms for USV based on obstacle identification and path planning from aerial images captured by UAV. Various obstacle scenarios were implemented using the Robot Operating System (ROS) and the Gazebo simulation environment. The aerial images transmitted in real-time from UAV to USV are processed using the computer vision-based deep learning model, You Only Look Once (YOLO), to classify and recognize elements such as the water surface, obstacles, and ships. The recognized data is used to create a two-dimensional grid map. Algorithms such as A^* and Rapidly-exploring Random Tree star (RRT^*) were used for path planning. This process enhances the guidance and control strategies within the UAV-USV collaborative system, especially improving the navigational capabilities of the USV in complex and dynamic environments. This research offers significant insights into obstacle avoidance and path planning in maritime environments and proposes new directions for the integrated operation of UAV and USV.

• Journal of Advanced Navigation Technology
• /
• v.26 no.5
• /
• pp.304-311
• /
• 2022

Although the SEAD(suppression to enemy air defenses) mission is a strategically important task in modern warfare, the high risk of direct exposure to enemy air defense assets forces to use of unmanned aerial vehicles. this paper proposes a path planning algorithm for SEAD mission for an unmanned aerial vehicle and a method for calculating the mission effectiveness on the planned path. Based on the RRT-based path planning algorithm, a low-altitude ingress/egress flight path that can consider the enemy's short-range air defense threat was generated. The Dubins path-based Intercept path planning technique was used to generate a path that is the shortest path while avoiding the enemy's short-range anti-aircraft threat as much as possible. The ingress/intercept/egress paths were connected in order. In addition, mission effectiveness consisting of fuel consumption, the survival probability, the time required to perform the mission, and the target destruction probability was calculated based on the generated path. The proposed techniques were verified through a scenario.