• Title/Summary/Keyword: state assignment

Search Result 177, Processing Time 0.028 seconds

Eigenstructure Assignment Method for Disturbance Suppression and Fault Isolation (외란 억제 및 고장 분리를 위한 고유구조 지정기법)

  • Seo, Young-Bong;Park, Jae-Weon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.5
    • /
    • pp.357-362
    • /
    • 2002
  • The underlying principle of fault detection via unknown input observer is to make the state estimation error independent of disturbances(or unknown inputs). In this paper, we present a systematic method that can exactly assign the eigenstructure with disturbance suppression and fault isolation capability. A desired eigenstructure for both fault isolation and disturbance suppression is obtained by an optimization method. For the dual purposes, terms for fault isolation and far disturbance suppression are included in the employed objective function for the optimization. The proposed scheme is applied to a simple example to confirm the usefulness of the method.

Robust Pole Assignment in a Specified Disk

  • Nguyen, Van-Giap;Nguyen, Tan-Tien;Lee, Gun-You;Kim, Sang-Bong
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.2 no.2
    • /
    • pp.116-120
    • /
    • 2000
  • This paper presents a method to assign robustly the closed loop system's poles in a specified disk by a state feedback for a linear time invariant system with structured or unstructured uncertainties. THe proposed robust design procedure includes two steps. Firstly, the perturbed closed loop matrix $A_{cl p}$ = $A_{cl}$ + Δ$A_{cl}$ is rearranged such that it is a function of the nominal closed loop matrix $A_{cl}$. Hence, we can control the positions of the perturbed closed loop poles by choosing $A_{cl}$ appropriately. Secondly, the feedback control law F that assigns the closed loop poles of the perturbed system in a specified disk is determined from the equation $A_{cl}$ = A + BF. A procedure for finding F is proposed based on partitioning every matrix of the equation $A_{cl}$ = A + BF in the horizontal direction.

  • PDF

A Traffic Assignment Model in Multiclass Transportation Networks (교통망에서 다차종 통행을 고려하는 통행배정모형 수립)

  • Park, Koo-Hyun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.3
    • /
    • pp.63-80
    • /
    • 2007
  • This study is a generalization of 'stable dynamics' recently suggested by Nesterov and de Palma[29]. Stable dynamics is a new model which describes and provides a stable state of congestion in urban transportation networks. In comparison with user equilibrium model that is common in analyzing transportation networks, stable dynamics requires few parameters and is coincident with intuitions and observations on the congestion. Therefore it is expected to be an useful analysis tool for transportation planners. An equilibrium in stable dynamics needs only maximum flow in each arc and Wardrop[33] Principle. In this study, we generalize the stable dynamics into the model with multiple traffic classes. We classify the traffic into the types of vehicle such as cars, buses and trucks. Driving behaviors classified by age, sex and income-level can also be classes. We develop an equilibrium with multiple traffic classes. We can find the equilibrium by solving the well-known network problem, multicommodity minimum cost network flow problem.

Robust Observer Design for Multi-Output Systems Using Eigenstructure Assignment (고유구조 지정을 이용한 다중출력 시스템의 강인한 관측기 설계)

  • Huh, Kun-Soo;Nam, Joon-Chul
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.28 no.11
    • /
    • pp.1621-1628
    • /
    • 2004
  • This paper proposes a design methodology for the robust observer using the eigenstructure assignment in multi-output systems so that the observer is less sensitive to the ill-conditioning factors such as unknown initial estimation error, modeling error and measurement bias in transient and steady-state observer performance. The robustness of the observer can be achieved by selecting the desired eigenvector matrix to have a small condition number that guarantees the small upper bound of the estimation error. So the left singular vectors of the unitary matrix spanned by space of the achievable eigenvectors are selected as a desired eigenvectors. Also, this paper proposes how to select the desired eigenvector based on the measure of observability and designs the observer with small gain. An example of a spindle drive system is simulated to validate the robustness to the ill-conditioning factors in the observer performance.

An Empirical Analysis of Sino-Russia Foreign Trade Turnover Time Series: Based on EMD-LSTM Model

  • GUO, Jian;WU, Kai Kun;YE, Lyu;CHENG, Shi Chao;LIU, Wen Jing;YANG, Jing Ying
    • The Journal of Asian Finance, Economics and Business
    • /
    • v.9 no.10
    • /
    • pp.159-168
    • /
    • 2022
  • The time series of foreign trade turnover is complex and variable and contains linear and nonlinear information. This paper proposes preprocessing the dataset by the EMD algorithm and combining the linear prediction advantage of the SARIMA model with the nonlinear prediction advantage of the EMD-LSTM model to construct the SARIMA-EMD-LSTM hybrid model by the weight assignment method. The forecast performance of the single models is compared with that of the hybrid models by using MAPE and RMSE metrics. Furthermore, it is confirmed that the weight assignment approach can benefit from the hybrid models. The results show that the SARIMA model can capture the fluctuation pattern of the time series, but it cannot effectively predict the sudden drop in foreign trade turnover caused by special reasons and has the lowest accuracy in long-term forecasting. The EMD-LSTM model successfully resolves the hysteresis phenomenon and has the highest forecast accuracy of all models, with a MAPE of 7.4304%. Therefore, it can be effectively used to forecast the Sino-Russia foreign trade turnover time series post-epidemic. Hybrid models cannot take advantage of SARIMA linear and LSTM nonlinear forecasting, so weight assignment is not the best method to construct hybrid models.

