• Title/Summary/Keyword: path-smoothing

Search Result 40, Processing Time 0.029 seconds

Collision-Free Path Planning for Robot Manipulator using SOM (SOM(Self-Organization Map)을 이용한 로보트 매니퓰레이터 충돌회피 경로계획)

  • Rhee, Jong-Woo;Rhee, Jong-Tae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.22 no.3
    • /
    • pp.499-515
    • /
    • 1996
  • The basic function of on industrial robot system is to move objects in the workspace fast and accurately. One difficulty in performing this function is that the path of robot should be programmed to avoid the collision with obstacles, that is, tools, or facilities. This path planning requires much off-line programming time. In this study, a SOM technique to find the collision-free path of robot in real time is developed. That is, the collision-free map is obtained through SOM learning and a collision-free path is found using the map in real time during the robot operation. A learning procedure to obtain the map and an algorithm to find a short path using the map is developed and simulated. Finally, a path smoothing method to stabilize the motion of robot is suggested.

  • PDF

Optimal Path Planning for Mobile Robots based on Genetic Algorithms and Visibility Graph (유전 알고리즘과 가시도 그래프를 이용한 이동로봇의 최적경로 계획)

  • Jung, Youn-Boo;Lee, Min-Jung;Jun, Hyang-Sig;Choi, Young-Kiu
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • pp.2732-2734
    • /
    • 2000
  • This paper proposes a path planning algorithm for mobile robots. To generate a minimum-distance path for mobile robots, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance path between a start and a goal point, the path is revised to find the smooth subminimum-distance path by a path-smoothing algorithm. Simulation results show that the proposed algorithms are effective.

  • PDF

A Study on the Retrieval Algorithms for Atmospheric Parameters from FORMOSAT-3/COSMIC Occultation Data

  • Yeh, Wen-Hao;Chiu, Tsen-Chieh;Huang, Cheng-Yung;Liou, Yuei-An
    • Proceedings of the KSRS Conference
    • /
    • v.1
    • /
    • pp.312-315
    • /
    • 2006
  • Radio occultation technique has been used in planetary science to obtain reliable and accurate temperature profiles of the other planets' atmosphere for decades. It relies on the fact that radio waves are bent and delayed due to the gradient of atmospheric refractivity along-ray-path. With the advent of Global Positioning System (GPS), it becomes possible to retrieve the refractivity and temperature profiles of the Earth's atmosphere from the occultation data. We have developed a retrieval algorithm and compared the results of our algorithm with the data of CHAMP to verify the accuracy of our algorithm is good enough. In our algorithm, there are some smoothing steps when retrieving. We analysis the data of FORMOSAT-3 and compare the results with and without smoothing and the results of TACC to see is there any phenomenon deleted after smoothing.

  • PDF

Efficient Meshfree Analysis Using Stabilized Conforming Nodal Integration for Metal Forming Simulation

  • Han, Kyu-Taek
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.34 no.7
    • /
    • pp.943-950
    • /
    • 2010
  • An efficient meshfree method based on a stabilized conforming nodal integration method is developed for elastoplastic contact analysis of metal forming processes. In this approach, strain smoothing stabilization is introduced to eliminate spatial instability in Galerkin meshfree methods when the weak form is integrated by a nodal integration. The gradient matrix associated with strain smoothing satisfies the integration constraint for linear exactness in the Galerkin approximation. Strain smoothing formulation and numerical procedures for path-dependent problems are introduced. Applications of metal forming analysis are presented, from which the computational efficiency has been improved significantly without loss of accuracy.

Optimisation of pipeline route in the presence of obstacles based on a least cost path algorithm and laplacian smoothing

  • Kang, Ju Young;Lee, Byung Suk
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.9 no.5
    • /
    • pp.492-498
    • /
    • 2017
  • Subsea pipeline route design is a crucial task for the offshore oil and gas industry, and the route selected can significantly affect the success or failure of an offshore project. Thus, it is essential to design pipeline routes to be eco-friendly, economical and safe. Obstacle avoidance is one of the main problems that affect pipeline route selection. In this study, we propose a technique for designing an automatic obstacle avoidance. The Laplacian smoothing algorithm was used to make automatically generated pipeline routes fairer. The algorithms were fast and the method was shown to be effective and easy to use in a simple set of case studies.

