• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.169.3-169
• /
• 2001

This paper introduces a new approach to analysis of error convergence for a class of iterative learning control systems. First, a nonlinear plant is represented using a Takagi-Sugeno(T-S) fuzzy model. Then each iterative learning controller is designed for each linear plant in the T-S fuzzy model. From the view point of two-dimensional(2-D) system theory, we transform the proposed learning systems to a 2-D error equation, which is also established in the form of T-S fuzzy model. We analysis the error convergence in the sense of induced 2 L -norm, where the effects of disturbances and initial conditions on 2-D error are considered. The iterative learning controller design problem to guarantee the error convergence can be reduced to linear matrix inequality problems. In comparison with others, our learning algorithm ...

• 제어로봇시스템학회논문지
• /
• 제8권5호
• /
• pp.385-392
• /
• 2002

This paper introduces a new approach to analysis of error convergence for a class of iterative teaming control systems. Firstly, a nonlinear plant is represented using a Takagi-Sugeno(T-S) fuzzy model. Then each iterative learning controller is designed for each linear plant in the T-S fuzzy model. From the view point of two-dimensional(2-D) system theory, we transform the proposed learning systems to a 2-D error equation, which is also established if the form of T-S fuzzy model. We analyze the error convergence in the sense of induced L$_2$-norm, where the effects of disturbances and initial conditions on 2-D error are considered. The iterative teaming controller design problem to guarantee the error convergence can be reduced to the linear matrix inequality problem. This method provides a systematic design procedure for iterative teaming controller. A simulation example is given to illustrate the validity of the proposed method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제3권1호
• /
• pp.31-41
• /
• 1999

We investigate some techniques of iterative refinement of solutions of a nonsingular system Ax = b with A partitioned into blocks using only single precision arithmetic. We prove that iterative refinement improves a blockwise measure of backward stability. Some applications of the results for the least squares problem (LS) will be also considered.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2002년도 가을 학술발표회 논문집
• /
• pp.615-622
• /
• 2002

In this paper, the modification of double projection method for the adaptive analysis of Element-free Galerkin(EFG) method were proposed. As results of the double projection method, the smoothed error profile that is adequate for adaptive analysis was obtained by re-projection of error that means the differences of EFG stress and projected stress. However, it was found that the efficiency of double projection method is degraded as increase of the numerical integration order. Since, the iterative refinement to single step error estimation made the same effect as increasing of integration order, the application of the iterative refinement base on double projection method could be produced the inadequately refined analysis model. To overcome this defect, a modified scheme of double projection were proposed. In the numerical example, the results did not show degradation of double projection effect in iterative refinement and the efficiency of proposed scheme were proved.

• 대한원격탐사학회지
• /
• 제33권5_1호
• /
• pp.547-557
• /
• 2017

본 연구에서는 탐지하고자 하는 표적신호를 초기 엔드멤버로 하여 Iterative Error Analysis를 통해 배경물질들의 반사 스펙트럼을 순차적으로 엔드멤버로 추출하고, 추출된 엔드멤버들을 이용하여 분광 혼합분석함으로써 표적물질의 분포를 탐지하는 새로운 초분광 표적탐지 기법을 제안한다. 제안된 기법에서는 표적물질에 대한 점유율의 변화가 주어진 문턱값보다 작아질 때 엔드멤버 추출을 위한 반복을 멈추게 된다. 이 기법은 Orthogonal Subspace Projection과 같은 모델 기반 표적 탐지기법들과 달리 사전에 엔드멤버들을 확보해야 할 필요가 없으며, Matched Filter와 같은 확률론적 표적 탐지 기법들과 달리 배경 전체를 하나의 신호로 특징화하지 않기 때문에 표적의 희소성 여부에 의한 영향을 받지 않는다는 장점을 가지고 있다. 실제 항공 초분광 영상자료 및 다양한 인공 표적물질들이 삽입된 모의 초분광 영상자료를 이용한 실험 결과, 제안된 방법이 희소 및 비 희소 표적의 탐지에 매우 효과적임이 확인되었다. 제안된 방법은 표적 물체 탐지뿐만 아니라 광물, 오염물질 등 자원 및 환경 분야에서 다양한 피복 물질을 탐지하는데 효과적으로 사용될 수 있을 것으로 기대된다.