Performance-based remaining life assessment of reinforced concrete bridge girders

  • Anoop, M.B.;Rao, K. Balaji;Raghuprasad, B.K.
    • Computers and Concrete
    • /
    • v.18 no.1
    • /
    • pp.69-97
    • /
    • 2016
  • Performance-based remaining life assessment of reinforced concrete bridge girders, subject to chloride-induced corrosion of reinforcement, is addressed in this paper. Towards this, a methodology that takes into consideration the human judgmental aspects in expert decision making regarding condition state assessment is proposed. The condition of the bridge girder is specified by the assignment of a condition state from a set of predefined condition states, considering both serviceability- and ultimate- limit states, and, the performance of the bridge girder is described using performability measure. A non-homogeneous Markov chain is used for modelling the stochastic evolution of condition state of the bridge girder with time. The thinking process of the expert in condition state assessment is modelled within a probabilistic framework using Brunswikian theory and probabilistic mental models. The remaining life is determined as the time over which the performance of the girder is above the required performance level. The usefulness of the methodology is illustrated through the remaining life assessment of a reinforced concrete T-beam bridge girder.

A Study on controllable canonical forms for multi-input multi-output systems (다입력-다출력 시스템의 가제어성 정준형에 관한 연구)

  • 오세호;변증남
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.17 no.6
    • /
    • pp.9-16
    • /
    • 1980
  • On the multivariable systems described by state equations, it is well known that the poles of the system can be arbitrarily assigned In the S- plane by some state feedback. In this paper, it is discussed that a canonical form by which the state feedback gain matrix for pole assignment may be easily obtained Is stooled and also an algorithm to fond the state feedback gain matrix is presented.

  • PDF

Comparison between Cournot-Nash and Stackelberg Game in Bi-level Program (Bi-level program에서 Cournot-Nash게임과 Stackelberg게임의 비교연구)

  • Lim, Yong-Taek;Lim, Kang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.7 s.78
    • /
    • pp.99-106
    • /
    • 2004
  • This paper presents some comparisons between Cournot-Nash and Stackelberg game in bi-level program, composed of both upper level program and lower level one. The upper level can be formulated to optimize a specific objective function, while the lower formulated to express travelers' behavior patterns corresponding to the design parameter of upper level problem. This kind of hi-level program is to determine a design parameter, which leads the road network to an optimal state. Bi-level program includes traffic signal control, traffic information provision, congestion charge and new transportation mode introduction as well as road expansion. From the view point of game theory, many existing algorithms for bi-level program such as IOA (Iterative Optimization Assignment) or IEA (Iterative Estimation Assignment) belong to Cournot-Nash game. But sensitivity-based algorithms belongs to Stackelberg one because they consider the reaction of the lower level program. These two game models would be compared by using an example network and show some results that there is no superiority between the models in deterministic case, but in stochastic case Stackelberg approach is better than that of Cournot-Nash one as we expect.

A Study on the Bandwidth Assignment Scheme for Video Data Using Dynamic Parameters in the Wireless ATM Networks (무선 ATM망에서 동적 변수를 이용한 비디오 데이터의 대역폭 할당방식에 대한 연구)

  • Jang, Dong-Hyeok;Kim, Seung-Hwan;Lee, Sun-Sook;Kwon, Oh-Seok
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.73-78
    • /
    • 2002
  • In WATM networks, in order to perform dynamic slot allocation required slots of mobile terminals are estimated based on DP (Dynamic Parameter) reflecting characteristics of traffic. In VBR (Variable Bit Rate) traffic, slot allocation is done at MT considering both time-dependent characteristics and QoS (Quality of Service) requirements. In this paper, DPs-buffer state information and buffer state change-are transmitted through in-band signaling. BS (Base Station) performs dynamic slot allocation considering traffic characteristics of each MT (Mobile Terminal), in other words, buffer state information informs the potentiality of 'buffer full state'to BS if MT buffer is over the specific threshold value and buffer state change notifies change in buffer state of incoming cells to MT. If buffer state information is equal to 'low (more than threshold)' and 'abrupt increase' it generates 'buffer full' state cell transmission delay or cell loss might occur. At this time BS should assign additional slots to MT, and then MT consumes cells in its buffer. In simulation, the proposed scheme shows better performance in cell delay and loss than EPSA (Estimation-Prorated Slot Assignment) in-band scheme.

Computer Aided Design of Sequential Logic Circuits (Case of Synchronous Sequential Logic Circuits) (컴퓨터를 이용한 순차 논리 회로의 설계 (동기식 순차 논리 회로의 경우))

  • 김경식;조동섭;황희영
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.33 no.4
    • /
    • pp.134-139
    • /
    • 1984
  • This paper presents the computer program to design the synchronous sequential logic circuit. The computer program uses the MASK method to get the circuit of optimal cost. The computer program takes as an input, the minimal reduced state transition table where each state has its internal code. As an output,the optimal design of synchronous sequential logic circuit is generated for each flipflop type of JK,T,D, and RS respectively. And these circuits for 4 flipflop types are evaluated and sorted in ascending order of their costs, so that the user can select the proper flipflop type and its circuit. Furthermore,the proposed computer program may be applied to state assignment with its facility of cost evaluation.

  • PDF