• Title/Summary/Keyword: Lagrange points

Search Result 44, Processing Time 0.03 seconds

EXPONENTIAL DECAY OF $C^1$ LAGRANGE POLYNOMIAL SPLINES WITH RESPECT TO THE LOCAL CHEBYSHEV-GAUSS POINTS

  • Shin, Byeong-Chun;Song, Ho-Wan
    • Communications of the Korean Mathematical Society
    • /
    • v.16 no.1
    • /
    • pp.153-161
    • /
    • 2001
  • In the course of working on the preconditioning $C^1$ polynomial spline collocation method, one has to deal with the exponential decay of $C^1$ Lagrange polynomial splines. In this paper we show the exponential decay of $C^1$ Lagrange polynomial splines using the Chebyshev-Gauss points as the local data points.

  • PDF

Preliminary Analysis on Launch Opportunities for Sun-Earth Lagrange Points Mission from NARO Space Center

  • Song, Young-Joo;Lee, Donghun
    • Journal of Astronomy and Space Sciences
    • /
    • v.38 no.2
    • /
    • pp.145-155
    • /
    • 2021
  • In this work, preliminary launch opportunities from NARO Space Center to the Sun-Earth Lagrange point are analyzed. Among five different Sun-Earth Lagrange points, L1 and L2 points are selected as suitable candidates for, respectively, solar and astrophysics missions. With high fidelity dynamics models, the L1 and L2 point targeting problem is formulated regarding the location of NARO Space Center and relevant Target Interface Point (TIP) for each different launch date is derived including launch injection energy per unit mass (C3), Right ascension of the injection orbit Apoapsis Vector (RAV) and Declination of the injection orbit Apoapsis Vector (DAV). Potential launch periods to achieve L1 and L2 transfer trajectory are also investigated regarding coasting characteristics from NARO Space Center. The magnitude of the Lagrange Orbit Insertion (LOI) burn, as well as the Orbit Maintenance (OM) maneuver to maintain more than one year of mission orbit around the Lagrange points, is also derived as an example. Even the current work has been made under many assumptions as there are no specific mission goals currently defined yet, so results from the current work could be a good starting point to extend diversities of future Korean deep-space missions.

The Container Pose Measurement Using Computer Vision (컴퓨터 비젼을 이용한 컨테이너 자세 측정)

  • 주기세
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.3
    • /
    • pp.702-707
    • /
    • 2004
  • This article is concerned with container pose estimation using CCD a camera and a range sensor. In particular, the issues of characteristic point extraction and image noise reduction are described. The Euler-Lagrange equation for gaussian and random noise reduction is introduced. The alternating direction implicit(ADI) method for solving Euler-Lagrange equation based on partial differential equation(PDE) is applied. The vertex points as characteristic points of a container and a spreader are founded using k order curvature calculation algorithm since the golden and the bisection section algorithm can't solve the local minimum and maximum problems. The proposed algorithm in image preprocess is effective in image denoise. Furthermore, this proposed system using a camera and a range sensor is very low price since the previous system can be used without reconstruction.

COMMUNICATIONS SATELLITE SYSTEM BY USING MOON ORBIT SATELLITE CONSTELLATION

  • Lee, Sang-Uk;Kim, Jae-Hoon;Lee, Seong-Pal
    • Journal of Astronomy and Space Sciences
    • /
    • v.20 no.4
    • /
    • pp.313-318
    • /
    • 2003
  • A communications satellite system placed in three-Lagrange points, $L_3$, $L_4$ and $L_5$, of the restricted three-body problem in Earth-Moon system is proposed in this paper. LEO satellite constellation has been another choice of communications system. The proposed system which is alternatives of limited geostationary orbit resources, has some weak points such as long distance from the Earth, relatively expensive launch cost, long delay time, more required power, and so on. It has good points like less efforts (fuel) for station keeping, less eclipses, etc. This system has limitations for applications to provide commercial services but it is still some attractive points.

Blast Analysis and Damage Evaluation for Reinforced Concrete Building Structures (RC Building 구조물의 폭발해석 및 손상평가)

  • Park, Yang Heum;Yun, Sung-Hwan;Jang, Il Young
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.41 no.4
    • /
    • pp.331-340
    • /
    • 2021
  • The blast damage behavior of reinforced concrete (RC) structures exposed to unexpected extreme loading was investigated. To enhance the accuracy of numerical simulation for blast loading on RC structures with seven blast points, the calculation of blast loads using the Euler-flux-corrected-transport method, the proposed Euler-Lagrange coupling method for fluid-structure interaction, and the concrete dynamic damage constitutive model including the strain rate-dependent strength and failure models was implemented in the ANSYS-AUTODYN solver. In the analysis results, in the case of 20 kg TNT, only the slab member at three blast points showed moderate and light damage. In the case of 100 kg TNT, the slab and girder members at three blast points showed moderate damage, while the slab member at two blast points showed severe damage.

