• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.621-626
• /
• 1989

An efficient algorithm for planning near-optimum trajectory of manipulators is proposed. The algorithm is divided into two stages. The first one is the optimization of time trajectory with given spatial path. And the second one is the optimization of the spatial path itself. To consider the second problem, the manipulator dynamics is represented using the path parameter "s", then a differential equation corresponding to the dynamics is solved as two point boundary value problem. In this procedure, the gradient method is used to calculate improved input torques.t torques.

• 한국산업융합학회 논문집
• /
• 제20권2호
• /
• pp.89-95
• /
• 2017

In this paper, we suggest the method for a mobile robot to move safely from an initial position to a goal position in the wide environment like a building. There is a problem using odometry encoder sensor to estimate the position of a mobile robot in the wide environment like a building. Because of the phenomenon of wheel's slipping, a encoder sensor has the accumulated error of a sensor measurement as time. Therefore the error must be compensated with using other sensor. A vision sensor is used to compensate the position of a mobile robot as using the regularly attached light's panel on a building's ceiling. The method to create global path planning for a mobile robot model a building's map as a graph data type. Consequently, we can apply floyd's shortest path algorithm to find the path planning. The effectiveness of the method is verified through simulations and experiments.

• 한국항공우주학회지
• /
• 제50권6호
• /
• pp.385-391
• /
• 2022

본 논문에서는 경사 하강법 기반의 경로 생성(GBPP)과 입자 군집 최적화(PSO)를 결합하여 3차원 공간에서 금지구역, 지형정보, 고정익 특성 등을 고려한 경로 생성 알고리즘을 제안한다. 기존의 GBPP 방법의 경우 빠르게 경로 생성이 가능하지만 초기 경로에 따라 지역적 최적 값에 빠져 안전하지 않은 경로가 생성될 수 있다. 유전 알고리즘(GA)과 PSO 등 생물학에서 영감을 받은 군집 지능 알고리즘들의 경우 다양한 경로들을 샘플링하여 지역적 최적 값 문제를 해결할 수 있다. 다만 무인기와 경로점 개수가 증가하여 최적 변수가 증가할 경우 군집 개수를 늘려야 하고 계산 시간이 크게 증가한다. 두 알고리즘 단점을 보완하고자 본 연구에서는 GBPP 입력 값인 초기경로를 수평, 수직 방향에 대한 변위 두 가지 변수로 정의하고 이를 PSO 변수로 정의하여 계층적 경로 최적화 알고리즘 HPSO를 제안한다. 제안한 알고리즘은 통용되는 비행 제어 컴퓨터(FCC)의 software-in-the-loop simulation(SILS)을 사용하여 고정익 무인기에 대한 사용 가능성을 검증하였다.

• 제어로봇시스템학회논문지
• /
• 제19권7호
• /
• pp.599-604
• /
• 2013

Path planning of mobile robots has a purpose to design an optimal path from an initial position to a target point. Minimum driving time, minimum driving distance and minimum driving error might be considered in choosing the optimal path and are correlated to each other. In this paper, an efficient driving trajectory is planned in a real situation where a mobile robot follows a moving object. Position and distance of the moving object are obtained using a web camera, and the rotation angular and linear velocities are estimated using Kalman filters to predict the trajectory of the moving object. Finally, the mobile robot follows the moving object using a single curvature trajectory by estimating the trajectory of the moving object. Using the estimation by Kalman filters and the single curvature in the trajectory planning, the total tracking distance and time saved amounts to about 7%. The effectiveness of the proposed algorithm has been verified through real tracking experiments.

• KIEAE Journal
• /
• 제11권1호
• /
• pp.29-38
• /
• 2011

This study suggested practical application of climate design on apartment complex with the focus on the use of Cold Air Flow and green building design method. The domestic research on the wind path analysis has been associated since the early 21th century in urban planning and site planning, this initiative study aimed to mitigate the urban heat island effect and to promote the sustainable urban development. It is, however, mostly focused on the flow analysis and heat flow in the urban context, due to the poor application of the wind path analysis in actual planning and design. Special attention is paid to the possibilities of identifying and developing the application methods in relation to Cold Air Flow and building design. This study examined these relations and suggested some trenchant approach to a more comprehensive and efficient use of the wind flow analysis in climate design.

• 한국CDE학회논문집
• /
• 제4권4호
• /
• pp.295-311
• /
• 1999

An increasing attention is paid to STEP-NC, the next generation CNC controller interfacing STEP-compatible data. In this paper, we first propose an Architecture for the STEP-NC (called FBCC: Feature Baled CNC Controller) accepting feature code compatible with STEP-data, and executing NC motion feature by feature while monitoring the execution status. The main thrust of the paper has been to develop an automatic on-line tool path generation and modification scheme for milling operation. The tool path it generated iota each feature by decomposing into a finite number of primitive features. The key function in the new scheme is haw to accommodate unexpected execution results. In our scheme, the too1 path plinker is designed to have a tracing capability iota the tool path execution so that a new path can be generated from the point where the operation is stopped. An illustrative example is included to show the capability of the developed algorithm.

• 전자공학회지
• /
• 제41권1호
• /
• pp.45-52
• /
• 2014

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.843-845
• /
• 1995

There are a variety of trajectory and control algorithms available for robot trajectory tracking. Before using the enhanced trajectory and control algorithms to reduce the tracking error, we introduce the new method which reduces the tracking error by clipping the joint velocity. A lot of robot trajectory tracking methods are proposed to enhance the robot tracking, but irregular tracking errors are always accompanied. Up to now, these irregular tracking errors are gradually but uniformly reduced by introducing more complicated control algorithms. It is intuitively obvious to reduce only the big errors selectively in the irregular ones for the better performance. By heuristic method, big tracking errors in these irregular ones are assumed mostly due to the fast moving of joint with respect to the same tracking and control method. So, in this paper, we introduce a new method which reduce the big tracking errors by clippings the joint velocity with the constraint of given path. Using this method, desired trajectory tracking is obtained within the far reduced error bound. Also, this method is successfully applied to generate the path-constrained error reducing trajectories for 2-axis SCARA type robot.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2002년도 춘계학술대회 논문집
• /
• pp.161-165
• /
• 2002

This paper describe a trajectory generation method for a soccer robot using cubic Bezier curve. It is proposed that the method to determine the location of control points. The control points are determined by the distance and the velocity parameters of start and target positions. Simulation results show its traceability of the trajectory of mobile robot.

• 제어로봇시스템학회논문지
• /
• 제21권5호
• /
• pp.471-476
• /
• 2015

This paper presents a maximum velocity trajectory planning algorithm for differential mobile robots with wheel velocity constraint to cope with physical limits in the joint space for two-wheeled mobile robots (TMR). In previous research, the convolution operator was able to generate a central velocity that deals with the physical constraints of a mobile robot while considering the heading angles along a smooth curve in terms of time-dependent parameter. However, the velocity could not track the predefined path. An algorithm is proposed to compensate an error that occurs between the actual and driven distance by the velocity of the center of a TMR within a sampling time. The velocity commands in Cartesian space are also converted to actuator commands to drive two wheels. In the case that the actuator commands exceed the maximum velocity the trajectory is redeveloped with the compensated center velocity. The new center velocity is obtained according to the curvature of the path to provide a maximum allowable velocity meaning a time-optimal trajectory. The effectiveness of the algorithm is shown through numerical examples.