• Title/Summary/Keyword: Path integral

Search Result 120, Processing Time 0.026 seconds

Optimal Path Finding Considering Smart Card Terminal ID Chain OD - Focused on Seoul Metropolitan Railway Network - (교통카드 단말기ID Chain OD를 반영한 최적경로탐색 - 수도권 철도 네트워크를 중심으로 -)

  • Lee, Mee Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.6
    • /
    • pp.40-53
    • /
    • 2018
  • In smart card data, movement of railway passengers appears in order of smart card terminal ID. The initial terminal ID holds information on the entering station's tag-in railway line, the final terminal ID the exit station tag-out railway line, and the middle terminal ID the transfer station tag subway line. During the past, when the metropolitan city rail consisted of three public corporations (Seoul Metro, Incheon Transit Corporation, and Korail), OD data was expressed in two metrics of initial and final smart card terminal ID. Recently, with the entrance of private corporations like Shinbundang Railroad Corporation, and UI Corporation, inclusion of entering transfer line terminal ID and exiting transfer line terminal ID as part of Chain OD has become standard. Exact route construction using Chain OD has thus become integral as basic data for revenue allocation amongst metropolitan railway transport corporations. Accordingly, path detection in railway networks has evolved to an optimal path detection problem using Chain OD, hence calling for a renewed solution method. This research proposes an optimal path detection method between the initial terminal ID and final terminal ID of Chain OD terminal IDs within the railway network. Here, private line transfer TagIn/Out must be reflected in optimal path detection using Chain OD. To achieve this, three types of link-based optimum path detection methods are applied in order of 1. node-link, 2. link-link, 3. link-node. The method proposed based on additional path costs is shown to satisfy the optimal conditions.

Development of Autonomous Algorithm for Boat Using Robot Operating System (로봇운영체제를 이용한 보트의 자율운항 알고리즘 개발)

  • Jo, Hyun-Jae;Kim, Jung-Hyeon;Kim, Su-Rim;Woo, Ju-Hyun;Park, Jong-Yong
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.58 no.2
    • /
    • pp.121-128
    • /
    • 2021
  • According to the increasing interest and demand for the Autonomous Surface Vessels (ASV), the autonomous navigation system is being developed such as obstacle detection, avoidance, and path planning. In general, autonomous navigation algorithm controls the ship by detecting the obstacles with various sensors and planning path for collision avoidance. This study aims to construct and prove autonomous algorithm with integrated various sensor using the Robot Operating System (ROS). In this study, the safety zone technique was used to avoid obstacles. The safety zone was selected by an algorithm to determine an obstacle-free area using 2D LiDAR. Then, drift angle of the ship was controlled by the propulsion difference of the port and starboard side that based on PID control. The algorithm performance was verified by participating in the 2020 Korea Autonomous BOAT (KABOAT).

A SNOWBALL CURRENCY OPTION

  • Shim, Gyoo-Cheol
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.15 no.1
    • /
    • pp.31-41
    • /
    • 2011
  • I introduce a derivative called "Snowball Currency Option" or "USDKRWSnowball Extendible At Expiry KO" which was traded once in the over-the-counter market in Korea. A snowball currency option consists of a series of maturities the payoffs at which are like those of a long position in a put option and two short position in an otherwise identical call. The strike price at each maturity depends on the exchange rate and the previous strike price so that the strike prices are random and path-dependent, which makes it difficult to find a closed form solution of the value of a snowball currency option. I analyze the payoff structure of a snowball currency option and derive an upper and a lower boundaries of the value of it in a simplified model. Furthermore, I derive a pricing formula using integral in the simplified model.

Using DSP Algorithms for CRC in a CAN Controller

  • Juan, Ronnie O. Serfa;Kim, Hi Seok
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.5 no.1
    • /
    • pp.29-34
    • /
    • 2016
  • A controller area network (CAN) controller is an integral part of an electronic control unit, particularly in an advanced driver assistance system application, and its characteristics should always be advantageous in all aspects of functionality especially in real time application. The cost should be low, while maintaining the functionality and reliability of the technology. However, a CAN protocol implementing serial operation results in slow throughput, especially in a cyclical redundancy checking (CRC) unit. In this paper, digital signal processing (DSP) algorithms are implemented, namely pipelining, unfolding, and retiming the CAN controller in the CRC unit, particularly for the encoder and decoder sections. It must attain a feasible iteration bound, a critical path that is appropriate for a CAN system, and must obtain a superior design of a high-speed parallel circuit for the CRC unit in order to have a faster transmission rate. The source code for the encoder and decoder was formulated in the Verilog hardware description language.

