• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제13권4호
• /
• pp.785-796
• /
• 2009

In this paper, propose for mobile robot path planning and the reduction in sleep caused by a sleep history suggested a way to compensate for record sensor error. The proposed path plan reduces the robot slip to smooth a potential barrier in the potential field method, and compensates the tachometer error by robot slip using the fuzzy logic system. The efficiency of the proposed method is verified by means of simulations and experiments for path plan and slip revision.

• Journal of Institute of Control, Robotics and Systems
• /
• 제16권1호
• /
• pp.53-60
• /
• 2010

We propose a motion planning method for autonomous mobile robots. In order to minimize traveling time, a smooth path and a time optimal velocity profile should be generated under kinematic and dynamic constraints. In this paper, we develop an effective and practical method to generate a good solution with lower computation time. The initial path is obtained from voronoi diagram by Dijkstra's algorithm. Then the path is improved by changing the graph and path simultaneously. We apply the dynamic programming algorithm into the stage of improvement. Simulation results are presented to verify the performance of the proposed method.

• Journal of the Korea Society for Simulation
• /
• 제12권1호
• /
• pp.11-19
• /
• 2003

Dubins showed that any shortest path of a car-like robot consists of exactly three path segment which are either arcs of circles of radius r(denoted C), or straight line segments(denoted S). Possible six types classified into two families, i.e. CSC and CCC. CSC includes 2 types(LRL and RLR) and CSC includes 4 types(LSL, RSR, LSR, RSL). This paper proposes new formulae for CSC family to find the shortest smooth path between the initial and final configurations of a car-like robot. The formulae is used for finding connection points explicitly between C\longrightarrowS and S\longrightarrowC which are necessary for real applications. The formulae have simple forms mainly because they are transformed into origin of their original coordinates of initial and target configuration, and derived from a standard forms which are a representative configuration of LSL and LSR type respectively. The proposed formulae, which are derived from the standard forms, are simple and new method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국해양정보통신학회 2006년도 춘계종합학술대회
• /
• pp.701-705
• /
• 2006

This paper propose a method of mobile robot path planning for prevention of slip using potential field. The path planning minimizes robot slip for the potential field method to smooth a potential barrier. In order to verify the effectiveness of the proposed method, we performed simulations on path planning with C-obstacles in the workspace. The results show that the proposed method considerably improves on the performance of the general potential field method.

• Journal of the Korean Society for Precision Engineering
• /
• 제27권10호
• /
• pp.34-39
• /
• 2010

We developed a path algorithm for ultrafast/wide area laser processing. Demands for high precision laser processing with a wide area has been increasing for a number of applications such as in solar cell battery, display parts, electronic component and automobile industry. Expansion of the area in which laser processing is an important factor to handle the ultrafast/wide area processing, it will require a processing path. Processing path is path of 2- axis stage and stage of change in velocity can be smooth as possible. In this paper, we proposed a smoothingnurbs method of improved speed profile. This method creates soft path from edge part, it is main purpose that scan area ($50mm{\times}50mm$) inside processing path makes path of topology of possible straight line. We developed a simulation tool using Visual C++.

• Journal of Institute of Control, Robotics and Systems
• /
• 제17권5호
• /
• pp.405-411
• /
• 2011

This paper presents a hierarchical trajectory planning method which can handle a collision-free of the planned path in complex and dynamic environments. A PV (Path & Velocity profile) planning method minimizes a sharp change of orientation and waiting time to avoid a collision with moving obstacle through detour path. The path generation problem is solved by three steps. In the first step, a smooth global path is generated using $A^*$ algorithm. The second step sets up the velocity profile for the optimization problem considering the maximum velocity and acceleration. In the third step, the velocity profile for obtaining the shortest path is optimized using the fuzzy and genetic algorithm. To show the validity and effectiveness of the proposed method, realistic simulations are performed.

• Journal of Institute of Control, Robotics and Systems
• /
• 제14권12호
• /
• pp.1238-1243
• /
• 2008

This paper presents an HILS(Hardware in the Loop Simulations) based experimental study for the UAV's flight trajectory planning/generation algorithms and guidance/control laws. For the various mission that is loaded on each waypoint, proper trajectory planning and generation algorithms are applied to achieve best performances. Specially, the 'smoothing path' generation and the 'tangent orbit path' guidance laws are presented for the smooth path transitions and in-circle loitering mission, respectively. For the control laws that can minimize the effects of side wind, side slip angle($\beta$) feedback to the rudder scheme is implemented. Finally, being implemented on real hardwares, all the proposed algorithms are validated with integrations of hardware and software altogether via HILS.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• 제20권10호
• /
• pp.3160-3172
• /
• 1996

A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

• Journal of Institute of Control, Robotics and Systems
• /
• 제17권5호
• /
• pp.471-478
• /
• 2011

This UGV (Unmanned Ground Vehicle) is not only widely used in various practical applications but is also currently being researched in many disciplines. In particular, obstacle avoidance is considered one of the most important technologies in the navigation of an unmanned vehicle. In this paper, we introduce a simple algorithm for path planning in order to reach a destination while avoiding a polygonal-shaped static obstacle. To effectively avoid such an obstacle, a path planned near the obstacle is much shorter than a path planned far from the obstacle, on the condition that both paths guarantee that the robot will not collide with the obstacle. So, to generate a path near the obstacle, we have developed an algorithm that combines an edge detection method and a limit-cycle navigation method. The edge detection method, based on Hough Transform and IR sensors, finds an obstacle's edge, and the limit-cycle navigation method generates a path that is smooth enough to reach a detected obstacle's edge. And we proposed novel algorithm to solve local minima using the virtual wall in the local vision. Finally, we verify performances of the proposed algorithm through simulations and experiments.

• Journal of the Korea Society of Computer and Information
• /
• 제10권3호
• /
• pp.219-227
• /
• 2005

Since multicast in the mobile environments is based on packet transmission and independent addressing, this paper propose an improved scheme about how to manage the multicasting group and to set the communication path in the mobile environment by applying two-level addressing mode, which is similar to mobile IP, for location-independent address setting. And we propose the smooth handoff scheme that minimizes the handoff delay for mobile multimedia services. Performance analysis by the modified NS-2 network simulator has showed that the proposed scheme is better than other techniques in terms of handoff delay and transmitted packets' throughput.