• 제목/요약/키워드: nonlinear Lagrangian algorithm

검색결과 42건 처리시간 0.023초

반복하중을 받는 철근콘크리트 기둥부재의 재료 및 기하적인 비선형 해석 (Material and Geometrical Noninear Analysis of Reinforced Concrete Columns under Cyclic Loading)

  • 김운학
    • 한국지진공학회논문집
    • /
    • 제3권1호
    • /
    • pp.55-66
    • /
    • 1999
  • 이연구에서는 반복적인 횡하중이 작용하고 있는 철근콘크리트 기둥의 비선형 이력거동 및 파괴거동을 해석적으로 예측할 수 있는 기법을 제시하였다 하중의 단계에 따라 수반하게 되는 콘크리트의 균일 및 철근의 항복 이로 인한 부착 효과와 골재의 맞물림 현상 및 강도의 감소 등과 같은 특성을 고려한 재료적 비선형성을 고려하였고 기둥부재에 일반적으로 배치되는 구속철근으로 인한 강도의 증가효과를 고려하였다. 여기서 철근콘크리트의 응력-변형도 관계는 분산균열모델에 기초하여 평균값으로 표현된다. 비교적 큰 압축하중과 함께 지진하중과 같이 큰 규모의 횡하중으로 인한 대변위 문제를 고려할 수 있도록 total Lagrangian formulation에 의한 기하학적인 비선형성을 고려하였다. 본 연구에서 작성한 유한요소 해석 프로그램에 의한 결과를 다른 연구자의 실험 결과와 비교함으로써 본 연구에서 제시한 해석기법의 타당성을 검증하였다.

  • PDF

3차원 비선형 자유표면 유동의 수치해석 (A Numerical Simulation of Three- Dimensional Nonlinear Free surface Flows)

  • 강창구;공인영
    • 대한조선학회논문집
    • /
    • 제28권1호
    • /
    • pp.38-52
    • /
    • 1991
  • 자유표면하에서 움직이는 임의의 형상의 3차원 물체로 인한 비선형 유체력을 준 Lagrangian 방법을 사용하여 해석하였다. 경계치 문제는 경계 적분 방법(Boundary Integral Method)을 이용하여 해결하였으며, 물체와 자유 표면의 형상은 곡면 Panel로 표현하였다. 이들 표면은 hi-cubic B-spline 방법을 사용하여 유한개의 작은 표면 요소로 나뉘어지게 되며, 또한 \phi와 (equation omitted) 표면 요소상에서 bi-linear하다고 가정한다. 특이점에 의한 유기 포텐시얼의 계산시 1/R에 비례하는 부분은 제거하고 해석적으로 처리하였다. 물체로부터 멀리 떨어진 곳에서의 유체 유통은 좌표계의 원점에 위치한 Dipole로 표현하였으며, Time Stepping시 Runge-Kutta의 4차 방법을 사용하였다. 3차원인 경우에 대한 적분 방정식과 포텐시얼의 시간 미분간에 대한 경계 조건이 유도되었으며, 이러한 식들을 사용하여 자유표면의 형상과 물체의 운동을 동시에 계산하였다. 대진폭을 가지고 규칙적으로 진동하는 물체에 작용하는 힘과 이때의 자유 표면 형상을 계산하고 기 발표된 자료와 비교하여 보았으며, 자유표면 근처에서 운동하는 물체에 작용하는 비선형 효과를 관찰하였다.

  • PDF

Energy efficiency task scheduling for battery level-aware mobile edge computing in heterogeneous networks

  • Xie, Zhigang;Song, Xin;Cao, Jing;Xu, Siyang
    • ETRI Journal
    • /
    • 제44권5호
    • /
    • pp.746-758
    • /
    • 2022
  • This paper focuses on a mobile edge-computing-enabled heterogeneous network. A battery level-aware task-scheduling framework is proposed to improve the energy efficiency and prolong the operating hours of battery-powered mobile devices. The formulated optimization problem is a typical mixed-integer nonlinear programming problem. To solve this nondeterministic polynomial (NP)-hard problem, a decomposition-based task-scheduling algorithm is proposed. Using an alternating optimization technology, the original problem is divided into three subproblems. In the outer loop, task offloading decisions are yielded using a pruning search algorithm for the task offloading subproblem. In the inner loop, closed-form solutions for computational resource allocation subproblems are derived using the Lagrangian multiplier method. Then, it is proven that the transmitted power-allocation subproblem is a unimodal problem; this subproblem is solved using a gradient-based bisection search algorithm. The simulation results demonstrate that the proposed framework achieves better energy efficiency than other frameworks. Additionally, the impact of the battery level-aware scheme on the operating hours of battery-powered mobile devices is also investigated.

