• Journal of Astronomy and Space Sciences
• /
• v.22 no.3
• /
• pp.249-262
• /
• 2005

Optimization problems are formulated to calculate optimal impulses for deflecting Earth-Crossing Objects using a Nonlinear Programming. This formulation allows us to analyze the velocity changes in normal direction to the celestial body's orbital plane, which is neglected in many previous studies. The constrained optimization in the three-dimensional space is based on a patched conic method including the Earth's gravitational effects, and yields impulsive ${\Delta}V$ to deflect the target's orbit. The optimal solution is dependent on relative positions and velocities between the Earth and the Earth-crossing objects, and can be represented by optimal magnitude and angle of ${\Delta}V $ as a functions of a impulse time. The perpendicular component of ${\Delta}V $ to the orbit plane can sometimes play un-negligible role as the impulse time approaches the impact time. The optimal ${\Delta}V $ is increased when the original orbit of Earth-crossing object is more similar to the Earth's orbit, and is also exponentially increased as the impulse time reaches to the impact time. The analyses performed in present paper can be used to the deflection missions in the future.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.339-344
• /
• 2001

In recent engineering, the designer has become more and more dependent on the computer simulations such as FEM (Finite Element Method) and BEM (Boundary Element Method). In order to optimize such implicit models more efficiently and reliably, the meta-modeling technique has been developed for solving such a complex problems combined with the DACE (Design and Analysis of Computer Experiments). It is widely used for exploring the engineer's design space and for building meta-models in order to facilitate an effective solution of multi-objective and multi-disciplinary optimization problems. Optimization of a train suspension is performed according to the minimization of forty-six responses that represent ten ride comforts, twelve derailment quotients, twelve unloading ratios, and twelve stabilities by using the Kriging meta-model of a train suspension. After each Kriging meta-model is constructed, multi-objective optimal solutions are achieved by using a nonlinear programming method called SQP (Sequential Quadratic Programming).

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2002.04a
• /
• pp.398-403
• /
• 2002

We developed a Off-Line Graphic Simulator which can simulate a robot model in 3D graphics space in Windows 95 version. 4 axes SCARA robot was adopted as an objective model. Forward kinematics, inverse kinematics and robot dynamics modeling were included in the developed program. The interface between users and the off-line program system in the Windows 95's graphic user interface environment was also studied. The developing language is Microsoft Visual C++. Graphic libraries, OpenGL, by Silicon Graphics, Inc. were utilized for 3D graphics.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.04a
• /
• pp.310-316
• /
• 2004

In this paper, we developed a Windows XP version off-line programming system which can simulate a track vehicle model in 3D graphics space. The track vehicle was adopted as an objective model. The interface between users and the off-line program system in the Windows XP's graphic user interface environment was also studied. The developing language is Microsoft Visual C＋＋. Graphic libraries, OpenGL, by Silicon Graphics, Inc. were utilized for 3D Graphics.

• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.3
• /
• pp.249-256
• /
• 1999

The conventional robot manipulability is decomposed into linear manipulability and angular manipulability so that they may be analysed and visualized in easy way even in the case of 3 dimensional task space with 6 variables. After the Jacobian matrix is decomposed into linear part and angular part, constraint on joint velocities is transformed into linear task velocity and angular task velocity through the decomposed Jacobian matrices. Under the assumption of redundant robot manipulators, several optimization problems which utilize the redundancy are formulated to be solved by linear programming technique or sequential quadratic programming technique. After deriving the solutions of the optimization problems, we give graphical interpretations for the solutions.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.10 no.3
• /
• pp.19-25
• /
• 2001

In this paper, we developed a Windows 98 version Off-Line Programming System which can simulate a Robot model in 3D Graphics space. 4 axes SCARA Robot (especially FARA SM5) was adopted as an objective model. Forward kinemat-ics, inverse kinematics and robot dynamics modeling were included in the developed program. The interface between users and the OLP system in the Windows 98s GUI environment was also studied. The developing is Microsoft Visual C++. Graphic libraries, OpernGL, by silicon Graphics, Inc. were utilized for 3D Graphics.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.1133-1137
• /
• 1995

This paper presents a numerical method of the global search for an optimal geometric path for a manipulator arm amid obstacles. Finite term quintic B-splines are used to describe an arbitrary point-to-point manipulator motion with fixed moving time. The coefficients of the splines span a linear vector space, a point in which uniquely represents the manipulator motion. All feasible geometric paths are searched by adjusting the seed points of the obstacle models in the penetration growth distances. In the numerical implementation using nonlinear programming, the globally optimal geometric path is obtained for a spatial 3-link(3-revolute joints) manipulator amid several hexahedral obstacles without simplifying any dynamic or geometric models.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.13-46
• /
• 2001

SDP (Semidefinite Programming), as a sort of “cone-LP”, optimizes a linear function over the intersection of an affine space and a cone that has the origin as its apex. SDP, however, has been developed in the process of searching for better solution methods for NP-hard combinatorial optimization problems. We surveyed the basic theories necessary to understand SDP researches. First, We examined SDP duality, comparing it to LP duality, which is essential for the interior point method, Second, we showed that SDP can be optimized from an interior solution in polynomial time with a desired error limit. finally, we summarized several research papers that showed SDP can improve solution methods for some combinatorial optimization problems, and explained why SDP has become one of the most important research topics in optimization. We tried to integrate SDP theories. relatively diverse and complicated. to survey research papers with our own perspective, and thus to help researcher to pursue their SDP researches in depth.

• Journal of the Semiconductor & Display Technology
• /
• v.2 no.3
• /
• pp.25-30
• /
• 2003

In this study, the controller using TMS320LF2407 low voltage DSP for motor control is designed and realized. It has 40 MIPS calculating ability and its driving voltage is 3.3 V for low power. The peripheral elements, however usually use 5 V and they need voltage transfer interface. In this study, voltage transformation and reducing noise are studied and space vector PWM is adopted as a motor control scheme. According to these methods, the efforts for software programming and calculation processes are reduced. In addition, the hardware is also simplified by substituting the current control part with software programming. Through this study, the DSP based servo controller increases its ability for high performance multi-function on semiconductor transportation equipments..

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.11
• /
• pp.1110-1116
• /
• 2008

In this paper, we suggest GP operators based on tree structure considering tree distributions in structure space and structural difficulties. The main idea of the proposed genetic operators is to place generated offspring into the specific region which nodes and depths are balanced and most of solutions exist. To enable that, the proposed operators are designed to utilize region information where parents belong and node/depth rates of selected subtree. To demonstrate the effectiveness of our proposed approach, experiments of binomial-3 regression, multiplexer and even parity problem are executed. The experiments results show that the proposed operators based on tree structure is superior to the results of standard GP for all three test problems in both success rate and number of evaluations.