• Title/Summary/Keyword: off-line algorithms

Search Result 79, Processing Time 0.026 seconds

A Study on Development of Bus Arrival Time Prediction Algorithm by using Travel Time Pattern Recognition (통행시간 패턴인식형 버스도착시간 예측 알고리즘 개발 연구)

  • Chang, Hyunho;Yoon, Byoungjo;Lee, Jinsoo
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.39 no.6
    • /
    • pp.833-839
    • /
    • 2019
  • Bus Information System (BIS) collects information related to the operation of buses and provides information to users through predictive algorithms. Method of predicting through recent information in same section reflects the traffic situation of the section, but cannot reflect the characteristics of the target line. The method of predicting the historical data at the same time zone is limited in forecasting peak time with high volatility of traffic flow. Therefore, we developed a pattern recognition bus arrival time prediction algorithm which could be overcome previous limitation. This method recognize the traffic pattern of target flow and select the most similar past traffic pattern. The results of this study were compared with the BIS arrival forecast information history of Seoul. RMSE of travel time between estimated and observed was approximately 35 seconds (40 seconds in BIS) at the off-peak time and 40 seconds (60 seconds in BIS) at the peak time. This means that there is data that can represent the current traffic situation in other time zones except for the same past time zone.

Robust Speed Control Scheme for Torsional Vibration Suppression of Two Mass System (이관성계 전동기 구동시스템의 축진동억제를 위한 강인한 속도제어기법)

  • 박태식;유지윤
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.8 no.1
    • /
    • pp.80-88
    • /
    • 2003
  • In this paper, the new robust torsional vibration suppression control scheme is proposed for the two mass system. A reduced order state feedback controller where the motor speed and the observed torsional torque are fed back and the PI controller are proposed as the torsional vibration suppression controller. Using the estimated mechanical parameters by off-line RLS(Recursive Least Square) algorithms, the speed controller for torsional vibration suppression is designed and its gains are determined using the Kharitonov robust control theory. The Kharitonov robust control theory can obtain the robust stability with a specified stability margin and a damping limit and the good performance of vibration suppression although if the parameters are varied within some specified limit. The effectiveness and usefulness of the proposed schemes are verified with the simulation and the experimental results on the fully-digitalized 5.5kW two mass system.

Dynamic Voltage Scaling (DVS) Considering the DC-DC Converter in Portable Embedded Systems (휴대용 내장형 시스템에서 DC-DC 변환기를 고려한 동적 전압 조절 (DVS) 기법)

  • Choi, Yong-Seok;Chang, Nae-Hyuck;Kim, Tae-Whan
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.2
    • /
    • pp.95-103
    • /
    • 2007
  • Dynamic voltage scaling (DVS) is a well-known and effective power management technique. While there has been research on slack distribution, voltage allocation and other aspects of DVS, its effects on non-voltage-scalable devices has hardly been considered. A DC-DC converter plays an important role in voltage generation and regulation in most embedded systems, and is an essential component in DVS-enabled systems that scale supply voltage dynamically. We introduce a power consumption model of DC-DC converters and analyze the energy consumption of the system including the DC-DC converter. We propose an energy-optimal off-line DVS scheduling algorithm for systems with DC-DC converters, and show experimentally that our algorithm outperforms existing DVS algorithms in terms of energy consumption.

Automatic Virtual Camera Control Using Motion Area (모션 면적을 이용한 버추얼 카메라의 자동 제어 기법)

  • Kwon, Ji-Yong;Lee, In-Kwon
    • Journal of the Korea Computer Graphics Society
    • /
    • v.14 no.2
    • /
    • pp.9-17
    • /
    • 2008
  • We propose a method to determine camera parameters for character motion, which confiders the motion by itself. The basic idea is to approximately compute the area swept by the motion of the character's links that are orthogonally projected onto the image plane, which we call "Motion Area". Using the motion area, we can determine good fixed camera parameters and camera paths for a given character motion in the off-line or real-time camera control. In our experimental results, we demonstrate that our camera path generation algorithms can compute a smooth moving camera path while the camera effectively displays the dynamic features of character motion. Our methods can be easily used in combination with the method for generating occlusion-free camera paths. We expect that our methods can also be utilized by the general camera planning method as one of heuristics for measuring the visual quality of the scenes that include dynamically moving characters.

  • PDF

