Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
A New Algorithm for Solving Strictly Convex Quadratic Programs
SIAM Journal on Optimization
Analysis and design of recurrent neural networks and their applications to control and robotic systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A neural network model for monotone linear asymmetric variational inequalities
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
A primal-dual neural network based on linear variational inequalities (LVI) is presented in this paper, which is used to solve the repetitive motion planning of redundant robots. To do so, a drift-free criterion is exploited. In addition, the physical constraints such as joint limits and joint velocity limits are incorporated into the problem formulation of such a scheme. The scheme is finally reformulated as a quadratic programming (QP) problem and resolved at the velocity-level. Compared to other computational strategies on inverse kinematics, the LVI-based primal-dual neural network is designed based on the QP-LVI conversion and Karush-Kuhn-Tucker (KKT) conditions. With simple piecewise-linear dynamics and global (exponential) convergence to optimal solutions, it can handle general QP and linear programming (LP) problems in the same inverse-free manner. The repetitive motion planning scheme and the LVI-based primal-dual neural network are simulated based on PUMA560 robot manipulator with effectiveness demonstrated.