Smooth Path Generation using Hexagonal Cell Representation (육각형 격자를 사용한 부드러운 경로생성)

  • Jung, Dong-Won
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.39 no.12
    • /
    • pp.1124-1132
    • /
    • 2011
  • This paper deals with smooth path generation using B-spline for fixed-wing unmanned aerial vehicles manuevering in 2D environment. Hexagonal cell representation is employed to model the 2D environment, which features increased connectivity among cells over square cell representation. Subsequently, hexagonal cell representation enables smoother path generation based on a discrete sequence of path from the path planner. In addition, we present an on-line path smoothing algorithm incorporating B-spline path templates. The path templates are computed off-line by taking into account all possible path sequences within finite horizon. During on-line implementation, the B-spline curves from the templates are stitched together repeatedly to come up with a reference trajectory for UAVs. This method is an effective way of generating smooth path with reduced on-line computation requirement, hence it can be implemented on a small low-cost autopilot that has limited computational resources.

Neural network based tool path planning for complex pocket machining (신경회로망 방식에 의한 복잡한 포켓형상의 황삭경로 생성)

  • Shin, Yang-Soo;Suh, Suk-Hwan
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.7
    • /
    • pp.32-45
    • /
    • 1995
  • In this paper, we present a new method to tool path planning problem for rough cut of pocket milling operations. The key idea is to formulate the tool path problem into a TSP (Travelling Salesman Problem) so that the powerful neural network approach can be effectively applied. Specifically, our method is composed of three procedures: a) discretization of the pocket area into a finite number of tool points, b) neural network approach (called SOM-Self Organizing Map) for path finding, and c) postprocessing for path smoothing and feedrate adjustment. By the neural network procedure, an efficient tool path (in the sense of path length and tool retraction) can be robustly obtained for any arbitrary shaped pockets with many islands. In the postprocessing, a) the detailed shape of the path is fine tuned by eliminating sharp corners of the path segments, and b) any cross-overs between the path segments and islands. With the determined tool path, the feedrate adjustment is finally performed for legitimate motion without requiring excessive cutting forces. The validity and powerfulness of the algorithm is demonstrated through various computer simulations and real machining.

  • PDF

A Fast Flight-path Generation Algorithm for Virtual Colonoscopy System (가상 대장 내시경 시스템을 위한 고속 경로 생성 알고리즘)

  • 강동구;이재연;나종범
    • Journal of Biomedical Engineering Research
    • /
    • v.24 no.2
    • /
    • pp.77-82
    • /
    • 2003
  • Virtual colonoscopy is a non-invasive computerized procedure to detect polyps by examining the colon from a CT data set. To fly through the inside of colons. the extraction of a suitable flight-path is necessary to Provide the viewpoint and view direction of a virtual camera. However. manual path extraction by Picking Points is a very time-consuming and difficult task due 1,c, the long and complex shape of colon. Also, existing automatic methods are computationally complex. and tend to generate an improper and/or discontinuous path for complicated regions. In this paper, we propose a fast flight-path generation algorithm using the distance and order maps. The order map Provides all Possible directions of a path. The distance map assigns the Euclidean distance value from each inside voxel to the nearest background voxel. By jointly using these two maps. we can obtain a proper centerline regardless of thickness and curvature of an object. Also, we Propose a simple smoothing technique that guarantees not to collide with the surface of an object. The phantom and real colon data are used for experiments. Experimental results show that for a set of human colon data, the proposed algorithm can provide a smoothened and connected flight-path within a minute on an 800MHz PC. And it is proved that the obtained flight-Path provides successive volume-rendered images satisfactory for virtual navigation.

Path Generation Algorithm Development for Ultrafast/Wide Area Laser Processing (초고속/대면적 레이저 가공을 위한 경로 생성 알고리즘 개발)

  • Kim, Kyung-Han;Yoon, Kwang-Ho;Lee, Jae-Hoon
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.27 no.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++.

Modified $A^*$ - Local Path Planning Method using Directional Velocity Grid Map for Unmanned Ground Vehicle (Modified $A^*$ - 방향별 속도지도를 활용한 무인차량의 지역경로계획)

  • Lee, Young-Il;Lee, Ho-Joo;Park, Yong-Woon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.3
    • /
    • pp.327-334
    • /
    • 2011
  • It is necessary that UGV(Unmanned Ground Vehicle) should generate a real-time travesability index map by analyzing raw terrain information to travel autonomously tough terrain which has various slope and roughness values. In this paper, we propose a local path planning method, $MA^*$(Modified $A^*$) algorithm, using DVGM (Directional Velocity Grid Map) for unmanned ground vehicle. We also present a path optimization algorithm and a path smoothing algorithm which regenerate a pre-planned local path by $MA^*$ algorithm into the reasonable local path considering the mobility of UGV. Field test is conducted with UGV in order to verify the performance of local path planning method using DVGM. The local path planned by $MA^*$ is compared with the result of $A^*$ to verify the safety and optimality of proposed algorithm.