• Title/Summary/Keyword: recursive system

Search Result 595, Processing Time 0.028 seconds

Design Polynomial Tuning of Multivariable Self Tuning Controllers (다변수 자기동조 제어기의 설계다항식 조정)

  • Cho, Won-Chul;Shim, Tae-Eun
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.11
    • /
    • pp.22-33
    • /
    • 1999
  • This paper presents the method for the automatic tuning of a design weighting polynomial parameters of a generalized minimum-variance stochastic ultivariable self-tuning controller which adapts to changes in the higher order nonminimum phase system parameters with time delays and noises. The self-tuning effect is achieved through the recursive least square algorithm at the parameter estimation stage and also through the Robbins-Monro algorithm at the stage of optimizing the design weighting polynomial parameters of the controller. The proposed multivariable self-tuning method is simple and effective compared with pole restriction method. The computer simulation results are presented to adapt the higher order multivariable system with nonminimum phase and with changeable system parameters.

  • PDF

Moving Object Tracking using Differential Image (차영상을 이용한 이동 객체 추적)

  • 오명관;한군희;최동진;전병민
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2004.05a
    • /
    • pp.396-400
    • /
    • 2004
  • In this study, we have proposed the tracking system of single moving object. The tracking system was estimated motion using differential image, and than track the moving object by controlled Pan/Tilt device of camera. Proposed tracking system is devided into image acquisition and preprocessing phase, motion estimation phase and object tracking phase. To estimation the motion, differential image method was used. In the binary differential image, decision of threshold value was used adaptive method. And in grouping the object area, block_based recursive labeling algorithm was used. As a result of experiment, motion of moving object can be estimated. The result of tracking, object was not lost and object was tracked correctly.

  • PDF

Damping of Inter-Area Low Frequency Oscillation Using an Adaptive Wide-Area Damping Controller

  • Yao, Wei;Jiang, L.;Fang, Jiakun;Wen, Jinyu;Wang, Shaorong
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.1
    • /
    • pp.27-36
    • /
    • 2014
  • This paper presents an adaptive wide-area damping controller (WADC) based on generalized predictive control (GPC) and model identification for damping the inter-area low frequency oscillations in large-scale inter-connected power system. A recursive least-squares algorithm (RLSA) with a varying forgetting factor is applied to identify online the reduced-order linearlized model which contains dominant inter-area low frequency oscillations. Based on this linearlized model, the generalized predictive control scheme considering control output constraints is employed to obtain the optimal control signal in each sampling interval. Case studies are undertaken on a two-area four-machine power system and the New England 10-machine 39-bus power system, respectively. Simulation results show that the proposed adaptive WADC not only can damp the inter-area oscillations effectively under a wide range of operation conditions and different disturbances, but also has better robustness against to the time delay existing in the remote signals. The comparison studies with the conventional lead-lag WADC are also provided.

A Reliability Improvement Technique of DNS Services Based on Anycast (Anycast 기술을 통한 신뢰적 향상 기법의 DNS 서비스에 관한 연구)

  • Kim, Bo Seung;Kim, Jeong Jai;Kim, Kyung Min;Park, Chan Kil;Shin, Yong Tae
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.4
    • /
    • pp.95-105
    • /
    • 2010
  • DNS(Domain Name System) is a huge distributed database that converts host name to IP address. We are expecting the importance of DNS is more increased because many Internet application services appear according to the continuous increase of Internet users and nearly all the Internet application services use DNS. To prevent the interruption of DNS service, DNS server is configured with primary DNS server and a secondary DNS server which takes the place of primary DNS server in case of the service interruption. But this scheme is difficult for providing DNS service constantly in case of DDoS attack, which brings about much network load or network problems in DNS server group. Therefore, This paper proposed the scheme to locally distribute load of DNS server, and the use of address system to group the distributed DNS servers. Also, it proposed the authentication scheme of the correspondent server in case the server is changed in DNS server group having grouping address. In this paper, it is shown that the prosed scheme guarantees the improved service reliability with maintaining the present service performance through the evaluation. Through this, we can expect the high improved DNS service can be provided in the Internet environment in the future.