Trajectory Planning for Torque Minimization of Robot Manipulators Using the Lagrange Interpolation Method (라그랑지 보간법을 이용한 로봇 매니퓰레이터의 토크 최소화를 위한 궤적계획)

  • Luo, Lu-Ping;Hwang, Soon-Woong;Han, Chang-Soo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.4
    • /
    • pp.2370-2378
    • /
    • 2015
  • This paper proposes an algorithm using Lagrange interpolation method to realize trajectory planning for torque minimization of robot manipulators. For the algorithm, position constraints of robot manipulators should be given and the stability of robot manipulators should be satisfied. In order to avoid Runge's phenomenon, we set up time interpolation points using Chebyshev interpolation points. After that, we found suitable angle which corresponds to the points and then we got trajectories of joint's angle, velocity, acceleration using Lagrange interpolation method. We selected performance index for torque consumption optimization of robot manipulator. The method went through repetitive computation process to have minimum value of the performance index by calculated trajectory. Through the process, we could get optimized trajectory to minimize torque and performance index and guarantee safety of the motion for manipulator performance.

Modal Synthesis Method Using Interpolated Rotational DOF (회전자유도 보간에 의한 모드합성법)

  • 장경진;지태한;박영필
    • Journal of KSNVE
    • /
    • v.5 no.4
    • /
    • pp.503-514
    • /
    • 1995
  • In the case of performing experimental modal analysis(EMA) and finite- element analysis(EFA) for a whole structure of automotive body that is composed of many complex parts, a trouble may arise from the calculation time, the capacity of memory in computers and the experimental conditions, etc. In this paper, for the vibrational analysis of automotive body model, the efficient modal synthesis method by means of dividing the whole structure into two parts and performing EMA and FEA for each part is studied. In addition, the method based on Lagrange interpolation is proposed for approximating rotational degrees-of-freedom information and linking FEA with EMA. In result, by measuring translational degrees-of-freedom information of only few points and adopting only few modes, the linking method based on Lagrange interpolation turned out to be efficient and accurate in the low frequency range.

  • PDF

MULTI-DEGREE REDUCTION OF BÉZIER CURVES WITH CONSTRAINTS OF ENDPOINTS USING LAGRANGE MULTIPLIERS

  • Sunwoo, Hasik
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.29 no.2
    • /
    • pp.267-281
    • /
    • 2016
  • In this paper, we consider multi-degree reduction of $B{\acute{e}}zier$ curves with continuity of any (r, s) order with respect to $L_2$ norm. With help of matrix theory about generalized inverses we can use Lagrange multipliers to obtain the degree reduction matrix in a very simple form as well as the degree reduced control points. Also error analysis comparing with the least squares degree reduction without constraints is given. The advantage of our method is that the relationship between the optimal multi-degree reductions with and without constraints of continuity can be derived explicitly.

Shape Design of Frame Structures for Vibration Suppression and Weight Reduction

  • Hase, Miyahito;Ikeda, Masao
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2246-2251
    • /
    • 2003
  • This paper proposes shape design of frame structures for vibration suppression and weight reduction. The $H_{\infty}$ norm of the transfer function from disturbance sources to the output points where vibration should be suppressed, is adopted as the performance index to represent the magnitude of vibration transfer. The design parameters are the node positions of the frame structure, on which constraints are imposed so that the structure achieves given tasks. For computation of Pareto optimal solutions to the two-objective design problem, a number of linear combinations of the $H_{\infty}$ norm and the total weight of the structure are considered and minimized. For minimization of the scalared objective function, a Lagrange function is defined by the objective function and the imposed constraints on the design parameters. The solution for which the Lagrange function satisfies the Karush-Kuhn-Tucker condition, is searched by the sequential quadratic programming (SQP) method. Numerical examples are presented to demonstrate the effectiveness of the proposed design method.

  • PDF

Generalized Computational Nodes for Pseudospectral Methods

  • Kim, Chang-Joo;Park, Soo Hyung;Jung, Sung-Nam;Sung, Sangkyung
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.15 no.2
    • /
    • pp.183-189
    • /
    • 2014
  • Pseudo-spectral method typically converges at an exponential rate. However, it requires a special set of fixed collocation points (CPs) to get highly accurate formulas for partial integration and differentiation. In this study, computational nodes for defining the discrete variables of states and controls are built independently of the CPs. The state and control variables at each CP, which are required to transcribe an NOCP into the corresponding NLP, are interpolated, using those variables allocated at each node. Additionally, Lagrange interpolation and spline interpolation are investigated, to provide a guideline for selecting a favorable interpolation method. The proposed techniques are applied to the solution of an NOCP using equally spaced nodes, and the computed results are compared to those using the standard PS approach, to validate the usefulness of the proposed methods.