• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.5
• /
• pp.609-617
• /
• 2013

This paper presents a near-minimum time path planning algorithm for autonomous driving. The problem of near-minimum time path planning is an optimization problem in which it is necessary to take into account not only the geometry of the circuit but also the dynamics of the vehicle. The path planning algorithm consists of a candidate path generation and a velocity optimization algorithm. The candidate path generation algorithm calculates the compromises between the shortest path and the path that allows the highest speeds to be achieved. The velocity optimization algorithm calculates the lap time of each candidate considering the vehicle driving performance and tire friction limit. By using the calculated path and velocity of each candidate, we calculate the lap times and search for a near-minimum time path. The proposed algorithm was evaluated via computer simulation using CarSim and Matlab/Simulink.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.2
• /
• pp.211-217
• /
• 2014

This paper addresses an algorithm of path planning for autonomous driving of a ground vehicle in waypoint navigation. The proposed algorithm is flexible in utilization under a large GPS positioning error and generates collision-free multiple paths while pursuing minimum traveling time. An optimal path reduces inefficient steering by minimizing lateral changes in generated waypoints along a path. Simulation results compare the proposed algorithm with the A* algorithm by manipulation of the steering wheel and traveling time, and show that the proposed algorithm realizes real-time obstacle avoidance by quick processing of path generation, and minimum time traveling by producing paths with small lateral changes while overcoming the very irregular positioning error from the GPS.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.4D
• /
• pp.433-442
• /
• 2010

Recent decrease in the availability of experienced skilled labor and a corresponding lack of new entrants has required the need for automating many of the construction equipment used in the construction industry. In particular, excavators are widely used throughout earthwork operations and automating its tasks enables work to be performed with higher productivity and safety. This paper introduces an optimal path generation method which is one of the core technologies required to make "Intelligent" excavators a reality. The method divides a given earthwork area into unit cells, identifies networks created by linking these cells, and identifies the optimal path an excavator should follow to minimize its total transportation costs. In addition, the method also accounts for drainage direction and path continuity to ensure that the generated path considers site specific conditions.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.1
• /
• pp.19-27
• /
• 1997

This paper presents rough cut tool path planning for the fewer-axis machine consisting of a three-axis CNC machine and a rotary indexing table. In the problem dealt with in this paper, the tool orientation is "intermediately" changed, distinguished from the conventional problem where the tool orientation is assumed to be fixed. The developed rough cut path planning algorithm tries to minimize the number of tool orientation (setup) changes together with tool changes and the machining time for the rough cut by the four procedures: a) decomposition of the machining area based on the possibility of tool interference (via convex hull operation), b) determination of the optimal tool size and orientation (via network graph theory and branch-and bound algorithm), c) generation of tool path for the tool and orientation (based on zig-zag pattern), and d) feedrate adjustment to maintain the cutting force at an operation level (based on average cutting force). The developed algorithms are validated via computer simulations, and can be also used in pure fiveaxis machining environment without modification.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.17 no.1
• /
• pp.50-57
• /
• 2009

Lane Keeping Assistant Systems (LKAS) require the cooperative operation between drivers and active steering angle/torque controllers. An LKAS is proposed in this study such that the desired reference path generation (DRPG) system generates the desired path to minimize the trajectory overshoot. Based on the reference path from the DRPG system, an optimal controller is designed to minimize the cost function. A HIL (Hardware In the Loop) simulator is constructed to evaluate the proposed LKAS system. The single camera is mounted on the simulator and acquires the monitor images to detect lane markers. The performance of the proposed system is evaluated by HIL system using the Carsim and the Matlab Simulink.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.1
• /
• pp.35-43
• /
• 2004

It is well known that the five-axis machining has advantages of tool accessibility and machined surface quality when compared with conventional three-axis machining. Traditional researches on the five-axis tool-path generation have addressed interferences such as cutter gouging, collision, machine kinematics and optimization of a CL(cutter location) or a cutter position. In the paper it is presented that optimal CL data for a face-milling cutter moving on a tool-path are obtained by incorporating TSS(tool swept surface) model. The TSS model from current CL position to the next CL position is constructed based on machine kinematics as well as cutter geometry, with which the deviation from the design surface can be computed. Then the next CC(cutter-contact) point should be adjusted such that the deviation conforms to given machining tolerance value. The proposed algorithm was implemented and applied to a marine propeller machining, which proved effective from a quantitative point of view. In addition, the algorithm using the TSS can also be applied to avoid cutter convex interferences in general three-axis NC machining.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.5
• /
• pp.981-988
• /
• 2023

As the usage of unmanned aerial vehicles expands, the development and the demand of related technologies are increasing. As the frequency of operation increases and the convenience of operation is emphasized, the importance of related autonomous flight technology is also highlighted. Establishing a path plan to reach the destination in autonomous flight of an unmanned aerial vehicle is important in guidance and control, and a technology for automatically generating path plan is required in order to maximize the effect of unmanned aerial vehicle. In this study, the optimization research of path planning using rapid-exploring random tree method was performed for increasing the effectiveness of autonomous operation. The path planning optimization method considering the characteristics of the unmanned aerial vehicle is proposed. In order to achieve indexes such as optimal distance, shortest time, and passage of mission points, the path planning was optimized in consideration of the mission goals and dynamic characteristics of the unmanned aerial vehicle. The proposed methods confirmed their applicability to the generation of path planning for unmanned aerial vehicles through performance verification for obstacle situations.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.1
• /
• pp.133-139
• /
• 2004

High speed machining (HSM) can reduce machining time with the high metal removal rate by high speed spindle and feedrate. This paper supports HSM technology using the small size tool with the optimal tool path generation and modification of tool change. The optimum tool path is generated to reduce cutting length of cavity pattern and change the cutting tool for preventing the tool breakage by wear. The tool path is modified with the experiment data of tool wear and breakage to support tool change on reasonable time. The result can contribute to HSM technology of high hardness materials using the small size end-mill.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.398-401
• /
• 2001

This paper presents rough cutting pat고 drilling. This method has differences from conventional method which uses boundary curve by intersecting object to machine and each cutting plane. Die-cavity shape is drilled in z-map, we select various tool and remove much material in the short time. as a result, this method raise productivity. The major challenges in die-cavity pocketing include : 1)finding an inscribed circle for removing material of unmachined regions, 2) selecting optimal tool and efficiently arranging tool, 3) generating offset surface of shape, 4) determining machined width according to the selected tool, 5) detecting and removing unmachined regions, and 6) linking PJE(path-joining element). Conventional machining method calling contour-map is compared with drilling method using Z-map, for finding efficiency in the view of productivity.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.1
• /
• pp.158-167
• /
• 1997

For the use of a mobile robot in dynamic environment, a collision-avoidance algorithm with moving obsta- cle is necessary. In this paper, a collsion-avoidance algorithm of a mobile robot is presented, when a mobile robot detects the collision with moving obstacle on the navigational path. Using reported positions of moving obstacle with sensors, the mobile robot predicts the next position of moving obstacle with possibility of collision. The velocity of moving obstacle is modeled as random walk process with Gaussian distribution. The optimal collision-avoidance path in which turning motion of the mobile robot is considered is generated with relative velocity between the mobile robot and moving obstacle. For the safety of collision-avoidance path, attractive potential with the safety factor is suggested. The simulation results using this algorithm show the mobile robot avoids collision with moving obstacle in many cases.