• Journal of Astronomy and Space Sciences
• /
• 제31권3호
• /
• pp.205-214
• /
• 2014

In this study, a star identification algorithm which utilizes pivot patterns instead of apparent magnitude information was developed. The new star identification algorithm consists of two steps of recognition process. In the first step, the brightest star in a sensor image is identified using the orientation of brightness between two stars as recognition information. In the second step, cell indexes are used as new recognition information to identify dimmer stars, which are derived from the brightest star already identified. If we use the cell index information, we can search over limited portion of the star catalogue database, which enables the faster identification of dimmer stars. The new pivot algorithm does not require calibrations on the apparent magnitude of a star but it shows robust characteristics on the errors of apparent magnitude compared to conventional pivot algorithms which require the apparent magnitude information.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권12호
• /
• pp.793-798
• /
• 2004

In this paper, the problem of adaptively identifying time-varying nonlinear systems is considered. For that purpose, the discrete time-varying Volterra series is employed as a system model, and the filtered weighted least squares (FWLS) algorithm, developed for adaptive identification of linear time-varying systems, is utilized for the adaptive identification of time-varying quadratic Volterra systems. To demonstrate the performance of the proposed approach, some simulation results are provided. Note that the FWLS algorithm, decomposing the conventional weighted basis function (WBF) algorithm into a cascade of two (i.e., estimation and filtering) procedures, leads to fast parameter tracking with low computational burden, and the proposed approach can be easily extended to the adaptive identification of time-varying higher-order Volterra systems.

• Structural Engineering and Mechanics
• /
• 제67권3호
• /
• pp.245-254
• /
• 2018

In this paper, a Cloud Model based Fruit Fly Optimization Algorithm (CMFOA) is presented for structural damage identification, which is a global optimization algorithm inspired by the foraging behavior of fruit fly swarm. It is assumed that damage only leads to the decrease in elementary stiffness. The differences on time-domain structural acceleration data are used to construct the objective function, which transforms the damaged identification problem of a structure into an optimization problem. The effectiveness, efficiency and accuracy of the CMFOA are demonstrated by two different numerical simulation structures, including a simply supported beam and a cantilevered plate. Numerical results show that the CMFOA has a better capacity for structural damage identification than the basic Fruit Fly Optimization Algorithm (FOA) and the CMFOA is not sensitive to measurement noise.

• 한국지능시스템학회논문지
• /
• 제21권6호
• /
• pp.686-691
• /
• 2011

This study is concerned with the identification of fuzzy models. To address the optimization of fuzzy model, we proposed an improved space search evolutionary algorithm (ISSA) which is realized with the combination of space search algorithm and Gaussian mutation. The proposed ISSA is exploited here as the optimization vehicle for the design of fuzzy models. Considering the design of fuzzy models, we developed a hybrid identification method using information granulation and the ISSA. Information granules are treated as collections of objects (e.g. data) brought together by the criteria of proximity, similarity, or functionality. The overall hybrid identification comes in the form of two optimization mechanisms: structure identification and parameter identification. The structure identification is supported by the ISSA and C-Means while the parameter estimation is realized via the ISSA and weighted least square error method. A suite of comparative studies show that the proposed model leads to better performance in comparison with some existing models.

• 제어로봇시스템학회논문지
• /
• 제5권4호
• /
• pp.394-402
• /
• 1999

In this paper, we present an effective RLS algorithm with forgetting factor of Erlang function for the system identification. In the proposed algorithm, the forgetting factor decreases monotonically in the first stage, and then it increases monotonically in the second stage in contrary to the conventional forgetting factor RLS algorithms. In addition, annealing effect and an asymptotically stability of the proposed algorithm is discussed based on the analysis of convergency property on. Simulation results for the system identification problem indicate the superiority of the proposed algorithm in comparison to the RLS algorithm such as NLMS and Kalman filter based algorithm.

• 전자공학회논문지B
• /
• 제29B권11호
• /
• pp.8-15
• /
• 1992

