Optimal Bounded Ellipsoid Identification With Deterministic and Bounded Learning Gains: Design and Application to Euler-Lagrange Systems

This article proposes an effective optimal bounded ellipsoid (OBE) identification algorithm for neural networks to reconstruct the dynamics of the uncertain Euler-Lagrange systems. To address the problem of unbounded growth or vanishing of the learning gain matrix in classical OBE algorithms, we propose a modified OBE algorithm to ensure that the learning gain matrix has deterministic upper and lower bounds (i.e., the bounds are independent of the unpredictable excitation levels in different regressor channels and, therefore, are capable of being predetermined a priori ). Such properties are generally unavailable in the existing OBE algorithms. The upper bound prevents blow-up in cases of insufficient excitations, and the lower bound ensures good identification performance for time-varying parameters. Based on the proposed OBE identification algorithm, we developed a closed-loop controller for the Euler-Lagrange system and proved the practical asymptotic stability of the closed-loop system via the Lyapunov stability theory. Furthermore, we showed that inertial matrix inversion and noisy acceleration signals are not required in the controller. Comparative studies confirmed the validity of the proposed approach.