An Analysis of Cell Loss Process in an ATM Network Under Partial Buffer Sharing Policy (ATM 전송망에서의 PBS를 이용한 셀 우선 순위 제어 방식의 연구)

  • 곽민곤;성수란;김종권
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.12
    • /
    • pp.2328-2339
    • /
    • 1994
  • The PBS(Partial Buffer Sharing) space priority mechanism is one of priority control methods which may improve the performance of a single server queueing system when mixed traffic with different performance requirements is applied to the system. This paper analyzes the cell loss behavior of PBS assuming loss sensitive traffic and delay sensitive traffic are applied to the system. To derive the successive cell loss probabilities. which are an important performance measure of realtime traffic, we develop a recursive algorithm. Performance results show the successive cell loss probabilities obtained by our method are lager than the probabilities derived from an independent cell loss assumption. These results may indicate the limitation of PBS for realtime traffic and the increase of the admissible load with the criterion of quality of service.

  • PDF

The Probabilistic Production Simulation with Energy Limited Units Using the Mixture of Cumulants Approximation (에너지 제약을 갖는 발전기를 고려한 경우의 Mixture of Cumulants Approximation법에 의한 발전시뮬레이션에 관한 연구)

  • 송길영;김용하
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.40 no.12
    • /
    • pp.1195-1202
    • /
    • 1991
  • This paper describes a newly developed method of production simulation by using the Mixture of Cumulant Approximation (MOCA). In this method, the load is modelled as random variable (r.v.) which can be interpreted in terms of partitioning the load into various categories. We can consider the load shape of multi-modal characteristics. The number of load category and demarcation points of each load category are calculated automatically by using interpolation and least square method. Each generating unit of a supply system is modelled as r.v. of unit outage capacity according to the number of unit outage subset. Since the computation burden of each subset's moments increases exponentially as units are convolved to the system, we further derive the specific recursive formulae. In simulating the energy limited units, hydro unit simulation is performed using Energy Invariance Property and the simulation of pumped storage unit is modelled as compulsory and economic operations. The proposed MOCA method is applide to the test systems and the results are compared with those of cumulant and Booth Baleriaux method. It is verified that the MOCA method is considerably reliable and stable both pathological and well behaved system.

The Design of Target Tracking System Using the Identification of TS Fuzzy Model (TS 퍼지 모델 동정을 이용한 표적 추적 시스템 설계)

  • Lee, Bum-Jik;Joo, Young-Hoon;Park, Jin-Bae
    • Proceedings of the KIEE Conference
    • /
    • 2001.07d
    • /
    • pp.1958-1960
    • /
    • 2001
  • In this paper, we propose the design methodology of target tracking system using the identification of TS fuzzy model based on genetic algorithm(GA) and RLS algorithm. In general, the objective of target tracking is to estimate the future trajectory of the target based on the past position of the target obtained from the sensor. In the conventional and mathematical nonlinear filtering method such as extended Kalman filter(EKF), the performance of the system may be deteriorated in highly nonlinear situation. In this paper, to resolve these problems of nonlinear filtering technique, the error of EKF by nonlinearity is compensated by identifying TS fuzzy model. In the proposed method, after composing training datum from the parameters of EKF, by identifying the premise and consequent parameters and the rule numbers of TS fuzzy model using GA, and by tuning finely the consequent parameters of TS fuzzy model using recursive least square(RLS) algorithm, the error of EKF is compensated. Finally, the proposed method is applied to three dimensional tracking problem, and the simulation results shows that the tracking performance is improved by the proposed method.

  • PDF

