• Title/Summary/Keyword: linear interval systems

Search Result 89, Processing Time 0.029 seconds

Stability Bounds of Time-Varying Uncertainty and Delay Time for Discrete Systems with Time-Varying Delayed State (시변 시간지연을 갖는 이산시스템의 시변 불확실성의 안정 범위)

  • Han, Hyung-Seok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.10
    • /
    • pp.895-901
    • /
    • 2012
  • The stability robustness problem of linear discrete systems with time-varying unstructured uncertainty of delayed states with time-varying delay time is considered. The proposed conditions for stability can be used for finding allowable bounds of timevarying uncertainty and delay time, which are solved by using LMI (Linear Matrix Inequality) and GEVP (Generalized Eigenvalue Problem) known as powerful computational methods. Furthermore, the conditions can imply the several previous results on the uncertainty bounds of time-invariant delayed states. Numerical examples are given to show the effectiveness of the proposed algorithms.

Stability Condition for Discrete Interval System with Time-Varying Delay Time (시변 지연시간을 갖는 이산 구간 시스템의 안정조건)

  • Han, Hyung-seok
    • Journal of Advanced Navigation Technology
    • /
    • v.19 no.6
    • /
    • pp.574-580
    • /
    • 2015
  • The stability condition of linear discrete interval systems with a time-varying delay time is considered. The considered system has interval system matrices for both non-delayed and delayed states with time-varying delay time within given interval values. The proposed condition is derived by using Lyapunov stability theory and expressed by very simple inequality. Compared to previous results, the stability issue on the interval systems is expanded to time-varying delay. Furthermore, the new condition can imply the existing results on the time-invariant case and show the relation between interval time-varying delay time and stability of the system. The proposed condition can be applied to find the stability bound of the discrete interval system. Some numerical examples are given to show the effectiveness of the new condition and comparisons with the previously reported results are also presented.

A Design of Optimal Interval between Armatures in Long Distance Transportation PMLSM for End Cogging Force Reduction

  • Park, Eui-Jong;Jung, Sang-Yong;Kim, Yong-Jae
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.361-366
    • /
    • 2016
  • Although the permanent magnet linear synchronous motor is a motor useful for transportation systems thanks to its high speed, high acceleration and deceleration, the linear motor generally has armatures installed on the full length of the transport path. It results in the increase in material costs and manufacturing time. As a means to solve this problem a stationary discontinuous armature system is suggested. However, it involves the following two issues. The first issue is it is impossible to control the mover in the section where any armature is not installed as armatures are distributed. The second one is increasing cogging force due to the ends of the armatures. Therefore, this study aims to solve these problems by adjusting intervals between armatures to control the mover anywhere, and to design the interval between armatures optimally to minimize the end cogging force. The suitable distance was deduced. It addressed the problems and showed suitability for long distance transportation PMLSM.

Architectural Analysis of Type-2 Interval pRBF Neural Networks Using Space Search Evolutionary Algorithm (공간탐색 진화알고리즘을 이용한 Interval Type-2 pRBF 뉴럴 네트워크의 구조적 해석)

  • Oh, Sung-Kwun;Kim, Wook-Dong;Park, Ho-Sung;Lee, Young-Il
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.1
    • /
    • pp.12-18
    • /
    • 2011
  • In this paper, we proposed Interval Type-2 polynomial Radial Basis Function Neural Networks. In the receptive filed of hidden layer, Interval Type-2 fuzzy set is used. The characteristic of Interval Type-2 fuzzy set has Footprint Of Uncertainly(FOU), which denotes a certain level of robustness in the presence of un-known information when compared with the type-1 fuzzy set. In order to improve the performance of proposed model, we used the linear polynomial function as connection weight of network. The parameters such as center values of receptive field, constant deviation, and connection weight between hidden layer and output layer are optimized by Conjugate Gradient Method(CGM) and Space Search Evolutionary Algorithm(SSEA). The proposed model is applied to gas furnace dataset and its result are compared with those reported in the previous studies.

Topology Preserving Tetrahedral Decomposition Applied To Trilinear Interval Volume Tetrahedrization

  • Sohn, Bong-Soo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.6
    • /
    • pp.667-681
    • /
    • 2009
  • We describe a method to decompose a cube with trilinear interpolation into a collection of tetrahedra with linear interpolation, where the isosurface topology is preserved for all isovalues during decomposition. Visualization algorithms that require input scalar data to be defined on a tetrahedral grid can utilize our method to process 3D rectilinear data with topological correctness. As one of many possible examples, we apply the decomposition method to topologically accurate tetrahedral mesh extraction of an interval volume from trilinear volumetric imaging data. The topological correctness of the resulting mesh can be critical for accurate simulation and visualization.

