• Title/Summary/Keyword: Descent Rate

Search Result 97, Processing Time 0.031 seconds

Self-Recurrent Wavelet Neural Network Based Direct Adaptive Control for Stable Path Tracking of Mobile Robots

  • You, Sung-Jin;Oh, Joon-Seop;Park, Jin-Bae;Choi, Yoon-Ho
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.640-645
    • /
    • 2004
  • This paper proposes a direct adaptive control method using self-recurrent wavelet neural network (SRWNN) for stable path tracking of mobile robots. The architecture of the SRWNN is a modified model of the wavelet neural network (WNN). Unlike the WNN, since a mother wavelet layer of the SRWNN is composed of self-feedback neurons, the SRWNN has the ability to store the past information of the wavelet. For this ability of the SRWNN, the SRWNN is used as a controller with simpler structure than the WNN in our on-line control process. The gradient-descent method with adaptive learning rates (ALR) is applied to train the parameters of the SRWNN. The ALR are derived from discrete Lyapunov stability theorem, which are used to guarantee the stable path tracking of mobile robots. Finally, through computer simulations, we demonstrate the effectiveness and stability of the proposed controller.

  • PDF

Two-Way MIMO AF Relaying Methods Having a Legacy Device without Self-Interference Cancellation (자기간섭 제거 기능이 없는 기존 단말을 가지는 양방향 다중입출력 중계 증폭 전송 기법)

  • Lee, Kyoung-Jae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.338-344
    • /
    • 2017
  • In this paper, two-way amplify-and-forward relay methods are investigated where two terminals and one relay node are equipped with multiple antennas. In two-way relay channels, it is assumed that one terminal can eliminate its own self-interference but the other cannot. For this channel, we first maximize the sum-rate performance by employing an iterative gradient descent (GD) algorithm. Then, a simple singular value decomposition (SVD) based block triangularization is developed to null the self-interference. Simulation results show the proposed methods outperform the conventional schemes for various environments.

A Moving Terminal's Coordinates Prediction Algorithm and an IoT Application

  • Kim, Daewon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.7
    • /
    • pp.63-74
    • /
    • 2017
  • Recently in the area of ICT, the M2M and IoT are in the spotlight as a cutting edge technology with the help of advancement of internet. Among those fields, the smart home is the closest area to our daily lives. Smart home has the purpose to lead a user more convenient living in the house with WLAN (Wireless Local Area Network) or other short-range communication environments using automated appliances. With an arrival of the age of IoT, this can be described as one axis of a variety of applications as for the M2H (Machine to Home) field in M2M. In this paper, we propose a novel technique for estimating the location of a terminal that freely move within a specified area using the RSSI (Received Signal Strength Indication) in the WLAN environment. In order to perform the location estimation, the Fingerprint and KNN methods are utilized and the LMS with the gradient descent method and the proposed algorithm are also used through the error correction functions for locating the real-time position of a moving user who is keeping a smart terminal. From the estimated location, the nearest fixed devices which are general electric appliances were supposed to work appropriately for self-operating of virtual smart home. Through the experiments, connection and operation success rate, and the performance results are analyzed, presenting the verification results.

An Improved Multiplicative Updating Algorithm for Nonnegative Independent Component Analysis

  • Li, Hui;Shen, Yue-Hong;Wang, Jian-Gong
    • ETRI Journal
    • /
    • v.35 no.2
    • /
    • pp.193-199
    • /
    • 2013
  • This paper addresses nonnegative independent component analysis (NICA), with the aim to realize the blind separation of nonnegative well-grounded independent source signals, which arises in many practical applications but is hardly ever explored. Recently, Bertrand and Moonen presented a multiplicative NICA (M-NICA) algorithm using multiplicative update and subspace projection. Based on the principle of the mutual correlation minimization, we propose another novel cost function to evaluate the diagonalization level of the correlation matrix, and apply the multiplicative exponentiated gradient (EG) descent update to it to maintain nonnegativity. An efficient approach referred to as the EG-NICA algorithm is derived and its validity is confirmed by numerous simulations conducted on different types of source signals. Results show that the separation performance of the proposed EG-NICA algorithm is superior to that of the previous M-NICA algorithm, with a better unmixing accuracy. In addition, its convergence speed is adjustable by an appropriate user-defined learning rate.

