• 전기학회논문지
• /
• 제59권4호
• /
• pp.803-808
• /
• 2010

We propose a smooth path planning method for autonomous mobile robots. Due to nonholonomic constraints by obstacle avoidance, the smooth path planning is a complicated one. We generate smooth path that is considered orientation of robot under nonholonomic constraints. The proposed smooth planning method consists of two steps. Firstly, the initial path composed of straight lines is obtained from V-graph by Dijkstra's algorithm. Then the initial path is transformed by changing the curve. We apply the cardinal spline into the stage of curve generation. Simulation results show a performance of proposed smooth path planning method.

• 제어로봇시스템학회논문지
• /
• 제12권7호
• /
• pp.671-678
• /
• 2006

This article proposes a smooth path generation and time scheduling method for general tasks defined by non-smooth path segments in industrial robotic applications. This method utilizes a simple 3rd order polynomial function for smooth interpolation between non-smooth path segments, so that entire task can effectively maintain constant line speed of operation. A predictor-corrector type numerical mapping technique, which correlates time based speed profile to the smoothed path in Cartesian space, is also provided. Finally simulation results show the feasibility of the proposed algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제10권2호
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• 한국항공우주학회지
• /
• 제39권12호
• /
• pp.1124-1132
• /
• 2011

본 논문에서는 2차원 공간에서 기동하는 고정익 무인항공기의 장애물 회피를 위한 부드러운 경로궤적을 생성하는 문제를 다룬다. 2차원 장애물맵의 이산화 모델링을 위해 육각형 격자를 채택하였고, 이는 사각형 격자에 비해 연결성이 높아 부드러운 경로궤적 생성이 가능하도록 하였다. 특히 본 논문에서 제안된 경로템플릿 기법은 일정거리 단위로 조합 가능한 대표경로들(경로템플릿)을 사용하여 무인항공기의 기준경로를 생성하는 방법이고, 온라인 경로궤적 생성에서 계산량을 줄여 메모리 및 연산리소스가 제한되는 소형 오토파일럿에서도 적용이 가능하다는 장점이 있다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.162-167
• /
• 2003

In this paper, a novel feasible real-time system was researched for a differential driven wheeled autonomous mobile robot so that the mobile robot can move in a smooth, safe and elegant way. Least Square Minimum Path Planning was well used for the system to generate a smooth executable path for the mobile robot, and the point-to-point tracking algorithm was presented as well as its application in arbitrary path tracking. In order to make sure the robot can run elegantly and safely, trapezoidal speed was integrated into the point-to-point path tracking algorithm. The application to guest following for the autonomous mobile robot shows its wide application of the algorithm. The novel design was successfully proved to be feasible by our experiments on our mobile robot Interactive Robot Usher (IRU) in National University of Singapore.

• 전자공학회논문지SC
• /
• 제45권4호
• /
• pp.68-78
• /
• 2008

연속적인 경로 사이를 부드러운 곡선으로 잇기 위해서 기존의 로봇 제어기들은 일반적으로 연속적인 경로를 시간 축에서 합성하는 방법을 사용해 왔다. 하지만 이런 방법은 다음과 같은 두 가지 단점을 내재하고 있다. 천이 경로의 형태가 연접하게 생성될 수 없다는 점과 천이하는 동안 속력을 제어할 수 없다는 점이 그것이다. 이러한 문제점들을 극복하기 위해서 본 논문은 매끄럽지 않게 연결된 두 경로들을 부드럽게 잇기 위해 곡률이 제한된 새로운 천이 궤적 생성 방법을 제시하고자 한다. 실험 결과는 기존의 방법들보다 천이 궤적이 더 부드럽게 생성되는 것을 보여주며, 또한 보장된 곡률의 제한 수준은 $0.02{\sim}1$임을 보여준다.

• 수산해양기술연구
• /
• 제32권3호
• /
• pp.321-328
• /
• 1996

This paper presents a robot simulator which can automatically generate a smooth collision free path. This simulator has the characterstisc of the object - oriented programming which is coded in Borland C+ +. Using General Inverse Algorithm, the inverse kinematics solutions of any kind of robots can be found generally. This simulator also uses Bezier Functions for the description of a smooth collision - free path. In addition, GUI(Graphic User Interface)technique is employed for user's convenience.

• 한국CDE학회논문집
• /
• 제6권4호
• /
• pp.263-270
• /
• 2001

In stamping-die manufacturing, the first step is to build die patterns for lost wax casting process. A recent industry trend is to manufacture the die pattern using 3-axis NC machining. This study identifies technical considerations of the pattern machining caused by the characteristics of Styrofoam material, and proposes technical methods related to establishing a process plan and generating tool paths for optimizing the pattern machining. In this paper, the process plan includes the fellowing three items: 1) deter-mining a global machining sequence-a sequence of profile, top, bottom machining and two set-ups, 2) extracting machining features from a pattern model and merging them, and 3) determining a machining sequence of machining features. To each machining feature, this study determines the machining start point, generates the approach tool path, and proposes a tool path linking method fur reducing the distance of the cutter rapid motion. Finally, a smooth tool path generation and an automatic feedrate adjustment (AFA) method are introduced far raising the machining efficiency.

• 한국경영과학회지
• /
• 제21권1호
• /
• pp.1-17
• /
• 1996

There have been considerable researches for solving large-scale separable convex optimization ptoblems. In this paper we present a method for large-scale nonseparable smooth convex optimization problems with block-angular linear constraints. One of them is occurred in reconfiguration of the virtual path network which finds the routing path and assigns the bandwidth of the path for each traffic class in ATM (Asynchronous Transfer Mode) network [1]. The solution is approximated by solving a sequence of the block-angular structured separable quadratic programming problems. Bundle-based decomposition method [10, 11, 12]is applied to each large-scale separable quadratic programming problem. We implement the method and present some computational experiences.

• ETRI Journal
• /
• 제43권6호
• /
• pp.1013-1023
• /
• 2021

In this study, we propose a practical path planning method that combines the A^* search algorithm and minimum snap trajectory generation. The A^* search algorithm determines a set of waypoints to avoid collisions with surrounding obstacles from a starting to a destination point. Only essential waypoints (waypoints necessary to generate smooth trajectories) are extracted from the waypoints determined by the A^* search algorithm, and an appropriate time between two adjacent waypoints is allocated. The waypoints so determined are connected by a smooth minimum snap trajectory, a dynamically executable trajectory for the quadrotor. If the generated trajectory is invalid, we methodically determine when intermediate waypoints are needed and how to insert the points to modify the trajectory. We verified the performance of the proposed method by various simulation experiments and a real-world experiment in a forested outdoor environment.