• Corpus ID: 254096335

Adaptive Zeroing-Type Neural Dynamics for Solving Quadratic Minimization and Applied to Target Tracking

@inproceedings{He2021AdaptiveZN,
  title={Adaptive Zeroing-Type Neural Dynamics for Solving Quadratic Minimization and Applied to Target Tracking},
  author={Hui-Long He and Chengze Jiang and Yudong Zhang and Xiuchun Xiao and Zhiyuan Song},
  year={2021}
}
The time-varying quadratic minimization (TVQM) problem, as a hotspot currently, urgently demands a more reliable and faster–solving model. To this end, a novel adaptive coefficient constructs framework is presented and realized to improve the performance of the solution model, leading to the adaptive zeroing-type neural dynamics (AZTND) model. Then the AZTND model is applied to solve the TVQM problem. The adaptive coefficients can adjust the step size of the model online so that the solution model… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 22 REFERENCES

Nonconvex and Bound Constraint Zeroing Neural Network for Solving Time-Varying Complex-Valued Quadratic Programming Problem

The proposed NCZNN model is 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.

Two neural dynamics approaches for computing system of time-varying nonlinear equations

New Noise-Tolerant Neural Algorithms for Future Dynamic Nonlinear Optimization With Estimation on Hessian Matrix Inversion

To suppress noises and improve the accuracy in solving FDNO problems, a novel noise-tolerant neural (NTN) algorithm based on zeroing neural dynamics is proposed and investigated and the quasi-Newton Broyden–Fletcher–Goldfarb–Shanno (BFGS) method is employed to eliminate the intensively computational burden for matrix inversion.

A Strictly Predefined-Time Convergent Neural Solution to Equality- and Inequality-Constrained Time-Variant Quadratic Programming

This is the first time to develop a ZNN model working as a quadratic programming solver that is applicable to kinematic control of robotic arms with joint constraints handled since the emergence of ZNNs.

Discrete-time neural network with two classes of bias noises for solving time-variant matrix inversion and application to robot tracking

This paper investigates discrete-time neural network with two classes of bias noises for solving time-variant matrix inversion, and its application to robot tracking based on the property of second-order differential equation.

Modified ZNN for Time-Varying Quadratic Programming With Inherent Tolerance to Noises and Its Application to Kinematic Redundancy Resolution of Robot Manipulators

This paper proposes a modified Zhang neural network (MZNN) model for the solution of TVQP and shows that, without measurement noise, the proposed MZNN model globally converges to the exact real-time solution of theTVQP problem in an exponential manner and that, in the presence of measurement noises, the proposal has a satisfactory performance.

A New Varying-Parameter Convergent-Differential Neural-Network for Solving Time-Varying Convex QP Problem Constrained by Linear-Equality

Theoretical analysis proves that VP- CDNN has super exponential convergence and the residual errors of VP-CDNN converge to zero even under perturbation situations, which are both better than traditional FP-CDnn and FT-ZNN.

A Projection Neural Network for Constrained Quadratic Minimax Optimization

The proposed neural network in this paper is capable of solving more general constrained quadratic minimax optimization problems, and the designed neural network does not include any parameter.