Circuit-Switched “Network Capacity” under QoS Constraints

  • Wieselthier, Jeffrey E.;Nguyen, Gam D.;Ephremides, Anthony
    • Journal of Communications and Networks
    • /
    • 제4권3호
    • /
    • pp.230-245
    • /
    • 2002
  • Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

선박속력 및 급유결정 문제에 대한 휴리스틱 알고리즘 (A Heuristic Algorithm for a Ship Speed and Bunkering Decision Problem)

  • 김화중;김재곤
    • 산업경영시스템학회지
    • /
    • 제39권2호
    • /
    • pp.19-27
    • /
    • 2016
  • Maritime transport is now regarded as one of the main contributors to global climate change by virtue of its $CO_2$ emissions. Meanwhile, slow steaming, i.e., slower ship speed, has become a common practice in the maritime industry so as to lower $CO_2$ emissions and reduce bunker fuel consumption. The practice raised various operational decision issues in terms of shipping companies: how much ship speed is, how much to bunker the fuel, and at which port to bunker. In this context, this study addresses an operation problem in a shipping companies, which is the problem of determining the ship speed, bunkering ports, and bunkering amount at the ports over a given ship route to minimize the bunker fuel and ship time costs as well as the carbon tax which is a regulatory measure aiming at reducing $CO_2$ emissions. The ship time cost is included in the problem because slow steaming increases transit times, which implies increased in-transit inventory costs in terms of shippers. We formulate the problem as a nonlinear lot-sizing model and suggest a Lagrangian heuristic to solve the problem. The performance of the heuristic algorithm is evaluated using the data obtained from reliable sources. Although the problem is an operational problem, the heuristic algorithm is used to address various strategic issues facing shipping companies, including the effects of bunker prices, carbon taxes, and ship time costs on the ship speed, bunkering amount and number of bunkering ports. For this, we conduct sensitivity analyses of these factors and finally discuss study findings.

Estimation algorithms of the model parameters of robotic manipulators

  • Ha, In-Joong;Ko, Myoung-Sam;Kwon, Seok-Ki
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
    • /
    • pp.932-938
    • /
    • 1987
  • The dynamic equations of robotic manipulators can be derived from either Newton-Euler equation or Lagrangian equation. Model parameters which appear in the resulting dynamic equation are the nonlinear functions of both the inertial parameters and the geometric parameters of robotic manipulators. The identification of the model parameters is important for advanced robot control. In the previous methods for the identification of the model parameters, the geometric parameters are required to be predetermined, or the robotic manipulators are required to follow some special motions. In this paper, we propose an approach to the identification of the model parameters, in which prior knowledge of the geometric parameters is not necessary. We show that the estimation equation for the model parameters can be formulated in an upper block triangular form. Utilizing the special structures, we obtain a simplified least-square estimation algorithm for the model parameter identification. To illustrate the practical use of our method, a 4DOF SCARA robot is examined.

  • PDF

2 자유도 병렬 메니퓰레이터의 동적 모델링 (Dynamic Modeling of 2 DOF Parallel Manipulator)

  • 이종규;이상룡;이춘영;양승한
    • 한국정밀공학회지
    • /
    • 제31권10호
    • /
    • pp.897-904
    • /
    • 2014
  • In this paper, two-DOF parallel manipulator has the sliders which execute a linear reciprocating motion depending on parallel guides and the end-effector which can be adjusted arbitrarily. To investigate the dynamic characteristics of the manipulator, the dynamic performance index is used. The index is able to be obtained by the relation between the Jacobian matrix and the inertia matrix. The kinematic and the dynamic analysis find these matrices. Also, the dynamic model of the manipulator is derived from the Lagrange formula. This model represents complicated nonlinear equations of motion. With the simulation results of the dynamic characteristic of the manipulator, we find that the dynamic performance index is based on the selection of the ranges for the continuous movement of the manipulator and the dynamic model derived can be used to the control algorithm development of the manipulator.

