• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1986년도 한국자동제어학술회의논문집; 한국과학기술대학, 충남; 17-18 Oct. 1986
• /
• pp.5-8
• /
• 1986

The simulation algorithm for all kinds of robots with arbitrary degrees of freedom which are combined with revolute joints or prismatic joints, or combinations was studied and implemented. This simulation package is composed of trajectory planning routine, control routine, kinematics routine using Newton-Raphson method, dynamics based on Newton-Euler method with four-bar linkage analysis, input routine and output routine.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1992년도 춘계학술대회 논문집
• /
• pp.317-322
• /
• 1992

Developed in this reseach is a CAM system for 5-axis NC Machining of sculpture surfaces. We identify problems in generating 5-axis NC data and propose methods of overcoming them. Issues discussed in this report are; kinematic modelling of NC machines; Determination of cutter position(location and orientation); check of machine work-range; linear trajectory planning; calculation of feedrate number. The proposed system has been implemented in FORTRAN77 on the Personal IRIS EWS, and it also consitutes a module of the CAD/CAM system 'CASSETTE' developed in KIST CAD/CAM lab..

• 대한전자공학회논문지
• /
• 제24권5호
• /
• pp.753-761
• /
• 1987

Approximation of a Cartesian straight line motion with linear interpolation in the joint space has many desirable advantages and applications. But inappropriate determination of the corresponding subtravelling and transition times makes such joint-trajectories violate the input torque/force constraints. An approach that can overcome this difficult and yield the joint trajectories utilizing the allowable maximum input torque/force is established in this paper. The effectiveness of these results is demonstrated by using a three-joint revolute manipulator.

• 한국군사과학기술학회지
• /
• 제23권4호
• /
• pp.407-416
• /
• 2020

Recent complex battle field demands Network Centric Warfare(NCW) ability to control various parts into a cohesive unit. In path planning filed, the NCW ability increases complexity of path planning algorithm, and it has to consider a communication coverage map as well as traditional parameters such as minimum radar exposure and survivability. In this paper, pros and cons of various propagation models are summarized, and we suggest a coverage map generation method using a Longley-Rice propagation model. Previous coverage map based on line of sight has significant discontinuities that limits selection of path planning algorithms such as Dijkstra and fast marching only. If there is method to remove discontinuities in the coverage map, optimization based path planning algorithms such as trajectory optimization and Particle Swarm Optimization(PSO) can also be used. In this paper, the Longley-Rice propagation model is used to calculate continuous RF strengths, and convert the strength data using smoothed leaky BER for the coverage map. In addition, we also suggest other types of rough coverage map generation using a lookup table method with simple inputs such as terrain type and antenna heights only. The implemented communication coverage map can be used various path planning algorithms, especially in the optimization based algorithms.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 추계학술대회 논문집
• /
• pp.301-305
• /
• 2001

Conventionally, robot control algorithms are divided into two stages, namely, path or trajectory planning and path tracking(or path control). This division has been adopted mainly as a means of alleviating difficulties in dealing with complex, complex, coupled manipulator dynamics. The minimum-time manipulator control problem is solved for the case when the path is specified and the actuator torque limitations are known. In path planning, DP is applied to applied to find the shortest path form initial position to final position with the assumptions that there is no obstacle and that each path is straight line. In path control, the phase plane technique is applied to the minimum-time control with the assumptions that the bound on each actuator torque is a function of joint position and velocity or constant. This algorithm can be used for any manipulator that has rigid link, known dynamics equations of motion, and joint angles that can be determined at a given position on the path.

• 대한전자공학회논문지
• /
• 제26권11호
• /
• pp.1770-1781
• /
• 1989

Two robots working in a common workspace may collide with each other. In this paper, a collision-free motion planning algorithm using view time concept is proposed to detect and avoid collision before robot motion. Collision may occur not only at the robot end effector but also at robot links. To detect and avoid potential collisions, the trajectory of the first robot is sampled periodically at every view time and the region in Cartesian space swept by the first robot is viewed as an obstacle during a single sampling period. The forbidden region in the joint constraint map (JCM). The JCM's are obtained in this way at every view time. An algorithm is established for collision-free motion planning of the two robot system from the sequence of JCM's and it is verified by simulations.

• 대한전기학회논문지
• /
• 제37권8호
• /
• pp.563-569
• /
• 1988

본 논문에서는 공통의 작업장에서 운용되는 두 개의 매니퓰레이터의 충돌회피를 위한 속도변형 방법들이 연구된다. 두 매니퓰레이터의 상호충돌시 현저한 특성으로 인한 여러 종류의 새로운 충돌양상이 연구되며 무충돌 운용을 계획하는데 사용된다. 충돌지도와 속도변형의 개념들이 무충돌 운용을 계{획하기 위해 개발 적용된다. 한가지 예가 궤적의 속도 가감을 보이기 위해 예시도었으며, 이 예는 움직이는 두 로보트 매니퓰레이터의 무충돌 궤도 계획을 위한 제안된 방법들의 유용성을 보여준다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권3호
• /
• pp.131-140
• /
• 2005

Fault-tolerant gait generation of a hexapod robot with crab walking is proposed. The considered fault is a locked joint failure, which prevents a joint of a leg from moving and makes it locked in a known position. Due to the reduced workspace of a failed leg, fault-tolerant crab walking has a limitation in the range of heading direction. In this paper, an accessible range of the crab angle is derived for a given configuration of the failed leg and, based on the principles of fault-tolerant gait planning, periodic crab gaits are proposed in which a hexapod robot realizes crab walking after a locked joint failure, having a reasonable stride length and stability margin. The proposed crab walking is then applied to path planning on uneven terrain with positive obstacles. i.e., protruded obstacles which legged robots cannot cross over but have to take a roundabout route to avoid. The robot trajectory should be generated such that the crab angle does not exceed the restricted range caused by a locked joint failure.

• International Journal of Control, Automation, and Systems
• /
• 제3권1호
• /
• pp.87-99
• /
• 2005

We present in this paper the stabilization (tracking) with motion planning of the six independent configurations of a mini unmanned areal vehicle equipped with four streamlined rotors. Naturally, the yaw-dynamic can be stabilized without difficulties and independently of other motions. The remaining dynamics are linearly approximated around a small roll and pitch angles. It will be shown that the system presents a flat output that is likely to be useful in the motion generation problem. The tracking feedback controller is based on receding horizon point to point steering. The resulting controller involves the lift (collective) time derivative for what flatness and feedback linearization are used. Simulation tests are performed to progress in a region with approximatively ten-meter-buildings.

• 전자공학회논문지B
• /
• 제29B권10호
• /
• pp.27-36
• /
• 1992

This paper proposes a numerical method of motion planning for manipulators using Foruier series. For a redundant manipulator, we predetermine the trajectories of redundant joints in terms of the Nth partial sum of the fourier series. then the optimal coefficients of the fourier series are searched by the Powell's method. For a nonredundant or redundant manipulator, CS02T-continuous smooth joint trajectory for a point-to-point task can be obtained while considering the frequency response. We apply the proposed method to the 3-link planar manipulator and the PUMA 560 manipulator. To show the validity of the proposed method, we analyze solutions by the Fast Fourier Transform (FFT). Also, several features are discussed to obtain an optimal solution.