• Title/Summary/Keyword: Online parameter learning

Search Result 25, Processing Time 0.023 seconds

Torque Ripple Minimization of PMSM Using Parameter Optimization Based Iterative Learning Control

  • Xia, Changliang;Deng, Weitao;Shi, Tingna;Yan, Yan
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.425-436
    • /
    • 2016
  • In this paper, a parameter optimization based iterative learning control strategy is presented for permanent magnet synchronous motor control. This paper analyzes the mechanism of iterative learning control suppressing PMSM torque ripple and discusses the impact of controller parameters on steady-state and dynamic performance of the system. Based on the analysis, an optimization problem is constructed, and the expression of the optimal controller parameter is obtained to adjust the controller parameter online. Experimental research is carried out on a 5.2kW PMSM. The results show that the parameter optimization based iterative learning control proposed in this paper achieves lower torque ripple during steady-state operation and short regulating time of dynamic response, thus satisfying the demands for both steady state and dynamic performance of the speed regulating system.

Online Learning of Bayesian Network Parameters for Incomplete Data of Real World (현실 세계의 불완전한 데이타를 위한 베이지안 네트워크 파라메터의 온라인 학습)

  • Lim, Sung-Soo;Cho, Sung-Bae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.12
    • /
    • pp.885-893
    • /
    • 2006
  • The Bayesian network(BN) has emerged in recent years as a powerful technique for handling uncertainty iii complex domains. Parameter learning of BN to find the most proper network from given data set has been investigated to decrease the time and effort for designing BN. Off-line learning needs much time and effort to gather the enough data and since there are uncertainties in real world, it is hard to get the complete data. In this paper, we propose an online learning method of Bayesian network parameters from incomplete data. It provides higher flexibility through learning from incomplete data and higher adaptability on environments through online learning. The results of comparison with Voting EM algorithm proposed by Cohen at el. confirm that the proposed method has the same performance in complete data set and higher performance in incomplete data set, comparing with Voting EM algorithm.

Generative AI parameter tuning for online self-directed learning

  • Jin-Young Jun;Youn-A Min
    • Journal of the Korea Society of Computer and Information
    • /
    • v.29 no.4
    • /
    • pp.31-38
    • /
    • 2024
  • This study proposes hyper-parameter settings for developing a generative AI-based learning support tool to facilitate programming education in online distance learning. We implemented an experimental tool that can set research hyper-parameters according to three different learning contexts, and evaluated the quality of responses from the generative AI using the tool. The experiment with the default hyper-parameter settings of the generative AI was used as the control group, and the experiment with the research hyper-parameters was used as the experimental group. The experiment results showed no significant difference between the two groups in the "Learning Support" context. However, in other two contexts ("Code Generation" and "Comment Generation"), it showed the average evaluation scores of the experimental group were found to be 11.6% points and 23% points higher than those of the control group respectively. Lastly, this study also observed that when the expected influence of response on learning motivation was presented in the 'system content', responses containing emotional support considering learning emotions were generated.

Online Parameter Estimation and Convergence Property of Dynamic Bayesian Networks

  • Cho, Hyun-Cheol;Fadali, M. Sami;Lee, Kwon-Soon
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.7 no.4
    • /
    • pp.285-294
    • /
    • 2007
  • In this paper, we investigate a novel online estimation algorithm for dynamic Bayesian network(DBN) parameters, given as conditional probabilities. We sequentially update the parameter adjustment rule based on observation data. We apply our algorithm to two well known representations of DBNs: to a first-order Markov Chain(MC) model and to a Hidden Markov Model(HMM). A sliding window allows efficient adaptive computation in real time. We also examine the stochastic convergence and stability of the learning algorithm.

On-line Bayesian Learning based on Wireless Sensor Network (무선 센서 네트워크에 기반한 온라인 베이지안 학습)

  • Lee, Ho-Suk
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06d
    • /
    • pp.105-108
    • /
    • 2007
  • Bayesian learning network is employed for diverse applications. This paper discusses the Bayesian learning network algorithm structure which can be applied in the wireless sensor network environment for various online applications. First, this paper discusses Bayesian parameter learning, Bayesian DAG structure learning, characteristics of wireless sensor network, and data gathering in the wireless sensor network. Second, this paper discusses the important considerations about the online Bayesian learning network and the conceptual structure of the learning network algorithm.

  • PDF

