• 제목/요약/키워드: Partial Linearization Algorithm

검색결과 7건 처리시간 0.02초

다수단 가변수요 통행배정문제를 위한 부분선형화 알고리즘의 성능비교 (A Performance Comparison of the Partial Linearization Algorithm for the Multi-Mode Variable Demand Traffic Assignment Problem)

  • 박태형;이상건
    • 대한산업공학회지
    • /
    • 제39권4호
    • /
    • pp.253-259
    • /
    • 2013
  • Investment scenarios in the transportation network design problem usually contain installation or expansion of multi-mode transportation links. When one applies the mode choice analysis and traffic assignment sequentially for each investment scenario, it is possible that the travel impedance used in the mode choice analysis is different from the user equilibrium cost of the traffic assignment step. Therefore, to estimate the travel impedance and mode choice accurately, one needs to develop a combined model for the mode choice and traffic assignment. In this paper, we derive the inverse demand and the excess demand functions for the multi-mode multinomial logit mode choice function and develop a combined model for the multi-mode variable demand traffic assignment problem. Using data from the regional O/D and network data provided by the KTDB, we compared the performance of the partial linearization algorithm with the Frank-Wolfe algorithm applied to the excess demand model and with the sequential heuristic procedures.

일정 일반속력으로 구동되는 구속 다물체계의 선형화기법 및 진동해석 (Linearization Method and Vibration Analysis of a Constrained Multibody System Driven by Constant Generalized Speeds)

  • 최동환;박정훈;유홍희
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2001년도 추계학술대회논문집 II
    • /
    • pp.725-730
    • /
    • 2001
  • This paper presents a vibration analysis method for constrained mechanical systems driven by constant generalized speeds. Equilibrium positions are obtained first and vibration analysis are performed around the positions. The method developed in this paper employs partial velocity matrix to obtain a minimum number of differential equations. To verify the accuracy of the proposed algorithm, linear vibration analyses of two numerical examples are performed and the results are compared with results from a commercial program or previous literature.

  • PDF

네트워크 부하에 따른 부분 오프로딩 효과 분석 (Analysis of partial offloading effects according to network load)

  • 백재석;남광우;장민석;이연식
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2022년도 추계학술대회
    • /
    • pp.591-593
    • /
    • 2022
  • 본 논문은 FEC 환경에서 응용 서비스의 처리 지연시간 최소화를 위하여 선행연구 제안한 부분 오프로딩 시스템의 네트워크 부하에 따른 오프로딩의 효과를 분석한다. 모바일 장치와 FEC 서버 간의 2계층 협력 컴퓨팅 시스템으로 구성된 제안 시스템을 로컬 전용 및 에지 서버 전용 처리와 비교한다. 제안 시스템은 다중 분기구조의 재구성 선형화를 통한 부분 오프로딩 알고리즘[1]과 두 계층 간의 최적 협업 알고리즘[2]을 포함한다. 실험은 다중 분기구조의 DAG 토폴로지를 갖는 논리적 CNN 모델을 대상으로 계층 스케줄링을 적용하여 수행하였으며, 실험 결과 제안 시스템은 로컬이나 에지 전용 실행과 비교하여 항상 효율적인 작업 처리 전략 및 처리 지연시간을 제공함을 입증하였다.

  • PDF

공간적 가격균형이론에 의한 교통수요모형과 해법

  • 노정현
    • 대한교통학회지
    • /
    • 제6권2호
    • /
    • pp.7-20
    • /
    • 1988
  • Recent developments in combining transportation planning models and input-output approaches, together with inclusion of intensity of land uses, have made it possible to construct realistic comprehensive urban and regional activity models. These modes form the basis for a rigorous approach to studying the interactions among urban activities. However, efficient computational solution methods for implementing such comprehensive models are still not available. In this paper an efficient solution method for the urban activity model is developed by combining Evans' partial linearization technique with Powell's hybrid method. The solution algorithm is applied to a small but realistic urban area with a detailed transportation network.

  • PDF