Improvement of inspection system for common crossings by track side monitoring and prognostics

  • Sysyn, Mykola;Nabochenko, Olga;Kovalchuk, Vitalii;Gruen, Dimitri;Pentsak, Andriy
    • Structural Monitoring and Maintenance
    • /
    • v.6 no.3
    • /
    • pp.219-235
    • /
    • 2019
  • Scheduled inspections of common crossings are one of the main cost drivers of railway maintenance. Prognostics and health management (PHM) approach and modern monitoring means offer many possibilities in the optimization of inspections and maintenance. The present paper deals with data driven prognosis of the common crossing remaining useful life (RUL) that is based on an inertial monitoring system. The problem of scheduled inspections system for common crossings is outlined and analysed. The proposed analysis of inertial signals with the maximal overlap discrete wavelet packet transform (MODWPT) and Shannon entropy (SE) estimates enable to extract the spectral features. The relevant features for the acceleration components are selected with application of Lasso (Least absolute shrinkage and selection operator) regularization. The features are fused with time domain information about the longitudinal position of wheels impact and train velocities by multivariate regression. The fused structural health (SH) indicator has a significant correlation to the lifetime of crossing. The RUL prognosis is performed on the linear degradation stochastic model with recursive Bayesian update. Prognosis testing metrics show the promising results for common crossing inspection scheduling improvement.

Design of e-Learning System for Spectral Analysis of High-Order Pulse (고차원펄스 스펙트럼 분석을 위한 이러닝 시스템의 설계)

  • Oh, Yong-Sun
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.8
    • /
    • pp.475-487
    • /
    • 2011
  • In this paper, we present a systematic method to derive spectrum of high-order pulse and a novel design of e-Learning system that deals with deriving the spectrum using concept-based branching method. Spectrum of high-order pulse can be derived using conventional methods including 'Consecutive Differentiations' or 'Convolutions', however, their complexity of calculation should be too high to be used as the order of the pulse increase. We develop a recursive algorithm according to the order of pulse, and then derive the formula of spectrum connected to the order with a newly designed look-up table. Moving along, we design an e-Learning content for studying the procedure of deriving high-order pulse spectrum described above. In this authoring, we use the concept-based object branching method including conventional page or title-type branching in sequential playing. We design all four Content-pages divided into 'Modeling', 'Impulse Response and Transfer Function', 'Parameters' and 'Look-up Table' by these conceptual objects. And modules and sub-modules are constructed hierarchically as conceptual elements from the Content-pages. Students can easily approach to the core concepts of the analysis because of the effects of our new teaching method. We offer step-by-step processes of the e-Learning content through unit-based branching scheme for difficult modules and sub-modules in our system. In addition we can offer repetitive learning processes for necessary block of given learning objects. Moreover, this method of constructing content will be considered as an advanced effectiveness of content itself.

Finding a Minimum Fare Route in the Distance-Based System (거리비례제 요금부과에 따른 최소요금경로탐색)

  • Lee, Mee-Young;Baik, Nam-Cheol;Nam, Doo-Hee;Shin, Seon-Gil
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.6
    • /
    • pp.101-108
    • /
    • 2004
  • The new transit fare in the Seoul Metropolitan is basically determined based on the distance-based fare system (DBFS). The total fare in DBFS consists of three parts- (1) basic fare, (2) transfer fare, and (3) extra fare. The fixed amount of basic fare for each mode is charged when a passenger gets on a mode, and it proceeds until traveling within basic travel distance. The transfer fare may be added when a passenger switches from the present mode to another. The extra fare is imposed if the total travel distance exceeds the basic travel distance, and after that, the longer distance the more extra fare based on the extra-fare-charging rule. This study proposes an algorithm for finding minimum fare route in DBFS. This study first exploits the link-label-based searching method to enable shortest path algorithms to implement without network expansion at junction nodes in inter-modal transit networks. Moreover, the link-expansion technique is adopted in order for each mode's travel to be treated like duplicated links, which have the same start and end nodes, but different link features. In this study, therefore, some notations associated with modes can be saved, thus the existing link-based shortest path algorithm is applicable without any loss of generality. For fare calculation as next steps, a mathematical formula is proposed to embrace fare-charging process using search process of two adjacent links illustrated from the origin. A shortest path algorithm for finding a minimum fare route is derived by converting the formula as a recursive form. The implementation process of the algorithm is evaluated through a simple network test.