• Korean Journal of Computational Design and Engineering
• /
• 제9권4호
• /
• pp.286-293
• /
• 2004

Recently, hot processing using the heat source like laser machining and RFS was developed and spreaded gradually. In order to generate tool-path for the proper hot tool, a new tool-path linking algorithm is needed because tool-path linking algorithm for machining can't be applied. In this paper, zigzag tool-path liking algorithm was proposed to generate tool-path automatically for RFS. The algorithm is composed of three steps: 1) Generating valid tool-path element, 2) Storing tool-path elements and creating sub-groups, 3) linking sub-groups. Using the proposed algorithm, CAD/CAM software for the tool-path generation of hot tool was developed. The proposed algorithm was applied and verified for Venus's face and die of cellular phone case.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1496-1499
• /
• 2004

In this paper, we deal with a novel path planning algorithm to find collision-free path for a moving robot to find an appropriate path from initial position to goal position. The robot should make progress by avoiding obstacles located at unknown position. Such problem is called the path planning. We propose so called the subgoal generation algorithm to find an effective collision-free path. The generation and selection of the subgoal are the key point of this algorithm. Several subgoals, if necessary, are generated by analyzing the map information. The subgoal is the candidate for the final path to be pass through. Then selection algorithm is executed to choose appropriate subgoal to construct a correct path. Deep and through explanations are given for the proposed algorithm. Simulation example is given to show the effectiveness of the proposed algorithm.

• Journal of Mechanical Science and Technology
• /
• 제16권2호
• /
• pp.137-146
• /
• 2002

In this paper, a path generation algorithm that uses sensor scannings is described. A scanning algorithm for recognizing the ambient environment of the Automatic Guided Vehicle (AGV) that uses the information from the sensor platform is proposed. An algorithm for computing the real path and obstacle length is developed by using a scanning method that controls rotating of the sensors on the platform. The AGV can recognize the given path by adopting this algorithm. As the AGV with two-wheel drive constitute a nonholonomic system, a linearized kinematic model is applied to the AGV motor control. An optimal controller is designed for tracking the reference path which is generated by recognizing the path pattern. Based on experimental results, the proposed algorithm that uses scanning with a sensor platform employing only a small number of sensors and a low cost controller for the AGV is shown to be adequate for path generation.

• The Journal of Korea Robotics Society
• /
• 제17권2호
• /
• pp.142-151
• /
• 2022

With the advent of the 4th industrial revolution, autonomous driving technology is being commercialized in various industries. However, research on autonomous driving so far has focused on platforms with wheel-type platform. Research on a tracked platform is at a relatively inadequate step. Since the tracked platform has a different driving and steering method from the wheel-type platform, the existing research cannot be applied as it is. Therefore, a path-tracking algorithm suitable for a tracked platform is required. In this paper, we studied a path-tracking algorithm for a tracked platform based on a GPS sensor. The existing Pure Pursuit algorithm was applied in consideration of the characteristics of the tracked platform. And to compensate for "Cutting Corner", which is a disadvantage of the existing Pure Pursuit algorithm, an algorithm that changes the LAD according to the curvature of the path was developed. In the existing pure pursuit algorithm that used a tracked platform to drive a path including a right-angle turn, the RMS path error in the straight section was 0.1034 m and the RMS error in the turning section was measured to be 0.2787 m. On the other hand, in the variable LAD algorithm, the RMS path error in the straight section was 0.0987 m, and the RMS path error in the turning section was measured to be 0.1396 m. In the turning section, the RMS path error was reduced by 48.8971%. The validity of the algorithm was verified by measuring the path error by tracking the path using a tracked robot platform.

• Journal of the military operations research society of Korea
• /
• 제26권2호
• /
• pp.120-130
• /
• 2000

The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. Generally, the problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k most vital arcs in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. The method presented in this study is developed using the library of the evolutionary algorithm framework and then the performance of algorithm is analyzed through the computer experiment.

• Journal of the Korean Society for Precision Engineering
• /
• 제19권8호
• /
• pp.147-154
• /
• 2002

In this paper, a path navigation algorithm through use of a sensor platform is proposed. The sensor platform is composed of two electric motors which make panning and tilting motions. An algorithm for computing a real path and an obstacle length is developed by using a scanning method that controls rotation of the sensors on the platform. An Autonomous Robot Vehicle(ARV) can perceive the given path by adapting this algorithm. A sensor scanning method is applied to the sensor platform for using small numbers of sensor. The path navigation algorithm is composed of two parts. One is to perceive a path pattern, the other is used to avoid an obstacle. An optimal controller is designed for tracking the reference path which is generated by perceiving the path pattern. The ARV is operated using the optimal controller and the path navigation algorithm. Based on the results of actual experiments, this algorithm for an ARV proved sufficient for path navigation by small number of sensors and for a low cost controller by using the sensor platform with a scanning method.

• Journal of the Korea Institute of Military Science and Technology
• /
• 제13권2호
• /
• pp.171-179
• /
• 2010

A fundamental technology of UGV(Unmanned Ground Vehicle) to perform a given mission with success in various environment is a path planning method which generates a safe and optimal path to the goal. In this paper, we suggest a local path-planning method of UGV based on the binary map using world model data which is gathered from terrain perception sensors. In specially, we present three core algorithms such as shortest path computation algorithm, path optimization algorithm and path smoothing algorithm those are used in the each composition module of LPP component. A simulation is conducted with M&S(Modeling & Simulation) system in order to verify the performance of each core algorithm and the performance of LPP component with scenarios.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제63권1호
• /
• pp.115-122
• /
• 2014

Mobile robot has been studied for long time due to its simple structure and easy modeling. Regarding path planning of the mobile robot, we suggest real-time hybrid path planning algorithm which is the combination of optimal path planning and real-time path planning in this paper. Real-time hybrid path planning algorithm modifies, finds best route, and saves calculating time. It firstly plan the route with real-time path planning then robot starts to move according to the planned route. While robot is moving, update the route as the best outcome which found by optimal path planning algorithm. Verifying the performance of the proposed method through the comparing real-time hybrid path planning with optimal path planning will be done.

• Journal of Korea Game Society
• /
• 제19권6호
• /
• pp.83-90
• /
• 2019

Heuristic based Genetic Algorithm Pathfinding(H-GAP), a method without the need for node and edge information, can compensate the disadvantages of existing pathfinding algorithm, and perform the path search at high speed. However, because the pathfinding by H-GAP is non-node-based, it may not be an optimal path when it includes unnecessary path information. In this paper, we propose an algorithm to optimize the search path using H-GAP. The proposed algorithm optimizes the path by removing unnecessary path information through ray-tracing algorithm after the H-GAP path search is completed.

• The Journal of Korea Robotics Society
• /
• 제5권1호
• /
• pp.41-47
• /
• 2010

This paper proposes a path planning method of a mobile robot in two-dimensional work space. The path planning method is based on a cell decomposition approach. To create a path which consists of a number of line segments, the Delaunay Triangulation algorithm is used. Using the cells produced by the Delaunay Triangulation algorithm, a mesh generation algorithm connects the starting position to the goal position. Dijkstra algorithm is used to find the shortest distance path. Greedy algorithm optimizes the path by deleting the path segments which detours without collision with obstacles.