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

• Transactions of the Korean Society of Automotive Engineers
• /
• v.22 no.3
• /
• pp.241-249
• /
• 2014

This paper presents a path planning algorithm of an autonomous vehicle (ADAM III) for collision avoidance in the presence of multiple obstacles. Under the requirements that a low-cost GPS is used and its computation should be completed with a sampling time of sub-second, heading angle estimation is proposed to improve performance degradation of its measurement and a hierarchical structure for path planning is used. Once it is decided that obstacle avoidance is necessary, the path planning consists in three steps: waypoint generation, trajectory candidate generation, and trajectory selection. While the waypoints and the corresponding trajectory candidates are generated based on position of obstacles, the final desired trajectory is determined with considerations of kinematic constraints as well as an optimal condition in a term of lateral deviation. Finally the proposed algorithm was validated experimentally through field tests and its demonstration was performed in Autonomous Vehicle Competition (AVC) 2013.

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

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.11
• /
• pp.137-144
• /
• 1998

In this paper we present our research dealing with the problem of tool deflection during the milling. We try to compensate the errors by considering a new tool trajectory. In order to determine the compensated tool trajectory, the problem is divided in three steps : cutting forces model, tool deflection model and trajectory compensation. Starting from experimental data, we determine a cutting forces model., which allows us to anticipate the tool deflection along one nominal path. In order to determine the compensated tool trajectory, we propose in this paper a method of path compensation, called “mirror method”. This method of tool path optimization allows to minimize errors due to tool deflection. Several examples are processed in simulations and validated experimentally.

• 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 the Korea Institute of Military Science and Technology
• /
• v.18 no.2
• /
• pp.173-180
• /
• 2015

North Korea has developed ballistic missiles over the past 30 years. It is believed that they have a variety of ballistic missiles more than 1,000. Because these ballistic missiles threaten South Korea directly, accurate analysis of them is essential. Flight trajectories of the ballistic missiles are generally changed by means of adjusting payload weight, Isp, flight path angle, and cut-off time. The flight path angle is widely used to control the missile range. However it is difficult to predict the missile trajectory exactly in real operational environment because the missile could be launched according to its intention and purpose. This work analyzed the 1,000 km range MRBM's trajectory characteristics from adjusting flight path angle which is depressed as well as lofted method. The analysis of missile trajectory characteristics is based on the simulation of the missile trajectory model developed by KNDU research team.

• Journal of the Korean Society of Systems Engineering
• /
• v.16 no.2
• /
• pp.131-140
• /
• 2020

The characteristics of ballistic missiles are changing rapidly but studies have mostly focused on fragmentary flight trajectory analysis estimating the changing characteristics of some types, while there is a lack of research on comprehensive and efficient ballistic search, detection and prediction for missiles including the new types that have been gaining attention lately. This paper analyzes the flight trajectory characteristics of ballistic missiles at various ranges considering flight path angle adjustment, specific impulse and drag force with altitude based on the optimized equations of motion reflecting the parameters of North Korea's general and new types of ballistic missiles. The flight trajectory characteristics of representative ranges for each ballistic missile were analyzed by adjusting the flight path angle in the minimum energy method, lofted method, and depressed method. In addition, High value target can attacked by ballistic missiles considering flight path angle adjustment at various points. It's expected to be used to Threat Evaluation and Weapon Allocation, and deployment of defense systems by interpreting the analysis of the latest Iskander-class ballistic missiles and the new multiple rocket launcher.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• 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.

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

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.04a
• /
• pp.176-181
• /
• 2000

Collision free task planning for dual-arm robot which perform many subtasks in a common work space can be achieved in two steps : path planning and trajectory planning. path planning finds the order of tasks for each robot to minimize path lengths as well as to avoid collision with static obstacles. A trajectory planning strategy is to let each robot move along its path as fast as possible and delay one robot at its initial position or reduce speed at the middle of its path to avoid collision with the other robot.