Stable Tracking Control to a Non-linear Process Via Neural Network Model

  • Zhai, Yujia
    • Journal of the Korea Convergence Society
    • /
    • v.5 no.4
    • /
    • pp.163-169
    • /
    • 2014
  • A stable neural network control scheme for unknown non-linear systems is developed in this paper. While the control variable is optimised to minimize the performance index, convergence of the index is guaranteed asymptotically stable by a Lyapnov control law. The optimization is achieved using a gradient descent searching algorithm and is consequently slow. A fast convergence algorithm using an adaptive learning rate is employed to speed up the convergence. Application of the stable control to a single input single output (SISO) non-linear system is simulated. The satisfactory control performance is obtained.

GLOBAL CONVERGENCE PROPERTIES OF THE MODIFIED BFGS METHOD ASSOCIATING WITH GENERAL LINE SEARCH MODEL

  • Liu, Jian-Guo;Guo, Qiang
    • Journal of applied mathematics & informatics
    • /
    • v.16 no.1_2
    • /
    • pp.195-205
    • /
    • 2004
  • To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the quasi-Newton iteration pattern. We prove the global convergence properties of the algorithm associating with the general form of line search, and prove the quadratic convergence rate of the algorithm under some conditions.

A GLOBALLY AND SUPERLIEARLY CONVERGENT FEASIBLE SQP ALGORITHM FOR DEGENERATE CONSTRAINED OPTIMIZATION

  • Chen, Yu;Xie, Xiao-Liang
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.3_4
    • /
    • pp.823-835
    • /
    • 2010
  • In this paper, A FSQP algorithm for degenerate inequality constraints optimization problems is proposed. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving a quadratic programming subproblem. To overcome the Maratos effect, a higher-order correction direction is obtained by solving another quadratic programming subproblem. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions. Finally, some preliminary numerical results are reported.

Adaptive On-line Optimization of Cellular Productivity of Continuous Methylotroph Culture (메타놀자화균의 연속배양에 의한 균체생산의 온-라인 적응최적화)

  • 이형춘;박정오
    • The Korean Journal of Food And Nutrition
    • /
    • v.1 no.2
    • /
    • pp.31-36
    • /
    • 1988
  • An adaptive on-line optimization method has been applied to test the ability to maximize the cellular productivity of a continuous methylotroph culture system which was simulated by a variable yield Monod-type model. Optimum dilution rate and productivity were successively obtained and maintained at all times by the algorithm that utilizes steepest descent technique as optimization method and recursive least-square method with forgetting factor as dynamic model identification.

  • PDF

Relationship between biosignal, raction time, and eye blink depending on arousal level (I) (각성상태에 따른 생리신호와 반응시간 및 눈깜박임의 상관관계 (I))

  • Ko, H.W.;Kim, Y.H.
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.05
    • /
    • pp.426-429
    • /
    • 1997
  • This paper describes the relationship among physiological, behavioral signal, and subjective evaluation depending on arousal level. Nz and reaction time hall similar pattern with KSS level, but eyeblink rate was different from these two parameters. Eyeblink rate increased slowly from KSS level 1 to 5, and had high increasing rate at KSS 7. But it showed steep descent at KSS level 9. From the result of reaction time test, since human performance was decreased rapidly above the KSS level 5, it is desirable to give a subject some stimulus such as sound or aroma to rise arousal level above the KSS level 3.

  • PDF

A Study Of Handwritten Digit Recognition By Neural Network Trained With The Back-Propagation Algorithm Using Generalized Delta Rule (신경망 회로를 이용한 필기체 숫자 인식에 관할 연구)

  • Lee, Kye-Han;Chung, Chin-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 1999.07g
    • /
    • pp.2932-2934
    • /
    • 1999
  • In this paper, a scheme for recognition of handwritten digits using a multilayer neural network trained with the back-propagation algorithm using generalized delta rule is proposed. The neural network is trained with hand written digit data of different writers and different styles. One of the purpose of the work with neural networks is the minimization of the mean square error(MSE) between actual output and desired one. The back-propagation algorithm is an efficient and very classical method. The back-propagation algorithm for training the weights in a multilayer net uses the steepest descent minimization procedure and the sigmoid threshold function. As an error rate is reduced, recognition rate is improved. Therefore we propose a method that is reduced an error rate.

  • PDF