• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.826-829
• /
• 1995

In this paper, the problem of minimum-time trajectory planning of a robot manipulator with an arbitrary path is dealt. As for a straight path, the trajectory planning can be done without difficulty since the path is easily parameterized by its length. However, this is not the case for a non-straight path. In this paper, by noting that the others' joint angles and velocities are determined if one joint's angle and velocity are known, we reduce the problem of trajectory planning on a non-straight path to one in the 2-dimensional space of one joint's angle and velocity. Then, by applying the dynamic programming, we achieve the minimum-time trajectory planning. A simulation is done for verifying this.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.30.6-30
• /
• 2001

We build near minimum-time trajectory planning algorithm for Wheeled mobile robots (WMRs) With Piece-Wise Constant control voltages satisfying i) initial and final postures and velocities as well as ii) voltage constraints We consider trajectory planning problem for cornering motion with a path-deviation requirement for obstacle avoidance. We divide our trajectory planning algorithm for cornering motion into five ordered sections: translational, transient, rotational, transient, and translational sections. Transforming dynamics into uncorrelated form with respect to translational and rotational velocities, we can make controls for translation/rotational velocities to be independent. By planning each section with constant voltages, and integrating five sections with adjustment of numbers of steps, the overall trajectory is planned. The performance is very close to the minimum-time solution, which is validated via simulation studies.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.6
• /
• pp.122-127
• /
• 1996

The achievement of the optimal condition for the task of an industrial articulated robot used in many fields is an important problem to improve productivity. In this paper, a minimum-time trajectory for an articulated robot along the specified path is studied and simulated with a proper example. A general dynamic model of manipulator is represented as a function of path distance. Using this model, the velocity is produced as fast as possible at each point along the path. This minimum-time trajectory planning module together with the existing collision-free path planning modules is utilized to design the optimal path planning of robot in cases where obstacles present.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.9
• /
• pp.845-853
• /
• 2012

We propose time-optimal cornering motion trajectory planning and control algorithms for differential wheeled mobile robot with motor actuating voltage constraint, under piecewise constant control input condition. For time-optimal cornering trajectory generation, 1) we considered mobile robot's dynamics including actuator motors, 2) divided the cornering trajectory into one liner section, followed by two cornering section with angular acceleration and deceleration, and finally one liner section, and 3) formulated an efficient trajectory generation algorithm satisfying the bang-bang control principle. Also we proposed an efficient trajectory control algorithm and implemented with an X-bot to prove the performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.990-995
• /
• 1990

A minimum-time trajectory planning for two robot arms with designated paths and coordination is proposed. The problem considered in this paper is a subproblem of hierarchically decomposed trajectory planning approach for multiple robots : i) path planning, ii) coordination planning, iii) velocity planning. In coordination planning stage, coordination space, a specific form of configuration space, is constructed to determine collision region and collision-free region, and a collision-free coordination curve (CFCC) passing collision-free region is selected. In velocity planning stage, normal dynamic equations of the robots, described by joint angles, velocities and accelerations, are converted into simpler forms which are described by traveling distance along collision-free coordination curve. By utilizing maximum allowable torques and joint velocity limits, admissible range of velocity and acceleration along CFCC is derived, and a minimum-time velocity planning is calculated in phase plane. Also the planning algorithm itself is converted to simple numerical iterative calculation form based on the concept of neural optimization network, which gives a feasible approximate solution to this planning problem. To show the usefulness of proposed method, an example of trajectory planning for 2 SCARA type robots in common workspace is illustrated.

• ETRI Journal
• /
• v.43 no.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.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.445-449
• /
• 1989

Achievement of a straight line motion in the Cartesian space has a matter of great importance. Minimization of task execution time with linear interpolation in the joint space, accomplishing of a approximation of straight line motion in the Cartesian coordinate is considered as the prespecified task. Such determination yields minimum time joint-trajectory subject to input torque constraints. The applications of these results for joint-trajectory planning of a two-link manipulator with revolute joints are demonstrated by computer simulations.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.526-528
• /
• 2004

This paper focuses on planning strategies for object interception, especially with minimum time. Herein, the goal is for robot to intercept object with minimum time on a conveyor line that flows to x-axis with respect to world coordinate system. In order to do it, conveyor system needs the algorithms for minimizing time. This objective is achieved by solving about two problems: selection of a minimum-time interception point and planning of an optimal robot trajectory. Herein, the first problem is formulated a minimization of the robot-object interception time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.9
• /
• pp.795-801
• /
• 2005

This paper focuses on planning strategies for object interception by the robotic manipulator on a conveyor system in minimum time. The goal is that the robot is able to intercept object with minimum time on a conveyor line that moves at a given speed. The search algorithm for minimum time solution is given in detail for all possible cases for initial locations of robot. Simulations results show the validity of the given algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.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.