• International Journal of Control, Automation, and Systems
• /
• v.4 no.1
• /
• pp.10-16
• /
• 2006

In this paper, moving a fragile object from an initial point to a specific location in the minimum time without damage is studied. In order to achieve this goal, initially, the maximum acceleration and velocity ranges are specified. These ranges can be dynamically generate on the planned path by the manipulator. The path can be altered by considering the geometrical constraints. Later, considering the impulsive force constraint on the object, the range of maximum acceleration and velocity are obtained to preserve object safety while the manipulator is carrying it along the curved path. Finally, a time-optimal trajectory is planned within the maximum allowable range of acceleration and velocity. This time-optimal trajectory planning can be applied to real applications and is suitable for both continuous and discrete paths.

• IE interfaces
• /
• v.3 no.2
• /
• pp.23-38
• /
• 1990

The use of robots for painting operations is a powerful alternative as a means for automation and quality improvement. A typical method being used for motion planning of the painting robot is to guide the robot along the desired path : the "lead-through" method. Although this method is simple and has been widely used, it has several drawbacks a) The robot cannot be used during the teaching period, b) A human is exposed to a hostile environment, c) The motions taught are, at best, human's skill level. To deal with the above problems, an integrated robot-trajectory planning scheme is presented. The new scheme takes CAD data describing the shape and geometry of the objects, and outputs an optimal trajectory in the sense of coating thickness and painting time. The purpose of this paper is to investigate theoretical backgrounds for such a scheme including geometric modeling, painting mechanics and robot trajectory planning, and develop algorithms for generating spray gun paths and minimum-time robot trajectories. Future study is to implement these algorithms on an workstation to develop an integrated software system ; ATPS(Automatic Trajectory Planning System) for spray painting robots.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.5
• /
• pp.1495-1502
• /
• 1991

본 연구에서는 동일 작업 공간내에서 두대의 로봇이 각각의 토크의 제한 조건 과 충돌 회피 조건을 만족하면서 근사 최소 시간에 지정된 경로를 주행하기 위한 궤적 계획법을 제안하고자 한다. 이때, 동작 우선도에 의하여 한 대의 로봇은 주 로봇, 다른 한 대의 로봇은 종 로봇으로 지정되는데 주 로봇은 입력 토크의 제한조건을 만족 하며 주어진 경로를 최소 시간에 움직이도록 궤적 계획을 하였으며, 종 로봇은 주 로 봇과의 충돌을 피하고 입력 토크의 제한 조건을 만족하며 주어진 경로를 근사 최소 시 간에 움직이도록 하였다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.36-45
• /
• 1992

A numerical trajectory planning method for path-constrained trajectory planning is proposed which ensures collision-free and time-optimal motions for two robotic manipulators with limited actuator torques and velocities. For each robot, physical constraints of the robots such as limited torques or limited rotational velocities of the actuators are converted to the constraints on velocity and acceleration along the path, which is described by a scalar variable denoting the traveled distance from starting point. Collision region is determined on the coordination space according to the kinematic structures and the geometry of the paths of the robots. An Extended Coordination Space is then constructed` an element of the space determines the postures and the velocities of the robots, and all the constraints described before are transformed to some constraints on the behaviour of the coordination-velocity curves in the space. A dynamic programming technique is them provided with on the discretized Extended Coordination Space to derive a collision-free and time-optimal trajectory pair. Numerical example is included.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.1
• /
• pp.78-86
• /
• 1998

This paper presents a numerical method of the minimum-time trajectory planning for a robot manipulator amid obstacles. Each joint displacement is represented by the linear combination of the finite-term quintic B-splines which are the known functions of the path parameter. The time is represented by the linear function of the same path parameter. Since the geometric path is not fixed and the time is linear to the path parameter, the coefficients of the splines and the time-scale factor span a finite-dimensional vector space, a point in which uniquely represents the manipulator motion. The displacement, the velocity and the acceleration conditions at the starting and the goal positions are transformed into the linear equality constraints on the coefficients of the splines, which reduce the dimension of the vector space. The optimization is performed in the reduced vector space using nonlinear programming. The total moving time is the main performance index which should be minimized. The constraints on the actuator forces and that of the obstacle-avoidance, together with sufficiently large weighting coefficients, are included in the augmented performance index. In the numerical implementation, the minimum-time motion is obtained for a planar 3-1ink manipulator amid several rectangular obstacles without simplifying any dynamic or geometric models.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1402-1407
• /
• 2004

Moving a fragile object from an initial point to a goal location in minimum time without damage is pursued in this paper. In order to achieve the goal, first of all, the range of maximum acceleration and velocity are specified, which the manipulator can generate dynamically on the path that is planned a priori considering the geometrical constraints. Later, considering the impulsive force constraint of the object, the range of maximum acceleration and velocity are going to be obtained to keep the object safe while the manipulator is carrying it along the curved path. Finally, a time-optimal trajectory is planned within the maximum allowable range of the acceleration and velocity. This time optimal trajectory planning can be applied for real applications and is suitable for not only a continuous path but also a discrete path.

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

In this paper we outline an approach for the collision-free trajectory planning of two robot arms which are modeled as connected line segments. A new approach to determine the collision between two robot arms and the boundary of the collision region in the coordination space is proposed. The coordination curve may then be chosen to avoid the collision region. For minimum time trajectory, time is assigned to this curve by dynamic time scaling under constraints such as maximum torque or maximum angular velocity of each actuator. A comparison of the proposed method and the graphical method of determining the collision region is also included. Finally, as an example, some simulation results for two SCARA type robots are presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.423-427
• /
• 1993

A velocity planning method is proposed that ensures collision-free and minimal delay-time motions for two robotic manipulators and auxiliary equipments. Additional path, which makes robot start with possible largest speed, is added to the original prescribed path of one of two robots, and this running start along the additional path reduces delay time introduced to avoid collision between the robots and therefore reduces total traveling time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.1
• /
• pp.56-64
• /
• 2013

We propose an efficient minimum-time cornering motion planning algorithms for differential-driven wheeled mobile robots with motor control input constraint, under piecewise constant control input sections. First, we established mobile robot's kinematics and dynamics including motors, divided the cornering trajectory for collision-free into one translational section, followed by one rotational section with angular acceleration, and finally the other rotational section with angular deceleration. We constructed an efficient motion planning algorithm satisfying the bang-bang principle. Various simulations and experiments reveal the performance of the proposed algorithm.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.10
• /
• pp.44-52
• /
• 1990

A collision-free trajectory planning for two robots with designated paths is considered. The proposed method is based on the concept of decomposing the planning problem into two steps: one is determining coordination of two robots, and the other is velocity planning with determined coordination. Dynamics and maximum allowable joint velocities are also taken into consideration in the whole planning process. The proposed algorithm is converted into numerical calculation version based on neural optimization network. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robot in common workspace is illustrated.