A Study on Development of ATCS for Automated Stacking Crane using Neural Network Predictive Control

  • Sohn, Dong-Seop;Kim, Sang-Ki;Min, Jeong-Tak;Lee, Jin-Woo;Lee, Kwon-Soon
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.346-349
    • /
    • 2003
  • For a traveling crane, various control methods such as neural network predictive control and TDOFPID(Two Degree of Freedom Proportional Integral Derivative) are studied. So in this paper, we proposed improved navigation method to reduce transfer time and sway with anti-collision path for avoiding collision in its movement to the finial coordinate. And we constructed the NNPPID(Neural Network Predictive PID) controller to control the precise move and speedy navigation. The proposed predictive control system is composed of the neural network predictor, TDOFPID controller, and neural network self-tuner. We analyzed ASC(Automated Stacking Crane) system and showed some computer simulations to prove excellence of the proposed controller than other conventional controllers.

  • PDF

Analysis of Stress Intensity Factors for Circular arc Cracks by Boundary Element Method (경계요소법에 의한 아크균열의 응력확대계수 해석)

  • 백열선;이장규;우창기
    • Journal of the Korean Society of Safety
    • /
    • v.14 no.4
    • /
    • pp.28-36
    • /
    • 1999
  • In this paper, A circular arc crackered plate in biaxially stretched sheets was investigated in the boundary element method. The applications of fracture mechanics have traditionally concentrated on crack problems under an mode I, straight crack. However, many service failures occur from growth of cracks subjected to mixed mode loadings. A rectangular plate with arc crack or slanted central crack, under biaxial tensile loading, was treated analytically and also solved numerically. The Results from BEM applying different loading conditions, crack length (a/W), arc angle($\alpha$) are presented and discussed. The stress intensity factors are evaluated by the techniques of the J-integral. The decomposition method, used to decouple the stress intensity factors in mixed mode problems, is implemented by a considering a small circular contour path around each crack tip. The BIE method was successfully applied to a circular arc crackerd plate problem, also slanted centre cracked plate under mixed mode.

  • PDF

About fully polynomial approximability of the generalized knapsack problem

  • Hong, Sung-Pil;Park, Bum-Hwan
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.11a
    • /
    • pp.93-96
    • /
    • 2003
  • The generalized knapsack problem, or gknap is the combinatorial optimization problem of optimizing a nonnegative linear functional over the integral hull of the intersection of a polynomially separable 0 - 1 polytope and a knapsack constraint. Among many potential applications, the knapsack, the restricted shortest path, and the restricted spanning tree problem are such examples. We establish some necessary and sufficient conditions for a gknap to admit a fully polynomial approximation scheme, or FPTAS, To do so, we recapture the scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a condition that a gknap does not have an FP-TAS. This condition is more general than the strong NP-hardness.

  • PDF

A Study on the Application of Scheduling & Planning for Nuclear R &D Projects : Cas of LMR Project (원자력연구개발사업의 공정관리 적용 사례 연구)

  • 한도희
    • Journal of Korea Technology Innovation Society
    • /
    • v.2 no.3
    • /
    • pp.118-128
    • /
    • 1999
  • This study attempts to provide an efficient method for managing the Nuclear R&D projects. It should be noted that the technology and experiences to develop a well-balanced plan and mon-itoring for the R&D project are not yet well established when compared with the commercial con-structionand engineering projects. This study recommends that the R&D project manager utilize the scheduling techniques to establish an integral management system taking in to account the un-certainties in the research environment. Based upon the results of a case study for the Liquid Metal Reactor Design Technology Development Project which is led by the KAERI this study also con-firms that it is possible to run the national nuclear R&D projects with the Scheduling & Planning.

  • PDF

About fully Polynomial Approximability of the Generalized Knapsack Problem (일반배낭문제의 완전다항시간근사해법군의 존재조건)

  • 홍성필;박범환
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.4
    • /
    • pp.191-198
    • /
    • 2003
  • The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a nonnegative linear function over the integral hull of the intersection of a polynomially separable 0-1 polytope and a knapsack constraint. The knapsack, the restricted shortest path, and the constrained spanning tree problem are a partial list of gknap. More interesting1y, all the problem that are known to have a fully polynomial approximation scheme, or FPTAS are gknap. We establish some necessary and sufficient conditions for a gknap to admit an FPTAS. To do so, we recapture the standard scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a weaker sufficient condition than the strong NP-hardness that a gknap does not have an FPTAS. Finally, we apply the conditions to explore the fully polynomial approximability of the constrained spanning problem whose fully polynomial approximability is still open.

Flux Linkage Calculation for 3-D Finite Element Analysis

  • Im, Chang-Hwan;Jung, Hyun-Kyo;Kim, Hong-Kyu
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • v.12B no.1
    • /
    • pp.13-18
    • /
    • 2002
  • Novel method to calculate flux linkage for 3-D finite element analysis is proposed. It does not require any integral path if the current direction in a coil is known. The flux linkage can be calculated very easily using simple volume based integration. The current direction is calculated based on the recently developed technique by the authors. The novel method for flux linkage calculation is verified by applying to a very complicated deflection yoke coil. The simulation result is compared to the experimental one. From the simulation, it is shown that the proposed method is very accurate and effective to calculate the flux linkage of a coil.