A generalized Sylvester equation is a special formulation containing the Sylvester equation, the Lyapunov equation and the Stein equation, which is often encountered in various fields. However, the time-variant generalized Sylvester equation (TVGSE) is rarely investigated in the existing literature. In this paper, we propose a noise-suppressing recurrent neural network (NSRNN) model activated by saturation-allowed functions to solve the TVGSE. For comparison, the existing zeroing neural network (ZNN) models and some improved ZNN models are introduced. Additionally, theoretical analysis on the convergence and robustness of the NSRNN model is given. Furthermore, computer simulations on illustrative examples and applications to robots and acoustic source localization are carried out. Validation results synthesized by the NSRNN model and other ZNN models are provided to illustrate the ability in solving the TVGSE and dealing with noises of the NSRNN model, and the inaction of other ZNN models to noises.

In this paper, in order to analyze the existing repetitive motion planning (RMP) schemes for kinematic control of redundant robot manipulators, a generalized RMP scheme, which systematizes the existing RMP schemes, is presented. Then, the corresponding dynamic neural networks are derived, which leverage the gradient descent method with the velocity compensation with the feasibility proven theoretically. Given that the position errors of the end-effector should be tiny enough in the applications of redundant robot manipulators when executing a given task, especially for a precision instrument, the performance analyses on the control schemes are urgently desirable. In this paper, the upper bound of the position error on the existing RMP schemes is deduced theoretically and verified by computer simulations, with the relationship between the position error and the manipulability derived. In addition, dynamic neural networks are constructed to solve the generalized RMP schemes, with the joint velocity limits in RMP schemes extended to the nonconvex constraint. Finally, computer simulations based on different redundant robot manipulators and comparisons based on different controllers are conducted to verify the feasibility of the generalized RMP scheme and the proposed dynamic neural networks.

The existing solutions for nonconvex optimization problems show satisfactory performance in noise-free scenarios. However, they are prone to yield inaccurate results in the presence of noise in real-world problems, which may lead to failures in optimizing nonconvex problems. To this end, in this article, we propose a coevolutionary neural solution (CNS) by combining a simplified neurodynamics (SND) model with the particle swarm optimization (PSO) algorithm. Specifically, the proposed SND model does not leverage the time-derivative information, exhibiting greater stability compared to existing models. Furthermore, due to the noise tolerance capacity and rapid convergence property exhibited by the SND model, the CNS can rapidly achieve the optimal solution even in the presence of various perturbations. Theoretical analyses ensure that the proposed CNS is globally convergent with robustness and probability. In addition, the effectiveness of the CNS is compared with those of the existing solutions by a class of illustrative examples. We further apply the proposed solution to design a finite impulse response (FIR) filter and a pressure vessel to demonstrate its performance.

Many methods are known to solve the problem of real-valued and static quadratic programming (QP) effectively. However, few of them are still useful to solve the time-varying QP problem in the complex domain. In this study, a nonconvex and bound constraint zeroing neural network (NCZNN) model is designed and theorized to solve the time-varying complex-valued QP with linear equation constraint. Besides, we construct several new types of nonconvex and bound constraint complex-valued activation functions by extending real-valued activation functions to the complex domain. Subsequently, corresponding simulation experiments are conducted, and the simulation results verify the effectiveness and robustness of the proposed NCZNN model. Moreover, the model proposed in this article is further applied to solve the issue of small target detection in remote sensing images, which is modeled to QP problem with linear equation constraint by a serial of conversions based on constrained energy minimization algorithm.