• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1997년도 춘계 학술대회 발표집
• /
• pp.124-127
• /
• 1997

A key element in the control of Automated Guided Vehicle Systems (AGVS) is dispatching policy. This paper proposes a new dispatching algorithm for an efficient operation of AGVS. Based on an evolutionary operation, it has an adaptive control capability responding to changes of the system environment. The performance of the algorithm is compared with some well-known dispatching rules in terms of the system throughput through simulation. Sensitivity analysis is carried out varying the buffer capacity and the number of AGVS.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.3-6
• /
• 2004

In this paper, the problem of identifying a time-varying nonlinear system in an adaptive way was considered, whereby the time-varying second-order Volterra series was employed to model the system and the filtered weighted least squares (FWLS) algorithm was utilized for the fast parameter tracking capability with low computational burden. Finally, the performance of the proposed approach was demonstrated by providing some computer simulation results.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(4)
• /
• pp.115-118
• /
• 2000

We present a new variable step size LMS algorithm using the correlation between reference input and error signal of adaptive filter. The proposed algorithm updates each weight of filter by different step size at same sample time. We applied this algorithm to adaptive multip]e-notch filter. Simulation results are presented to compare the performance of the proposed algorithm with the usual LMS algorithm and another variable step algorithm.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.463-467
• /
• 2008

Heuristic optimization using hybrid algorithms have provided a robust and efficient approach for solving many optimization problems. In this paper, a new hybrid algorithm using adaptive genetic algorithm (aGA) and particle swarm optimization (PSO) is proposed. The proposed hybrid algorithm is applied to solve numerical optimization functions. The results are compared with those of GA and other conventional PSOs. Finally, the proposed hybrid algorithm outperforms others.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1992년도 하계학술대회 논문집 A
• /
• pp.327-329
• /
• 1992

This Paper presents an algorithm for improvement of convergence in Adaptive Filter. The proposed algorithm employes the time-varying Convergence Factor to Block LMS adaptation algorithm. Computer simulation for Adaptive Modeling of time-invarying and time-varying unknown systems has been performed. Performance comparisons between LMS, BLMS algorithms which have fixed Convergence factors obtained by trial and error and the proposed algorithm which has time-varying Convergence Factor show that the proposed algorithm is superior to LMS and BLMS algorithm with respect to speed and accuracy of adaptation.

• International journal of advanced smart convergence
• /
• 제9권1호
• /
• pp.177-184
• /
• 2020

In this paper, we studied to direction of arrival (DoA) estimation to use DoA and optimum weight algorithms in coherent interference channels. The DoA algorithm have been considerable attention in signal processing with coherent signals and a limited number of snapshots in a noise and an interference environment. This paper is a proposed method for the desired signal estimation using MUSIC algorithm and adaptive beamforming to compare classical subspace techniques. Also, the proposed method is combined the updated weight value with LCMV beamforming algorithm in adaptive antenna array system for direction of arrival estimation of desired signal. The proposed algorithm can be used with combination to MUSIC algorithm, linearly constrained minimum variance beamforming (LCMV) and the weight value method to accurately desired signal estimation. Through simulation, we compare the proposed method with classical direction of in order to desired signals estimation. We show that the propose method has achieved good resolution performance better that classical direction arrival estimation algorithm. The simulation results show the effectiveness of the proposed method.

• International Journal of Control, Automation, and Systems
• /
• 제5권3호
• /
• pp.307-316
• /
• 2007

In real system application, the interacting multiple model (IMM) based algorithm operates with the following problems: it requires less computing resources as well as a good performance with respect to the various target maneuvering, it requires a robust performance with respect to the time-varying measurement noise, and further, it requires an easy design procedure in terms of its structures and parameters. To solve these problems, an adaptive fuzzy interacting multiple model (AFIMM) algorithm, which is based on the basis sub-models defined by considering the maneuvering property and the time-varying mode transition probabilities designed by using the mode probabilities as the inputs of the fuzzy decision maker whose widths are adjusted, is proposed. To verify the performance of the proposed algorithm, a radar target tracking is performed. Simulation results show that the proposed AFIMM algorithm solves all problems in the real system application of the IMM based algorithm.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.305-320
• /
• 2017

The selection of subset size is of great importance to the accuracy of digital image correlation (DIC). In the traditional DIC, a constant subset size is used for computing the entire image, which overlooks the differences among local speckle patterns of the image. Besides, it is very laborious to find the optimal global subset size of a speckle image. In this paper, a self-adaptive and bidirectional dynamic subset selection (SBDSS) algorithm is proposed to make the subset sizes vary according to their local speckle patterns, which ensures that every subset size is suitable and optimal. The sum of subset intensity variation (${\eta}$) is defined as the assessment criterion to quantify the subset information. Both the threshold and initial guess of subset size in the SBDSS algorithm are self-adaptive to different images. To analyze the performance of the proposed algorithm, both numerical and laboratory experiments were performed. In the numerical experiments, images with different speckle distribution, different deformation and noise were calculated by both the traditional DIC and the proposed algorithm. The results demonstrate that the proposed algorithm achieves higher accuracy than the traditional DIC. Laboratory experiments performed on a substrate also demonstrate that the proposed algorithm is effective in selecting appropriate subset size for each point.

• 한국인터넷방송통신학회논문지
• /
• 제16권1호
• /
• pp.109-114
• /
• 2016

본 논문은 디지털 무선 전송시 채널에서 발생되는 부호간 간섭과 잡음의 영향을 최소화하기 위한 CCA (Compact Constellation Algorithm) 등화 알고리즘에서 적응 스텝 크기를 적용하여 이의 등화 성능 개선에 관한 것이다. 일반적으로 등화 알고리즘에서 적응을 위한 스텝 크기는 고정적으로 사용하지만, 제안 알고리즘에서는 등화를 위한 스텝 크기를 비선형 함수인 오차 신호에 비례하도록 변화시킨다. 이의 개선된 등화 성능을 보이기 위하여 등화기 출력 성상도, 잔류 isi, 최대 찌그러짐과 MSE와 SER을 적용하였으며, 이들을 고정 스텝 크기를 갖는 기존 CCA와 비교하였다. 컴퓨터 시뮬레이션의 결과 정상 상태 이후에서는 적응 스텝 방식의 CCA가 고정 스텝 방식의 CCA보다 우월함을 확인하였다.

• Journal of information and communication convergence engineering
• /
• 제15권2호
• /
• pp.73-78
• /
• 2017

A general linearly constrained broadband adaptive array is examined in the eigenvector space with respect to the optimal weight vector and the adaptive algorithm. The optimal weight vector and the general adaptive algorithm in the eigenvector space are obtained by eigenvector matrix transformation. Their operations are shown to be the same as in the standard coordinate system except for the relevant transformed vectors and matrices. The nulling performance of the general linearly constrained broadband adaptive array depends on the gain factor such that the constraint plane is shifted perpendicularly to the origin by an increase in the gain factor. The general linearly constrained broadband adaptive array is observed to perform better than a conventional linearly constrained adaptive array in a coherent signal environment, while the former performs similarly to the latter in a non-coherent signal environment.