In recent decades, despite significant advancements in neural networks for motion planning, the convergence speed is a critical limitation. Additionally, only a few approaches explore the incorporation of sparsity into the motion planning of redundant manipulators. In this article, inspired by Nesterov’s accelerated gradient method, a momentum recurrent neural network (MRNN) model is proposed. For sparse motion planning, multiple MRNNs operate concurrently within a framework of collaborative neurodynamic optimization (CNO). Computer simulations and physical experiments are performed to demonstrate the superiority of MRNN over the existing neural networks in terms of both time efficiency and tracking performance. Specifically, the tracking performance of the proposed CNO-MRNN is the best compared among other competing methods with the maximum position error m, mean square error m, and number of active joints 4.
In this article, the existing approaches, including numerical algorithms as well as neural networks to solve dynamic linear matrix equations, have been presented and reviewed. Specifically, the conventional gradient recurrent neural networks (CGRNNs) and the conventional zeroing neural networks (CZNNs) are successively provided to solve the dynamic problems and linear matrix equations, both of which manifest inherent limitations during the solving procedures. To remedy the drawbacks on convergence time, nonzero residual error, and large computational load of the traditional models, an adaptive gradient recurrent neural network (AGRNN) to solve dynamic linear matrix equations is proposed. This proposed inversion-free model possesses rapid convergence rate and accurate calculated solutions. Moreover, theoretical analyses guarantee the advantages of the AGRNN compared with the CGRNN and the CZNN to solve dynamic linear matrix equations. Finally, three numerical experiments, and applications to a PUMA 560 robot motion planning and a mobile subject localization based on angle-of-arrival technique are implemented to testify the advantages of the AGRNN.
30 June 2020 in IEEE Transactions on Industrial Informatics
A dynamic complex-valued matrix pseudoinversion (DCVMP) is encountered in some special environments, where the system parameters contain the dynamic, magnitude, and phase information. Currently, most of the existing models are employed to the DCVMP under a noise-free workspace. However, the noise perturbation is unavoidable in the practical application scenarios. Therefore, the motivation of this article is to design a computational model for the DCVMP with strong robustness and high-precision computing solutions. To this end, a modified Newton integration (MNI) neural algorithm is proposed for the DCVMP with noise-suppressing ability in this article. Besides, the corresponding convergence proofs on the MNI neural algorithm are provided. Furthermore, the numerical simulations and an application to the estimation of mobile object localization, are demonstrated to illustrate the superiority of the MNI neural algorithm.
Solving dynamic Sylvester matrix equations is a prevalent research topic and many methods have been arisen to solve the dynamic Sylvester equation, but few of them consider the noise effect. To investigate the new approach which can suppress the noise effect, integration feedback is added in the conventional Newton-Raphson iterated (CNRI) algorithm to form the proposed integration-implemented Newton-Raphson iterated (IINRI) algorithm based on the control theorem. Besides, this paper transforms the dynamic Sylvester equation into a linear equation which turns into the zeroing finding problem in further by constructing the error function. According to the theoretical analyses and the simulation results, the IINRI algorithm has higher accuracy and strong robustness under different noises (e.g. the constant noise, the linear noise, and the bounded random noise) while the performance of the CNRI algorithm is seriously degraded by the noises, which reveals that the IINRI algorithm is an efficient and powerful approach to solve dynamic Sylvester equation under noise perturbations.
21 January 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Currently, the Newton–Raphson iterative algorithm has been extensively employed in the fields of basic research and engineering. However, when noise components exist in a system, its performance is largely affected. To remedy shortcomings that the conventional computing methods have encountered in a noisy workspace, a novel modified Newton integration (MNI) algorithm is proposed in this article. In addition, the steady-state error of the proposed MNI algorithm is smaller than that of the Newton–Raphson algorithm under a noise-free or noisy workspace. To lay the foundations for the corresponding theoretical analyses, the proposed MNI algorithm is first converted into a homogeneous linear equation with a residual term. Then, the related theoretical analyses are carried out, which indicate that the MNI algorithm possesses noise-tolerance ability under various noisy environments. Finally, multiple computer simulations and physical experiments on robot control applications are performed to verify the feasibility and advantage of the proposed MNI algorithm.