A Variable-Parameter Noise-Tolerant Zeroing Neural Network for Time-Variant Matrix Inversion With Guaranteed Robustness

MNTZNN for Solving Hybrid Double-Deck Dynamic Nonlinear Equation System Applied to Robot Manipulator Control

Compared with conventional dynamic nonlinear equation systems, a hybrid double-deck dynamic nonlinear equation system (H3DNES) not only has multiple layers describing more different tasks in practice, but also has a hybrid nonlinear structure of solution and its derivative describing their nonlinear constraints. Its characteristics lead to the ability to describe more complicated problems involving multiple constraints, and strong nonlinear and dynamic features, such as robot manipulator tracking control. Besides, noises are inevitable in practice and thus strong robustness of models solving H3DNES is also necessary. In this work, a multilayered noise-tolerant zeroing neural network (MNTZNN) model is proposed for solving H3DNES. MNTZNN model has strong robustness and it solves H3DNES successfully even when noises exist in both the two layers of H3DNES. In order to develop the MNTZNN model, a new zeroing neural network (ZNN) design formula is proposed. It not only enables equations with respect to solutions to become equations with respect to the second-order derivatives of solutions but also makes the corresponding model have strong robustness. The robustness of the MNTZNN model is proved when parameters in the model satisfy a loose constraint and the error bounds are programmable via setting appropriate parameter values. Finally, the MNTZNN model is applied to the tracking control of the six-link planar robot manipulator and PUMA560 robot manipulator with hybrid nonlinear constraints of joint angle and velocity.

A Dynamic Gain Fixed-Time Robust ZNN Model for Time-Variant Equality Constrained Quaternion Least Squares Problem With Applications to Multiagent Systems

A dynamic gain fixed-time (FXT) robust zeroing neural network (DFTRZNN) model is proposed to effectively solve time-variant equality constrained quaternion least squares problem (TV-EQLS). The proposed approach surmounts the shortcomings of conventional numerical algorithms which fail to address time-variant problems. The DFTRZNN model is constructed with a novel dynamic gain parameter and a novel activation function (NAF), which differs from previous zeroing neural network (ZNN) models. Moreover, the comprehensive theoretical derivation of the FXT stability and robustness of the DFTRZNN model is presented in detail. Simulation results further confirm the availability and superiority of the DFTRZNN model for solving TV-EQLS. Finally, the consensus protocols of multiagent systems are presented by utilizing the design scheme of the DFTRZNN model, which further demonstrates its practical application value.

Recurrent neural network for trajectory tracking control of manipulator with unknown mass matrix

Real-world robotic operations often face uncertainties that can impede accurate control of manipulators. This study proposes a recurrent neural network (RNN) combining kinematic and dynamic models to address this issue. Assuming an unknown mass matrix, the proposed method enables effective trajectory tracking for manipulators. In detail, a kinematic controller is designed to determine the desired joint acceleration for a given task with error feedback. Subsequently, integrated with the kinematics controller, the RNN is proposed to combine the robot's dynamic model and a mass matrix estimator. This integration allows the manipulator system to handle uncertainties and synchronously achieve trajectory tracking effectively. Theoretical analysis demonstrates the learning and control capabilities of the RNN. Simulative experiments conducted on a Franka Emika Panda manipulator, and comparisons validate the effectiveness and superiority of the proposed method.

A Survey on Biomimetic and Intelligent Algorithms with Applications

The question "How does it work" has motivated many scientists. Through the study of natural phenomena and behaviors, many intelligence algorithms have been proposed to solve various optimization problems. This paper aims to offer an informative guide for researchers who are interested in tackling optimization problems with intelligence algorithms. First, a special neural network was comprehensively discussed, and it was called a zeroing neural network (ZNN). It is especially intended for solving time-varying optimization problems, including origin, basic principles, operation mechanism, model variants, and applications. This paper presents a new classification method based on the performance index of ZNNs. Then, two classic bio-inspired algorithms, a genetic algorithm and a particle swarm algorithm, are outlined as representatives, including their origin, design process, basic principles, and applications. Finally, to emphasize the applicability of intelligence algorithms, three practical domains are introduced, including gene feature extraction, intelligence communication, and the image process.

Capacitated Clustering via Majorization-Minimization and Collaborative Neurodynamic Optimization

This paper addresses capacitated clustering based on majorization-minimization and collaborative neurodynamic optimization (CNO). Capacitated clustering is formulated as a combinatorial optimization problem. Its objective function consists of fractional terms with intra-cluster similarities in their numerators and cluster cardinalities in their denominators as normalized cluster compactness measures. To obviate the difficulty in optimizing the objective function with factional terms, the combinatorial optimization problem is reformulated as an iteratively reweighted quadratic unconstrained binary optimization problem with a surrogate function and a penalty function in a majorization-minimization framework. A clustering algorithm is developed based on CNO for solving the reformulated problem. It employs multiple Boltzmann machines operating concurrently for local searches and a particle swarm optimization rule for repositioning neuronal states upon their local convergence. Experimental results on ten benchmark datasets are elaborated to demonstrate the superior clustering performance of the proposed approaches against seven baseline algorithms in terms of 21 internal cluster validity criteria.