Dynamic System Identification Using a Recurrent Compensatory Fuzzy Neural Network

  • Lee, Chi-Yung;Lin, Cheng-Jian;Chen, Cheng-Hung;Chang, Chun-Lung
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.5
    • /
    • pp.755-766
    • /
    • 2008
  • This study presents a recurrent compensatory fuzzy neural network (RCFNN) for dynamic system identification. The proposed RCFNN uses a compensatory fuzzy reasoning method, and has feedback connections added to the rule layer of the RCFNN. The compensatory fuzzy reasoning method can make the fuzzy logic system more effective, and the additional feedback connections can solve temporal problems as well. Moreover, an online learning algorithm is demonstrated to automatically construct the RCFNN. The RCFNN initially contains no rules. The rules are created and adapted as online learning proceeds via simultaneous structure and parameter learning. Structure learning is based on the measure of degree and parameter learning is based on the gradient descent algorithm. The simulation results from identifying dynamic systems demonstrate that the convergence speed of the proposed method exceeds that of conventional methods. Moreover, the number of adjustable parameters of the proposed method is less than the other recurrent methods.

Parameter Learning of Dynamic Bayesian Networks using Constrained Least Square Estimation and Steepest Descent Algorithm (제약조건을 갖는 최소자승 추정기법과 최급강하 알고리즘을 이용한 동적 베이시안 네트워크의 파라미터 학습기법)

  • Cho, Hyun-Cheol;Lee, Kwon-Soon;Koo, Kyung-Wan
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.58 no.2
    • /
    • pp.164-171
    • /
    • 2009
  • This paper presents new learning algorithm of dynamic Bayesian networks (DBN) by means of constrained least square (LS) estimation algorithm and gradient descent method. First, we propose constrained LS based parameter estimation for a Markov chain (MC) model given observation data sets. Next, a gradient descent optimization is utilized for online estimation of a hidden Markov model (HMM), which is bi-linearly constructed by adding an observation variable to a MC model. We achieve numerical simulations to prove its reliability and superiority in which a series of non stationary random signal is applied for the DBN models respectively.

On the Classification of Online Handwritten Digits using the Enhanced Back Propagation of Neural Networks (개선된 역전파 신경회로망을 이용한 온라인 필기체 숫자의 분류에 관한 연구)

  • Hong, Bong-Hwa
    • The Journal of Information Technology
    • /
    • v.9 no.4
    • /
    • pp.65-74
    • /
    • 2006
  • The back propagation of neural networks has the problems of falling into local minimum and delay of the speed by the iterative learning. An algorithm to solve the problem and improve the speed of the learning was already proposed in[8], which updates the learning parameter related with the connection weight. In this paper, we propose the algorithm generating initial weight to improve the efficiency of the algorithm by offering the difference between the input vector and the target signal to the generating function of initial weight. The algorithm proposed here can classify more than 98.75% of the handwritten digits and this rate shows 30% more effective than the other previous methods.

  • PDF

The Study of a Population and Generation Parameter's Characteristics on PID Gain Tuning with GA in Wide Solution Area (넓은 해영역에서의 GA를 이용한 PID 제어기 게인 조정에 따른 개체수와 세대수 파라미터의 특징에 관한 연구)

  • Jeong, Hwang Hun
    • Journal of Power System Engineering
    • /
    • v.21 no.3
    • /
    • pp.60-65
    • /
    • 2017
  • A GA is one of the best method to find optimal value in searching area. A GA is driven by probabilistic selection that based on the survival of the fittest. So this algorithm need a huge solving time even if it can be used lots of optimizing problem such as structural design, machine learning, system's identification and so on. This GA's characteristic constrain the program to drive offline. Some studies try to use this algorithm on online or reduce the GA's running time with parallel GA or micro GA. Unfortunately these studies still didn't reduce amount of fitness solving. If the chromosome was imported to the system, it affected system's stability. And when the control system uses online GA, it also doesn't have enough learning time. In this study, try to find stability criterion to reduce the chromosome's affection and find the characteristic of the number of population and generation when GA was driven into the wide searching area.

Intelligent IIR Filter based Multiple-Channel ANC Systems (지능형 IIR 필터 기반 다중 채널 ANC 시스템)

  • Cho, Hyun-Cheol;Yeo, Dae-Yeon;Lee, Young-Jin;Lee, Kwon-Soon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.12
    • /
    • pp.1220-1225
    • /
    • 2010
  • This paper proposes a novel active noise control (ANC) approach that uses an IIR filter and neural network techniques to effectively reduce interior noise. We construct a multiple-channel IIR filter module which is a linearly augmented framework with a generic IIR model to generate a primary control signal. A three-layer perceptron neural network is employed for establishing a secondary-path model to represent air channels among noise fields. Since the IIR module and neural network are connected in series, the output of an IIR filter is transferred forward to the neural model to generate a final ANC signal. A gradient descent optimization based learning algorithm is analytically derived for the optimal selection of the ANC parameter vectors. Moreover, re-estimation of partial parameter vectors in the ANC system is proposed for online learning. Lastly, we present the results of a numerical study to test our ANC methodology with realistic interior noise measurement obtained from Korean railway trains.