Reinforcement Learning for Minimizing Tardiness and Set-Up Change in Parallel Machine Scheduling Problems for Profile Shops in Shipyard (조선소 병렬 기계 공정에서의 납기 지연 및 셋업 변경 최소화를 위한 강화학습 기반의 생산라인 투입순서 결정)

  • So-Hyun Nam;Young-In Cho;Jong Hun Woo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.60 no.3
    • /
    • pp.202-211
    • /
    • 2023
  • The profile shops in shipyards produce section steels required for block production of ships. Due to the limitations of shipyard's production capacity, a considerable amount of work is already outsourced. In addition, the need to improve the productivity of the profile shops is growing because the production volume is expected to increase due to the recent boom in the shipbuilding industry. In this study, a scheduling optimization was conducted for a parallel welding line of the profile process, with the aim of minimizing tardiness and the number of set-up changes as objective functions to achieve productivity improvements. In particular, this study applied a dynamic scheduling method to determine the job sequence considering variability of processing time. A Markov decision process model was proposed for the job sequence problem, considering the trade-off relationship between two objective functions. Deep reinforcement learning was also used to learn the optimal scheduling policy. The developed algorithm was evaluated by comparing its performance with priority rules (SSPT, ATCS, MDD, COVERT rule) in test scenarios constructed by the sampling data. As a result, the proposed scheduling algorithms outperformed than the priority rules in terms of set-up ratio, tardiness, and makespan.

Improvement of Bipolar Magnetic Guidance Sensor Performance using Fuzzy Inference System (양극성 자기유도센서의 성능 향상을 위한 퍼지 추론 시스템)

  • Park, Moonho;Cho, Hyunhak;Kim, Kwangbaek;Kim, Sungshin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.1
    • /
    • pp.58-63
    • /
    • 2014
  • Most of light duty AGVs(AGCs) using tape of magnetic for the guide path have digital guidance magnetic sensor. Digital guidance magnetic sensor using magnet-tape is on/off type and has positioning error of magnet-tape as 10~50 mm. AGC using this sensor doesn't induce accurate position of magnet-line which is magnet-tape because of magnetic field which motor in AGC creates, outer magnetic field, earth's magnetic field, etc. AGC when driving wobbles due to this error and this error can cause path deviation. In this paper, we propose fuzzy inference system for improvement of bipolar analog magnetic guidance sensor performance. Fuzzy is suitable in term of fault tolerance, uncertainty tolerance, real-time operation, and Nonlinearity as compared with other algorithms. In previous research, we produced bipolar magnetic guidance sensor and we set the threshold in order to calculate digital values of magnet position. Fuzzy inference system is designed using outputs of Analog hall sensors. Magnet position calculated by digital method is improved by outputs of this system. In result, proposed method was verified by improving performance of magnetic guidance sensor.

An Improved Online Algorithm to Minimize Total Error of the Imprecise Tasks with 0/1 Constraint (0/1 제약조건을 갖는 부정확한 태스크들의 총오류를 최소화시키기 위한 개선된 온라인 알고리즘)

  • Song, Gi-Hyeon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.10
    • /
    • pp.493-501
    • /
    • 2007
  • The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et at suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, the NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In NORA algorithm, EDF strategy is adopted in the optional scheduling. On the other hand, for the task system with 0/1 constraint, EDF_Scheduling may not be optimal in the sense that the total error is minimized. Furthermore, when the optional tasks are scheduled in the ascending order of their required processing times, NORA algorithm which EDF strategy is adopted may not produce minimum total error. Therefore, in this paper, an online algorithm is proposed to minimize total error for the imprecise task system with 0/1 constraint. Then, to compare the performance between the proposed algorithm and NORA algorithm, a series of experiments are performed. As a conseqence of the performance comparison between two algorithms, it has been concluded that the proposed algorithm can produce similar total error to NORA algorithm when the optional tasks are scheduled in the random order of their required processing times but, the proposed algorithm can produce less total error than NORA algorithm especially when the optional tasks are scheduled in the ascending order of their required processing times.