매입형 영구자석 동기전동기의 T-S 퍼지 모델링 (A T-S Fuzzy Identification of Interior Permanent Magnet Synchronous)

  • 왕법광;김민찬;김현우;박승규;윤태성;곽군평
    • 한국정밀공학회지
    • /
    • 제28권4호
    • /
    • pp.391-397
    • /
    • 2011
  • Control of interior permanent magnet (IPMSM) is difficult because its nonlinearity and parameter uncertainty. In this paper, a fuzzy c-regression models clustering algorithm which is based on T-S fuzzy is used to model IPMSM with a series linear model and weight them by memberships. Lagrangian of constrained function is built for calculating clustering centers where training output data are considered. Based on these clustering centers, least square method is applied for T-S fuzzy linear model parameters. As a result, IPMSM can be modeled as T-S fuzzy model for T-S fuzzy control of them.

Optimization approach applied to nonlinear analysis of raft-pile foundations

  • Tandjiria, V.;Valliappan, S.;Khalili, N.
    • Structural Engineering and Mechanics
    • /
    • 제7권6호
    • /
    • pp.533-550
    • /
    • 1999
  • Optimal design of raft-pile foundations is examined by combining finite element technique and the optimization approach. The piles and soil medium are modeled by three dimensional solid elements while the raft is modelled by shell elements. Drucker-Prager criterion is adopted for the soil medium while the raft and the piles are assumed to be linear elastic. For the optimization process, the approximate semi-analytical method is used for calculating constraint sensitivities and a constraint approximation method which is a combination of the extended Bi-point approximation and Lagrangian polynomial approximation is used for predicting the behaviour of the constraints. The objective function of the problem is the volume of materials of the foundation while the design variables are raft thickness, pile length and pile spacing. The generalized reduced gradient algorithm is chosen for solving the optimization process. It is demonstrated that the method proposed in this study is promising for obtaining optimal design of raft-pile foundations without carrying out a large number of analyses. The results are also compared with those obtained from the previous study in which linear analysis was carried out.

합리적인 터널설계정수 산정을 위한 역해석 프로그램 개발 (Development of a back analysis program for reasonable derivation of tunnel design parameters)

  • 김영준;이용주
    • 한국터널지하공간학회 논문집
    • /
    • 제15권3호
    • /
    • pp.357-373
    • /
    • 2013
  • 본 논문에서는 터널-지반 시스템의 거동을 합리적으로 해석하고 재료의 특성과 터널설계정수 평가를 위한 역해석 프로그램을 개발하였다. 이 프로그램은 유한차분법과 직접법을 조합한 역해석 기법을 이용하기 위하여 상용 프로그램인 FLAC(Fast Lagrangian Analysis of Continua)과 최적화 알고리즘을 이용하여 지하구조물의 역해석이 가능하도록 구성되었다. 역해석 알고리즘으로는 최적화 기법 중 미분계수를 구하지 않고 직접탐색이 가능한 로젠브록법(Rosenbrock Method)을 이용하였다. 이 연구를 통하여 개발된 역해석 알고리즘의 현장 적용성 검증을 위하여 4개 구간의 실제현장을 대상으로 현장 계측결과를 이용하여 역해석을 수행하였다. 역해석 과정에서 현장계측 변위에 대한 해석 대상지반의 최적함수를 파악하기 위하여 비선형 회귀분석(nonlinear regression analysis)을 실시하였다. 회귀분석은 지수함수와 분수함수를 이용하였으며, 이를 통하여 결정된 최적함수를 이용하여 계산된 총 변위를 역해석 입력 자료로 활용하였다. 이 연구결과로써 대상구조체의 실측변위를 이용한 역해석을 수행한 결과는 계측변위와 평균 4.5%의 오차율을 보였다. 따라서 이 연구에서 제안하는 역해석 기법이 터널 해석에 유용하게 적용될 수 있음을 알 수 있었다.