• Journal of the Korean Society of Industry Convergence
• /
• v.19 no.2
• /
• pp.75-80
• /
• 2016

This study proposes a efficient technology to control the optimal trajectory planning and real-time implementation method which can perform autonomous travelling for unmaned factory automation. Online path planning should plan and execute alternately in a short time, and hence it enables the robot avoid unknown dynamic obstacles which suddenly appear on robot's path. Based on Route planning and control algorithm, we suggested representation of edge cost, heuristic function, and priority queue management, to make a modified Route planning algorithm. Performance of the proposed algorithm is verified by simulation test.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.12
• /
• pp.1601-1609
• /
• 1988

In the control of the robotic manipulators, the variable structure control method for the set point Regualation has an advantage of the insensitivity about parameter variations and disturbances. When the robotic manipulatores are controlled by a point-to-point scheme, no path constraint is considered. Thus, the variable structure control method will be effectively applied only if the trajectory of the robot hand is estimated precisely. In this paper, the joint trajectories in the joint space and the hand trajectory in the cartesian space are calculated by the variable structure control method, and an algorithm is suggested to elaborate the deviation error of the robot hand from a straight line path. The result of this study will become a base of the effective path planning about robotic manipulators with the variable structure control concept.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.69-77
• /
• 1991

A collision-free trajectory planning algorithm using an iterative learning concept is proposed for dual robot arms in a 3-D common 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 that the operating time is near-minimal. To show the validity of the proposed algorithm, a numerical example is presented based on two planar robots.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.358-377
• /
• 2015

In this paper, we propose a novel approach for trajectory recovery. Our system uses a triangulation procedure for skeletonization and graph theory to extract the trajectory. Skeletonization extracts the polyline skeleton according to the polygonal contours of the handwritten characters, and as a result, the junction becomes clear and the characters that are touching each other are separated. The approach for the trajectory recovery is based on graph theory to find the optimal path in the graph that has the best representation of the trajectory. An undirected graph model consisting of one or more strokes is constructed from a polyline skeleton. By using the polyline skeleton, our approach accelerates the process to search for an optimal path. In order to evaluate the performance, we built our own dataset, which includes testing and ground-truth. The dataset consist of thousands of handwritten characters and word images, which are extracted from five handwritten documents. To show the relative advantage of our skeletonization method, we first compare the results against those from Zhang-Suen, a state-of-the-art skeletonization method. For the trajectory recovery, we conduct a comparison using the Root Means Square Error (RMSE) and Dynamic Time Warping (DTW) in order to measure the error between the ground truth and the real output. The comparison reveals that our approach has better performance for both the skeletonization stage and the trajectory recovery stage. Moreover, the processing time comparison proves that our system is faster than the existing systems.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.4
• /
• pp.55-61
• /
• 2020

In this paper, we present a novel approach to efficiently control the location of NPC(Non-playable characters) in the interactive virtual world such as game, virtual reality. To control the NPC's movement path, we first calculate the main trajectory based on the user's path, and then move the NPC based on the weight map. Our method constructs automatically a navigation mesh that provides new paths for NPC by referencing the user trajectories. Our method enables adaptive changes to the virtual world over time and provides user-preferred path weights for smartagent path planning. We have tested the usefulness of our algorithm with several example scenarios from interactive worlds such as video games, virtual reality. In practice, our framework can be applied easily to any type of navigation in an interactive world.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.1
• /
• pp.50-54
• /
• 2004

Reference trajectory generation plays a key role in the computer control for accurate position control of machine. Generated trajectories must not only describe the desired tool path accurately, but must also have smooth kinetic profiles in order to maintain higher tracking accuracy, and to avoid exciting the natural modes of the mechanical servo control system. To achieve higher accurate position control, a method of limiting accelerating and decelerating speed data of reference trajectories is proposed to draw the path with an assigned accuracy without any complex operations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.387-392
• /
• 1992

This paper presents a local trajectory generation method which is based on a sequence of reference posture-velocities and the efficient low level control algorithm which constructs the complete smooth curve from the trajectory specification. The reference trajectory generator(RTG) which is in between the local path planner(LPP) and the robot motion controller(RMC) generates a sequence of set-points for each path segments from the LPP and pass it to the RMC. The RMC controls the motions of vehicle which should follow the sequence. In the feedback controller of VMC, the method which compensates robot posture-velocity error correctly is used. These methods are implemented on indoor autonomous vehicle, 'ALIVE' mobile robot. The ALIVE mobile robot system is implemented on the 32bit VME bus system: the two VME CPU's are used for RTG and RMC, while the 80C196KC-based VME board is used for motor controller.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.11a
• /
• pp.406-412
• /
• 1996

Optimal trajectory for a robot manipulator minimizing actuator torques or energy consumption in a fixed traveling time is obtained in the presence of obstacles. All joint displacements are represented in finite terms of Fourier cosine series and the coefficients of the series are obtained optimally by nonlinear programming. Thus, the geometric path need not be prespecified and the full dynamic model is employed. To avoid the obstacles, the concept of penalty area is newly introduced and this penalty area is included in the performance index with an appropriate weighting coefficient. This optimal trajectory will be useful as a geometric path in the minimum-time trajectory planning problem.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.2
• /
• pp.152-161
• /
• 1988

In this paper, a direct method for obtaining the trajectory set points is investigated in discrete-time, which is different from the other conventional schemes. We consider the tracking of a straight line path, where the trajectory set points for manipulator control are determined exactly on the straight line path. For the purpose of the munimum-time operation of manipulators, the problem is formulated as a maximization of the Cartesian distance between two consecutive servo time instants. The maximization is subject to the smoothness and torque constraints. Several algorithms are developed and utilized to maximize the Cartesian distance. The proposed approach has been simulated on a VAX-11/780 computer to verify its performance.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.3
• /
• pp.147-155
• /
• 1997

Optimal trajectory for a robot manipulator minimizing actuator torques or energy consumptions ina fixed traveling time is obtained in the presence of obstacles. All joint displacements are represented in finite terms of Fourier cosine series and the coefficients of the series are obtained optimally by nonlinear programming. Thus, the geometric path need not be prespecified and the full dynamic model is employed. To avoid the obstacles, the concept of the penalty area is newly introduced and this penalty area is includ- ed in the performance index with an appropriate weighting coefficient. This optimal trajectory will be useful as a geometric path in the minimum-time trajectory planning problem.