This paper analyzes the properties of such algorithm that corresponds to the LMS algorithm with additional update terms, parameterized by the scalar factors $\alpha$ and $\beta$, and presents its structure. The analysis of convergence leads to complex eigenvalues of the transition matrix for the mean weight vector. Regions in which the algorithm becomes stable are demonstrated. The computational cmomplexities of MLMS algorithms are compared with those of MADF, sign and the conventional LMS algorithms. In application of the system identification the second order momentum MLMS algorithm has faster convergence speed than LMS and the first order MLMS algorithms.

• Smart Structures and Systems
• /
• 제8권4호
• /
• pp.343-365
• /
• 2011

Structural system identification (SSI) is an inverse problem of difficult solution. Currently, difficulties lie in the development of algorithms which can cater to large size problems. In this paper, a parameter estimation technique based on evolutionary strategy is presented to overcome some of the difficulties encountered in using the traditional system identification methods in terms of convergence. In this paper, a non-traditional form of system identification technique employing evolutionary algorithms is proposed. In order to improve the convergence characteristics, it is proposed to employ immune algorithms which are proved to be built with superior diversification mechanism than the conventional evolutionary algorithms and are being used for several practical complex optimisation problems. In order to reduce the number of design variables, domain decomposition methods are used, where the identification process of the entire structure is carried out in multiple stages rather than in single step. The domain decomposition based methods also help in limiting the number of sensors to be employed during dynamic testing of the structure to be identified, as the process of system identification is carried out in multiple stages. A fifteen storey framed structure, truss bridge and 40 m tall microwave tower are considered as a numerical examples to demonstrate the effectiveness of the domain decomposition based structural system identification technique using immune algorithm.

• International Journal of Aeronautical and Space Sciences
• /
• 제17권2호
• /
• pp.184-194
• /
• 2016

In existing identification methods for on-orbit spacecraft, such as eigensystem realization algorithm (ERA) and subspace method identification (SMI), singular value decomposition (SVD) is used frequently to estimate the modal parameters. However, these identification methods are often used to process the linear time-invariant system, and there is a lower computation efficiency using the SVD when the system order of spacecraft is high. In this study, to improve the computational efficiency in identifying time-varying modal parameters of large spacecraft, a faster recursive algorithm called fast approximated power iteration (FAPI) is employed. This approach avoids the SVD and can be provided as an alternative spacecraft identification method, and the latest modal parameters obtained can be applied for updating the controller parameters timely (e.g. the self-adaptive control problem). In numerical simulations, two large flexible spacecraft models, the Engineering Test Satellite-VIII (ETS-VIII) and Soil Moisture Active/Passive (SMAP) satellite, are established. The identification results show that this recursive algorithm can obtain the time-varying modal parameters, and the computation time is reduced significantly.

• International Journal of Control, Automation, and Systems
• /
• 제1권3호
• /
• pp.289-300
• /
• 2003

In this paper, we introduce an identification method in Fuzzy Relation-based Fuzzy Neural Networks (FRFNN) through a hybrid identification algorithm. The proposed FRFNN modeling implement system structure and parameter identification in the efficient form of "If...., then... " statements, and exploit the theory of system optimization and fuzzy rules. The FRFNN modeling and identification environment realizes parameter identification through a synergistic usage of genetic optimization and complex search method. The hybrid identification algorithm is carried out by combining both genetic optimization and the improved complex method in order to guarantee both global optimization and local convergence. An aggregate objective function with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. The proposed model is experimented with using two nonlinear data. The obtained experimental results reveal that the proposed networks exhibit high accuracy and generalization capabilities in comparison to other models.er models.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2538-2541
• /
• 2005

This paper deals one of the methods of system identification, especially on-line system identification in time-domain. The algorithm in this study needs all states of the system as well input to it for system identification. In this reason, Kalman filter is used for state estimation. But in order to implement a state estimator, the fact that a system model must be known is logical contradiction. To overcome this, state estimation and system parameter estimation are performed simultaneously in one sample. And the result of the system parameter estimation is used as basis to state estimation in next sample. On-line system identification comes, in every sample by performing both processes of state estimation and parameter estimation that are related mutually and recursively. This paper demonstrates the validity of proposed algorithm through an example of an unstable inverted pendulum system. This algorithm can be useful for on-line system identification of a system that has fewer number of measurable output than system order or number of states.