Modeling radon diffusion equation in soil pore matrix by using uncertainty based orthogonal polynomials in Galerkin's method

  • Rao, T.D.;Chakraverty, S.
    • Coupled systems mechanics
    • /
    • v.6 no.4
    • /
    • pp.487-499
    • /
    • 2017
  • This paper investigates the approximate solution bounds of radon diffusion equation in soil pore matrix coupled with uncertainty. These problems have been modeled by few researchers by considering the parameters as crisp, which may not give the correct essence of the uncertainty. Here, the interval uncertainties are handled by parametric form and solution of the relevant uncertain diffusion equation is found by using Galerkin's Method. The shape functions are taken as the linear combination of orthogonal polynomials which are generated based on the parametric form of the interval uncertainty. Uncertain bounds are computed and results are compared in special cases viz. with the crisp solution.

A Prony Method Based on Discrete Fourier Transform for Estimation- of Oscillation Mode in Power Systems (이산푸리에변환에 기초한 Prony 법과 전력계통의 진동모드 추정)

  • Nam Hae-Kon;Shim Kwan-Shik
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.6
    • /
    • pp.293-305
    • /
    • 2005
  • This paper describes an improved Prony method in its speed, accuracy and reliability by efficiently determining the optimal sampling interval with use of DFT (discrete Fourier transformation). In the Prony method the computation time is dominated by the size of the linear prediction matrix, which is given by the number of data times the modeling order The size of the matrix in a general Prony method becomes large because of large number of data and so does the computation time. It is found that the Prony method produces satisfactory results when SNR is greater than three. The maximum sampling interval resulting minimum computation time is determined using the fact that the spectrum in DFT is inversely proportional to sampling interval. Also the process of computing the modes is made efficient by applying Hessenberg method to the companion matrix with complex shift and computing selectively only the dominant modes of interest. The proposed method is tested against the 2003 KEPCO system and found to be efficient and reliable. The proposed method may play a key role in monitoring in real time low frequency oscillations of power systems .

Normalizing interval data and their use in AHP (구간데이터 정규화와 계층적 분석과정에의 활용)

  • Kim, Eun Young;Ahn, Byeong Seok
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.2
    • /
    • pp.1-11
    • /
    • 2016
  • Entani and Tanaka (2007) presented a new approach for obtaining interval evaluations suitable for handling uncertain data. Above all, their approach is characterized by the normalization of interval data and thus the elimination of redundant bounds. Further, interval global weights in AHP are derived by using such normalized interval data. In this paper, we present a heuristic method for finding extreme points of interval data, which basically extends the method by Entani and Tanaka (2007), and also helps to obtain normalized interval data. In the second part of this paper, we show that the solutions to the linear program for interval global weights can be obtained by a simple inspection. In the meantime, the absolute dominance proposed by the authors is extended to pairwise dominance which makes it possible to identify at least more dominated alternatives under the same information.

Robust Estimation Algorithm for Switching Signal and State of Discrete-time Switched Linear Systems (이산 시간 선형 스위치드 시스템의 스위칭 신호 및 상태에 대한 강인한 추정 알고리즘)

  • Lee, Chanhwa;Shim, Hyungbo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.5
    • /
    • pp.214-221
    • /
    • 2015
  • In this paper, we present robust estimation and detection algorithms for discrete-time switched linear systems whose output measurements are corrupted by noises. First, a mode estimation algorithm is proposed based on the minimum distance criterion. Then, state variables are also observed under the active mode estimate. Second, a detection algorithm is constructed to detect the mode switching of the switched system. With the boundedness of measurement noise, the proposed estimation algorithm returns the exact active mode and approximate state information of the switched system. In addition, the detection algorithm can detect the switching time within a pre-determined time interval after the actual switching occurred.

Statistical comparison of morphological dilation with its equivalent linear shift-invariant system:case of memoryless uniform soruces (무기억 균일 신호원에 대한 수리 형태론적인 불림과 등가 시스템의 통계적 비교)

  • 김주명;최상신;최태영
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.34S no.2
    • /
    • pp.79-93
    • /
    • 1997
  • This paper presents a linear shift-invariant system euqivalent to morphological dilation for a memoryless uniform source in the sense of the power spectral density function, and comares it with dialtion. This equivalent LSI system is found through spectral decomposition and, for dilation and with windwo size L, it is shown to be a finite impulse response filter composed of L-1 delays, L multipliers and three adders. Th ecoefficients of the equivalent systems are tabulated. The comparisons of dilation and its equivalent LSI system show that probability density functions of the output sequences of the two systems are quite different. In particular, the probability density functon from dilation of an independent and identically distributed uniform source over the unit interval (0, 1) shows heavy probability in around 1, while that from the equivalent LSI system shows probability concentration around themean vlaue and symmetricity about it. This difference is due to the fact that dilation is a non-linear process while the equivalent system is linear and shift-ivariant. In the case that dikation is fabored over LSI filters in subjective perforance tests, one of the factors can be traced to this difference in the probability distribution.

  • PDF