• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.492-495
• /
• 1990

This paper introduces a path planning technique for a mobile robot in the presence of obstacles. In the technique, workspace is described by regional graph and represented obstacles by the three-layer neural network. And performance cost is defined under consideration both the traveling distance and the safety of a mobile robot. Then a collision-free path is obtained using the neural optimization technique.

• The Journal of Korea Robotics Society
• /
• v.2 no.4
• /
• pp.304-309
• /
• 2007

This paper describes an efficient path generation method for area coverage. Its applications include robots for de-mining, cleaning, painting, and so on. Our method is basically based on a divide and conquer strategy. We developed a novel cell decomposition algorithm that divides a given area into several cells. Each cell is covered by a robot motion that requires minimum time to cover the cell. Using this method, completeness and time efficiency of coverage are easily achieved. For the completeness of coverage in dynamic environments, we also propose a path following method that makes the robot cover missed areas as a result of the presence of unknown obstacles. The effectiveness of the method is verified using computer simulations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.4
• /
• pp.451-455
• /
• 2009

This paper provides a comparison of global path planning method in single string by using pulled and pushed SOFM (Self-Organizing Feature Map) which is a method among a number of neural network. The self-organizing feature map uses a randomized small valued initial-weight-vectors, selects the neuron whose weight vector best matches input as the winning neuron, and trains the weight vectors such that neurons within the activity bubble are move toward the input vector. On the other hand, the modified SOFM method in this research uses a predetermined initial weight vectors of the one dimensional string, gives the systematic input vector whose position best matches obstacles, and trains the weight vectors such that neurons within the activity bubble are move toward or reverse the input vector, by rising a pulled- or a pushed-SOFM. According to simulation results one can conclude that the modified neural networks in single string are useful tool for the global path planning problem of a mobile robot. In comparison of the number of iteration for converging to the solution the pushed-SOFM is more useful than the pulled-SOFM in global path planning for mobile robot.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.2
• /
• pp.389-397
• /
• 2011

The global dynamic window approach (DWA) is widely used to generate the shortest path of mobile robots considering obstacles and kinematic constraints. However, the dynamic constraints of robots should be considered to generate the minimum-time path. We propose a modified global DWA considering the dynamic constraints of robots. The reference path is generated using A* algorithm and smoothed by cardinal spline function. The trajectory is then generated to follows the reference path in the minimum time considering the robot dynamics. Finally, the local path is generated using the dynamic window which includes additional terms of speed and orientation. Simulation and experimental results are presented to verify the performance of the proposed method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1258-1261
• /
• 1993

This paper presents a methodology of path planning and navigation for an autonomous mobile robot. A fast algorithm using decomposition technique, which computes the optimal paths between all pairs of nodes, is proposed for real-time calculation. The robot is controlled by fuzzy approximation reasoning. Our new methodology has been implemented on a mobile robot. The results show that the robot successfully navigates to its destination following the optimal path.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.35 no.10
• /
• pp.918-926
• /
• 2007

Military aircrafts usually operate at the area with lots of threats such as radars and surface-to-air missiles. Aircraft also faces with the unexpected or pop-up threats. Under this environment, a safe flight path should be generated to lead a mission successful. In this paper, a new path planning algorithm is proposed to provide less dangerous flight path efficiently. Of many path planning algorithms, a potential method is considered, because it has advantages of computation efficiency and smooth path generation. Trajectory generation under the condition of maximum range is studied so that the aircraft may reach the target area without refueling. The algorithm to cope with an unexpected situation is also proposed by adopting the concept of initial direction vector, additional force, and a new mapping function. The performance of the proposed algorithms is demonstrated for SEAD (Suppression of Enemy Air Defences) mission by numerical simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.133-136
• /
• 1996

The nozzle dam task is essentially needed to maintain and repair nuclear power plants. For this task, an 8-dof redundant robot is studied with a local path-planning method[l] which is effective to find the optimal joint path in the constrained environment. In this paper, the method[l] is improved practically with the weight matrix and efficient algorithm to find working set. The effectiveness of the proposed method is demonstrated by simulation and animation.

• The Journal of Korea Robotics Society
• /
• v.4 no.3
• /
• pp.233-242
• /
• 2009

This paper briefly reviews the path planning methods that are applicable to the autonomous mobile robots for the military. Two distinct path search algorithms, $A^*$ and $D^*$ that are most popular and flexible in public applications, among those reviewed are coded and analyzed in terms of combat environment assessment factors called METT+TC for the area of operations. The results imply that it is important to consider the characteristics of defense acquisition process and the specific requirements of defense operation so that the successful technology development of the Robot products is directly linked to the defense procurement of Robot products.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.6
• /
• pp.506-513
• /
• 2000

This paper proposes a path planning algorithm for dispensers to increase the productivity in printed circuit board assembly lines. We analyze the assembly sequence of the dispenser, and formulate it as an integer programming problem. The mathematical formulation can accomodate multiple heads and different types of heads through extended cost matrix. The TSP algorithms are then applied to the formulated problem to find the near-optimal solution. Simulation results are presented to verify the usefulness of the proposed scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.423-427
• /
• 1993

A velocity planning method is proposed that ensures collision-free and minimal delay-time motions for two robotic manipulators and auxiliary equipments. Additional path, which makes robot start with possible largest speed, is added to the original prescribed path of one of two robots, and this running start along the additional path reduces delay time introduced to avoid collision between the robots and therefore reduces total traveling time.