Detecting Shared Resource Usage Errors with Global Predicates (광역조건식에 의한 공유자원 접근오류 검색)

  • Lee, Eun-Jeong;Yun, Gi-Jung
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.12
    • /
    • pp.1445-1454
    • /
    • 1999
  • 광역 조건식의 계산은 분산 프로그램의 수행을 테스트 또는 디버깅하기 위한 방법으로 활 발히 연구되고 있다. 이제까지 주로 연구된 광역조건식은 AND 또는 OR 광역 조건식 등이 있는데, 특히 AND 광역 조건식은 분산 프로그램의 동시적 조건을 표현하는데 유용하여 효율적인 검색 알고리즘이 활발히 연구되었다. 분산프로그램의 수행오류로서 공유자원의 배타적 접근조건은 가장 중요하고 일반적인 경우라 할 수 있다. 본 논문에서는 XOR 연산을 이용하여 공유자원 프로그램의 오류 검색을 위한 광역조건식을 기술하는 방식에 대해 제안하였다. XOR 연산을 이용한 광역 조건식은 연산자 중 많아야 하나의 지역조건식만이 참일 때 전체 조건식이 참이 되는데 이러한 성질은 여러 프로세스 중 한번에 하나만이 공유자원에 배타적으로 접근할 수 있는 조건을 표현하는데 매우 유용하다. n 개의 프로세스로 이루어진 분산프로그램에서 한개의 공유자원에 대한 배타적 접근 조건을 기술하기 위해서 AND로 연결된 광역조건식을 이용하면 O(n2)개의 광역 조건식이 필요한데 반해 XOR 연산으로는 하나의 조건식으로 나타낼 수 있다. 더구나 XOR 연산을 이용한 광역조건식은 최근 소개된 겹치는 구간의 개념을 활용하면 매우 간단하게 검색할 수 있다. 본 논문에서는 겹치는 구간을 찾는 검색 알고리즘을 소개하고 증명하였다.Abstract Detecting global predicates is an useful tool for debugging and testing a distributed program. Past research has considered several restricted forms of predicates, including conjunctive or disjunctive form of predicates. Especially, conjunctive predicates have attracted main attention not only because they are useful to describe simultaneous conditions in a distributed program, but also because it is possible to find algorithms to evaluate them within reasonable time bound. Detecting errors in accessing shared resources are the most popular and important constraints of distributed programs. In this paper, we introduced an exclusive OR predicates as a model of global predicates to describe shared resource conditions in distributed programs. An exclusive OR predicate holds only when at most one operand is true, which is useful to describe mutual exclusion conditions of distributed programs where only one process should be allowed to access the shared resource at a time. One exclusive OR predicate is enough to describe mutual exclusion condition of n processes with one shared resource, while it takes O(n2) conjunctive predicates. Moreover, exclusive OR condition is easily detectable using the concept of overlapping intervals introduced by Venkatesan and Dathan. An off-line algorithm for evaluating exclusive OR global predicates is presented with a correctness proof.

Automatic Algorithms of Rebar Quantity Take-Off of Green Frame by Composite Precast Concrete Members (합성 PC부재에 의한 그린 프레임의 철근물량 산출 자동화 알고리즘)

  • Lee, Sung-Ho;Kim, Seon-Hyung;Lee, Goon-Jae;Kim, Sun-Kuk;Joo, Jin-Kyu
    • Korean Journal of Construction Engineering and Management
    • /
    • v.13 no.1
    • /
    • pp.118-128
    • /
    • 2012
  • As the bearing wall structure, which has been widely applied to domestic apartment buildings since the 1980s, cause many problems during remodeling of buildings, the government encourages constructors to adopt flat plate or rahmen structure through legal incentives. In line with such a trend, the green frame, an eco-friendly rahmen structure that has removed the shortcomings of previous structures, was developed to enhance structural safety, constructability, and eco-friendliness. The construction of green frame can reduce the labor cost and facilitate the composition of iron bars to reduce rebar loss through calculating the quality and establishing the bar bending schedule automatically on the precast concrete member data collected over the design phase. Therefore, the purpose of this study is to develop the algorithm to automate the calculation of iron bar volume for the green frame designed on composite precast concrete members. Automated algorithm to calculate concrete structural design information and design information. Practices through the application site should prove efficacy. The database established by the developed algorithm will automate the establishment of iron bar processing map and bar cutting list and the calculation of optimal composition and order volume to minimize the rebar loss. This will also reduce the expenses on management staff and overall construction cost through the minimization of rebar loss.