A Fast New Algorithm for a Robot Neurocontroller Using Inverse QR Decomposition

نویسندگان

  • Alan S. Morris
  • Seddik Khemaissia
چکیده

A new adaptive neural network controller for robots is presented. The controller is based on direct adaptive techniques. Unlike many neural network controllers in the literature, inverse dynamical model evaluation is not required. A numerically robust, computationally efficient processing scheme for neural network weight estimation is described, namely, the inverse QR decomposition (INVQR). The inverse QR decomposition and a weighted recursive least-squares (WRLS) method for neural network weight estimation is derived using Cholesky factorization of the data matrix. The algorithm that performs the efficient INVQR of the underlying space-time data matrix may be implemented in parallel on a triangular array. Furthermore, its systolic architecture is well suited for VLSI implementation. Another important benefit of the INVQR decomposition is that it solves directly for the time-recursive least-squares filter vector, while avoiding the sequential back-substitution step required by the QR decomposition approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solution of Inverse Kinematic Problem of a 2DOF Robot Using Decomposition Method

The inverse kinematics problem of a two degree of freedom (2DOF) planar robot arms issolved using Adomian’s decomposition method (ADM), after converting to a system of twononlinear algebraic equations. The advantage of the method is that it gives the solutions asfunctions of the desired position of the end effecter and the length of the arms. The accuracyof the solutions can be increased up to ...

متن کامل

New fast QR decomposition least squares adaptive algorithms

This paper presents two new, closely related adaptive algorithms for LS system identification. The starting point for the derivation of the algorithms is the inverse Cholesky factor of the data correlation matrix, obtained via a QR decomposition (QRD). Both algorithms are of O(p) computational complexity, with p being the order of the system. The first algorithm is a fixed order QRD scheme with...

متن کامل

Fast QR factorization of Cauchy-like matrices

n this paper we present two fast numerical methods for computing the QR factorization of a Cauchy-like matrix C with data points lying on the real axis or on the unit circle in the complex plane. It is shown that the rows of the Q-factor of C give the eigenvectors of a rank structured matrix partially determined by some prescribed spectral data. This property establishes a basic connection betw...

متن کامل

On Fast Qr Algorithms Based on Backward Prediction Errors: New Results and Comparisons

Fast QR decomposition algorithms based on backward prediction errors are well known for their good numerical behavior and low complexity. This paper examines two different versions of the fast QR algorithm based on a priori backward prediction errors as well as other two corresponding versions of the fast QR algorithm based on a posteriori backward prediction errors. The main matrix equations a...

متن کامل

A Fast Algorithm for Computing Pseudospectra of Companion Matrices

The concept of pseudospectra was introduced by Trefethen during the 1990s and became a popular tool to explain the behavior of non-normal matrices. It is well known that the zeros of a polynomial are equal to the eigenvalues of the associated companion matrix. It is feasible to do the sensitivity analysis of the zeros of polynomials by the tool of pseudospectra of companion matrices. Thus, the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • I. J. Robotics Res.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2000