• The Journal of the Korea Contents Association
• /
• v.6 no.11
• /
• pp.302-309
• /
• 2006

This paper propose a practical algorithm to reuse and expand the objects. This algorithm is based on the Motion Path Modification rules. We focus on reusing of the existing motions for synthesizing new motions for the objects. Both the linear and the nonlinear curve-fitting algorithm are applied to modify an animation by keyframe interpolation and to make the motion appear realistic. We also proposes a framework of the scenario-based 3D image synthesizing system that allows common users, who envision a scenario in their minds, to realize it into segments of a cool animation. The framework is useful in building a 3D animation in game programming with a limited set of 3D objects.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.6
• /
• pp.653-663
• /
• 2012

The study considers the high maneuverability flight and path optimization is conducted to investigate the appropriate generation of the lift and thrust considering the angle of the stroke plane. The path optimization problem is defined according to the various purposes of the high maneuverability flight. The flying purposes are to maximize thrust force, lift force and both lift and thrust forces. The flapping motion of the airfoil is made by a combined sinusoidal plunging and pitching motion in each problem. The optimization process is carried out by using well-defined surrogate models. The surrogate model is determined by the results of two-dimensional computational fluid dynamics analysis. The Kriging method is used to make the surrogate model and a genetic algorithm is utilized to optimize the surrogate model. The optimization results show the flapping motions for the high maneuverable flight. The effects on the generation of lift and thrust forces are confirmed by analyzing the vortex.

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

Iterative algorithms for detecting the collision of convex objects whose motion is characterized by a path in configuration space are described. They use as an essential substep the computation of the distance between the two objects. When the objects are polytopes in either two or three dimensional space, an algorithm is given which terminates in a finite number of iterations. It determines either that no collision occurs or the first collision point on the path. Extensive numerical experiments for practical problems show that the computational time is short and grows only linearly in the total number of vertices of the two polytopes.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1996.04a
• /
• pp.383-387
• /
• 1996

This paper presents a steering control strategy applicable to vehicle path following problems. This control strategy is based on realistic nonlinear equations of motion of multibody systems described in terms of relative joint coordinates. The acceleration of the steering angle is selected as a control input of the system. This input is obtained by considering position and slope errors at current and at advance times. This steering control strategy is tested in circular and lane change maneuvers with a nonlinear vehicle model.

• The Journal of Korean Academy of Prosthodontics
• /
• v.25 no.1
• /
• pp.119-135
• /
• 1987

For the determination of instantaneous centre of rotation in the mandibular movement, the habitual opening path was recorded on the sagittal tracing plate by a Gnathorecorder attached on the lower anterior teeth which was designed for this study. The opening path was demonstrated mathematically and the instantaneous centre of rotation in the opening path were calculated and plotted by computer programs, and then a computer graphic movement of the mandible was obtained according to the opening path. The hinge path of posterior border movement was graphied by the Gnathorecorder as well and demonstated mathematically. This hinge path was compared with the same obtained by Visitrainer to prove a reliability of the Gnathorecorder. The results obtained from this study were as follows. 1. The habitual opening path and hinge path obtained from the Gnathorecorder movement were expressed mathematically as follows: $y=0.11x^2-0.66x+3.09$ (equation of opening path), $y=0.04x^2+0.21x+3.71$ (equation of hinge path), and a kinematic hinge axis was not shown in the equation of kings path. 2. The early habitual opening movement of the mandible demonstrated almost a straight opening path or an arc motion with the larger radius and it's centre of rotation moved parallelly in the more rear and lower position than a kinematic hinge axis. 3. Instantaneous centre of rotation occured along with the translation of the condyle, and mandible was rotated around an axis in the close to the maximum opening and then moved toward the forward and upward position. 4. There were some similarities between the articular eminence and the movement pattern of a special point which was the kinematic hinge axis.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.9
• /
• pp.891-897
• /
• 2010

This paper proposes a cooperative control algorithm for a dual-arms robot which is carrying an object to the desired location. When the dual-arms robot is carrying an object from the start to the goal point, the optimal path in terms of safety, energy, and time needs to be selected among the numerous possible paths. In order to quantify the carrying efficiency of dual-arms, DAMM (Dual Arm Manipulability Measure) has been defined and applied for the decision of the optimal path. The DAMM is defined as the intersection of the manipulability ellipsoids of the dual-arms, while the manipulability measure indicates a relationship between the joint velocity and the Cartesian velocity for each arm. The cost function for achieving the optimal path is defined as the summation of the distance to the goal and inverse of this DAMM, which aims to generate the efficient motion to the goal. It is confirmed that the optimal path planning keeps higher manipulability through the short distance path by using computer simulation. To show the effectiveness of this cooperative control algorithm experimentally, a 5-DOF dual-arm robot with distributed controllers for synchronization control has been developed and used for the experiments.

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

Path planning is an important task for optimal motion of a robot in structured or unstructured environment. The goal of this paper is to plan the optimal collision-free path in 3D, when a robot is navigated to pick up some tools or to repair some parts from various locations. To accomplish the goal, the Path Coordinator is proposed to have the capabilities of an obstacle avoidance strategy and a traveling salesman problem strategy (TSP). The obstacle avoidance strategy is to plan the shortest collision-free path between each pair of n locations in 2D or in 3D. The TSP strategy is to compute a minimal system cost of a tour that is defined as a closed path navigating each location exactly once. The TSP strategy can be implemented by the Hopfield Network. The obstacle avoidance strategy in 2D can be implemented by the VGraph Algorithm. However, the VGraph Algorithm is not useful in 3D, because it can't compute the global optimality in 3D. Thus, the Path Coordinator is used to solve this problem, having the capabilities of selecting the optimal edges by the modified Genetic Algorithm and computing the optimal nodes along the optimal edges by the Recursive Compensation Algorithm.

• Communications of the Korean Mathematical Society
• /
• v.17 no.1
• /
• pp.81-93
• /
• 2002

We consider the Hausdorff measure for Brownian motion(BM) in ι$_2$. Several path properties of BM in ι$_2$ are used to show the upper bound of Hausdorff measure. We also show the lower bound of it applying a law of iterated logarithm for the occupation time of BM in ι$_2$.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.8
• /
• pp.893-898
• /
• 1988

This paper presents the recent findings for collision avoidance of two manipulators in terms of motion level modifications. The collision situation we assume here is that the prespecified final time Kf and the prespecified path of one robot can be modified for the purpose of collision avoidance with the other robot. The collision avoidance problem is resolved into three independent categories for a systematic approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.98-102
• /
• 1988

A simple look and move type navigation algorithm with obstacle avoidance was implemented on a mobile robot equipped with two cameras. The robot gets a difference of two images from each camera and detects the position represented on the horizontal line and width of each obstacle in a certain distance. The obtained informations of obstacles are used to select a next intermediate point and to plan a path to it. Robot motion is simplified to straight line motion and rotation.