• 대한기계학회논문집
• /
• 제19권1호
• /
• pp.38-44
• /
• 1995

We made a counter to measure the output of motor encoders for the motion error analysis of a CNC machining center, and have measured the dynamic characteristics and the position errors experimentally. Especially, we measured the radius errors for different feedrates and different radii when the CNC machining center performed a circular interpolation. We have also used an iterative learning method to reduce the radius errors and stick motion errors generated by the CNC machining center performing a circular interpolation. The results show that the proposed learning scheme can reduce the radius error and stick motion error significantly. The reduction of errors becomes more pronounced for higher feedrate and smaller radius.

• 한국전산구조공학회논문집
• /
• 제13권3호
• /
• pp.305-319
• /
• 2000

본 논문에서는 대변형 비선형 변형체의 마찰 접촉 문제의 해법을 제시하였다. 접촉 가능 점에서 접촉조건을 접촉오차 벡터를 이용하여 표시하였으며, 이러한 접촉오차 벡터를 0으로 단조 감소시키기 위하여 반복계산법을 사용하였다. 각 반복계산은 2개의 단계로 구성되어 있다 : 첫 단계에서는 이미 구해진 해의 기하학적 모양에서 얻어지는 접촉오차 벡터를 이용하여 접촉력을 수정하고, 두 번째 단계에서는 첫 단계의 접촉력을 이용하여 평형방정식을 풀어서 변위 및 접촉오차를 계산하는 것이다. 본 반복계산법에 의하여 정확한 해를 얻을 수 있음을 설명하였으며, 강소성 막 및 비선형 탄성보를 사용하여 예제계산을 수행하였다.

• 제어로봇시스템학회논문지
• /
• 제9권4호
• /
• pp.284-295
• /
• 2003

The servo tracks of disk drives are constructed at the time of manufacture with the equipment of servo track writer. Because of the imperfection of servo track writer, disk vibrations and head fluctuations during servo track writing process, the constructed servo tracks might deviate from perfect circles and take eccentric shapes. The servo track writing error should be corrected because it might cause interference with adjacent tracks and irrecoverable operation error of disk drives. The servo track writing error is repeated every disk rotation and so is periodic time function. In this paper, we propose a new correction algorithm of servo track writing error based on iterative teaming approach. Our correction algorithm can learn iteratively the servo track writing error as accurately as is desired. Furthermore, our algorithm is robust to system model errors, is computationally simple, and has fast convergence rate. In order to demonstrate the generality and practical use of our work, we present the convergence analysis of our correction algorithm and some simulation results.

• International Journal of Aeronautical and Space Sciences
• /
• 제11권2호
• /
• pp.87-97
• /
• 2010

A fault tolerant satellite attitude control scheme with a modified iterative learning law is proposed for dealing with actuator faults. The actuator fault is modeled to reflect the degradation of actuation effectiveness, and the solar array-induced disturbance is considered as an external disturbance. To estimate the magnitudes of the actuator fault and the external disturbance, a modified iterative learning law using only the information associated with the state error is applied. Stability analysis is performed to obtain the gain matrices of the modified iterative learning law using the Lyapunov theorem. The proposed fault tolerant control scheme is applied to the rest-to-rest maneuver of a large satellite system, and numerical simulations are performed to verify the performance of the proposed scheme.

• Journal of applied mathematics & informatics
• /
• 제32권1_2호
• /
• pp.61-74
• /
• 2014

This paper describes an iterative method for orthogonal projections $AA^+$ and $A^+A$ of an arbitrary matrix A, where $A^+$ represents the Moore-Penrose inverse. Convergence analysis along with the first and second order error estimates of the method are investigated. Three numerical examples are worked out to show the efficacy of our work. The first example is on a full rank matrix, whereas the other two are on full rank and rank deficient randomly generated matrices. The results obtained by the method are compared with those obtained by another iterative method. The performance measures in terms of mean CPU time (MCT) and the error bounds for computing orthogonal projections are listed in tables. If $Z_k$, k = 0,1,2,... represents the k-th iterate obtained by our method then the sequence of the traces {trace($Z_k$)} is a monotonically increasing sequence converging to the rank of (A). Also, the sequence of traces {trace($I-Z_k$)} is a monotonically decreasing sequence converging to the nullity of $A^*$.