• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.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.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.8
• /
• pp.563-569
• /
• 1988

This research presents several velocity modification methods for collision avoidance of two manipulators in a common workspace. Due to the distinct nature of collision avoidance between the two manipulators, a new classification of collision situations is presented and utilized in planning a collision-free path. Concepts of a collision map and velocity modification are applied for realizing collision-free motion planning. An example is shown for velocity modification of a trajectory, which shows the significance of the proposed approaches in collision-free motion planneng of two moving robots.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10b
• /
• pp.951-957
• /
• 1988

A collision-free trajectory planning algorithm is proposed to optimally coordinate two robots working in a common 3-D workspace. Each link of the two robots is modeled as a line segment and by their motion priority, one of the two robots is chosen as the master and the other the slave. And the one-step-ahead minimum distance between the two robots is computed by moving the master to the next location on its specified trajectory. Then the nominal trajectory of the slave is modified such that the distance between the next locations of the master and the slave must be larger than a prespecified allowable minimum distance. Here the weighted sum of the trajectory error and the joint motions of the slave is minimized by using the linear programming technique under the constraints that joint angle and velocity limits are not violated. To show the validity of the proposed algorithm, a numerical example is illustrated by employing a two dof's and a three dof's planar robots.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.599-606
• /
• 1992

A manipulator system that needs significantly large workspace volume and high payload capacity has greater link flexibility than typical industrial robots and teleoperators. If link flexibility is significant, position control of the manipulator's end-effector exhibits the nonminimum phase, noncollocated, and flexible structure system control problems. This paper addresses inverse dynamic trajectory planning issues of a flexible manipulator. The inverse dynamic equation of a flexible manipulator was solved in the time domain. By dividing the inverse system equation into the causal part and the anticausal part, the inverse dynamic method calculates the feedforward torque and the trajectories of all state variables that do not excite structural vibrations for a given end-point trajectory. Through simulation and experiment with a single-Unk flexible manipulator, the effectiveness of the inverse dynamic method has been demonstrated.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.539-543
• /
• 1999

This paper describes a sweeping path planning algorithm for an autonomous smearing robot on commercial autoCAD system. An automatic planner generates a sweeping path pattern by proposed five basic procedures, (1) interfacing architectural CAD system, (2) off-line obstacle map building, (3) scanning the whole workspace for subgoals of sweeping line, (4) tracking sequence of the subgoals, and (5) obstacle avoiding. A sweeping path is planned by sequentially connecting the tracking points in such a way that (1) the connected line segments should be crossed, (2) the total tracking points should be as short as possible, (3) the tracking line should not pass through the obstacle. Feasibility of the developed techniques has been demonstrated on real architectural CAD draft.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.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.

• 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.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.429-432
• /
• 2003

In this paper, a novel neural network approach is proposed for cleaning robot to complete coverage path planning with obstacle avoidance in stationary and dynamic environments. The dynamics of each neuron in the topologically organized neural network is characterized by a shunting equation derived from Hodgkin and Huxley's membrane equation. There are only local lateral connections among neurons. The robot path is autonomously generated from the dynamic activity landscape of the neural network and the previous robot location without any prior knowledge of the dynamic environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.627-634
• /
• 1989

A collision-free trajectory planning algorithm using the iterative learning concept is proposed for dual robot arms in a 3-D workspace to accurately follow their specified paths with constant velocities. Specifically, a collision-free trajectory minimizing the trajectory error is obtained first by employing the linear programming technique. Then the total operating time is iteratively adjusted based on the maximum trajectory error of the previous iteration so that the collision-free trajectory has no deviation from the specified path and also the operating time is near-minimal.

• Journal of the Korean Society for Precision Engineering
• /
• v.27 no.1
• /
• pp.76-83
• /
• 2010

There have been many studies regarding development of autonomous excavation system which is helpful in construction sites where repetitive jobs are necessary. Unfortunately, bucket trajectory planning was excluded from the previous studies. Since, the best use of excavator is to dig efficiently; purpose of this research was set to determine an optimized bucket trajectory in order to get best digging performance. Among infinite ways of digging any given path, criterion for either optimal or efficient bucket moves is required to be established. One method is to adopt work know-how from experienced excavator operator; However the work pattern varies from every worker to worker and it is hard to be analyzed. Thus, other than the work pattern taken from experienced operator, we developed an efficiency model to solve this problem. This paper presents a method to derive a bucket trajectory from optimization theory with empirical CLUB soil model. Path is greatly influenced by physical constraints such as geometry, excavator dimension and excavator workspace. By minimizing a energy function under these constraints, an optimal bucket trajectory could be obtained.