FEC 환경에서 다중 분기구조의 부분 오프로딩 시스템 (Partial Offloading System of Multi-branch Structures in Fog/Edge Computing Environment)

  • 이연식;띵 웨이;남광우;장민석
    • 한국정보통신학회논문지
    • /
    • 제26권10호
    • /
    • pp.1551-1558
    • /
    • 2022
  • 본 논문에서는 FEC (Fog/Edge Computing) 환경에서 다중 분기구조의 부분 오프로딩을 위해 모바일 장치와 에지서버로 구성된 2계층 협력 컴퓨팅 시스템을 제안한다. 제안 시스템은 다중 분기구조에 대한 재구성 선형화 기법을 적용하여 응용 서비스 처리를 분할하는 알고리즘과 모바일 장치와 에지 서버 간의 부분 오프로딩을 통한 최적의 협업 알고리즘을 포함한다. 또한 계산 오프로딩 및 CNN 계층 스케줄링을 지연시간 최소화 문제로 공식화하고 시뮬레이션을 통해 제안 시스템의 효과를 분석한다. 실험 결과 제안 알고리즘은 DAG 및 체인 토폴로지 모두에 적합하고 다양한 네트워크 조건에 잘 적응할 수 있으며, 로컬이나 에지 전용 실행과 비교하여 효율적인 작업 처리 전략 및 처리시간을 제공한다. 또한 제안 시스템은 모바일 장치에서의 응용 서비스 최적 실행을 위한 모델의 경량화 및 에지 리소스 워크로드의 효율적 분배 관련 연구에 적용 가능하다.

A Time-Varying Gain Super-Twisting Algorithm to Drive a SPIM

  • Zaidi, Noureddaher;Jemli, Mohamed;Azza, Hechmi Ben;Boussak, Mohamed
    • Journal of Power Electronics
    • /
    • 제13권6호
    • /
    • pp.955-963
    • /
    • 2013
  • To acquire a performed and practical solution that is free from chattering, this study proposes the use of an adaptive super-twisting algorithm to drive a single-phase induction motor. Partial feedback linearization is applied before using a super-twisting algorithm to control the speed and stator currents. The load torque is considered an unknown but bounded disturbance. Therefore, a time-varying switching gain that does not require prior knowledge of the disturbance boundary is proposed. A simple sliding surface is formulated as the difference between the real and desired trajectories obtained from the indirect rotor flux oriented control strategy. To illustrate the effectiveness of the proposed control structure, an experimental setup around a digital signal processor (dS1104) is developed and several tests are performed.

Learning the Covariance Dynamics of a Large-Scale Environment for Informative Path Planning of Unmanned Aerial Vehicle Sensors

  • Park, Soo-Ho;Choi, Han-Lim;Roy, Nicholas;How, Jonathan P.
    • International Journal of Aeronautical and Space Sciences
    • /
    • 제11권4호
    • /
    • pp.326-337
    • /
    • 2010
  • This work addresses problems regarding trajectory planning for unmanned aerial vehicle sensors. Such sensors are used for taking measurements of large nonlinear systems. The sensor investigations presented here entails methods for improving estimations and predictions of large nonlinear systems. Thoroughly understanding the global system state typically requires probabilistic state estimation. Thus, in order to meet this requirement, the goal is to find trajectories such that the measurements along each trajectory minimize the expected error of the predicted state of the system. The considerable nonlinearity of the dynamics governing these systems necessitates the use of computationally costly Monte-Carlo estimation techniques, which are needed to update the state distribution over time. This computational burden renders planning to be infeasible since the search process must calculate the covariance of the posterior state estimate for each candidate path. To resolve this challenge, this work proposes to replace the computationally intensive numerical prediction process with an approximate covariance dynamics model learned using a nonlinear time-series regression. The use of autoregressive time-series featuring a regularized least squares algorithm facilitates the learning of accurate and efficient parametric models. The learned covariance dynamics are demonstrated to outperform other approximation strategies, such as linearization and partial ensemble propagation, when used for trajectory optimization, in terms of accuracy and speed, with examples of simplified weather forecasting.