1
|
Xiao L, Li X, Cao P, He Y, Tang W, Li J, Wang Y. A Dynamic-Varying Parameter Enhanced ZNN Model for Solving Time-Varying Complex-Valued Tensor Inversion With Its Application to Image Encryption. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2024; 35:13681-13690. [PMID: 37224356 DOI: 10.1109/tnnls.2023.3270563] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/26/2023]
Abstract
Time-varying complex-valued tensor inverse (TVCTI) is a public problem worthy of being studied, while numerical solutions for the TVCTI are not effective enough. This work aims to find the accurate solution to the TVCTI using zeroing neural network (ZNN), which is an effective tool in terms of solving time-varying problems and is improved in this article to solve the TVCTI problem for the first time. Based on the design idea of ZNN, an error-adaptive dynamic parameter and a new enhanced segmented signum exponential activation function (ESS-EAF) are first designed and applied to the ZNN. Then a dynamic-varying parameter-enhanced ZNN (DVPEZNN) model is proposed to solve the TVCTI problem. The convergence and robustness of the DVPEZNN model are theoretically analyzed and discussed. In order to highlight better convergence and robustness of the DVPEZNN model, it is compared with four varying-parameter ZNN models in the illustrative example. The results show that the DVPEZNN model has better convergence and robustness than the other four ZNN models in different situations. In addition, the state solution sequence generated by the DVPEZNN model in the process of solving the TVCTI cooperates with the chaotic system and deoxyribonucleic acid (DNA) coding rules to obtain the chaotic-ZNN-DNA (CZD) image encryption algorithm, which can encrypt and decrypt images with good performance.
Collapse
|
2
|
Li K, Li L, Tang C, Lu W, Fan X. Three-Dimensional Path Planning Based on Six-Direction Search Scheme. SENSORS (BASEL, SWITZERLAND) 2024; 24:1193. [PMID: 38400351 PMCID: PMC10893041 DOI: 10.3390/s24041193] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Received: 12/12/2023] [Revised: 01/28/2024] [Accepted: 01/29/2024] [Indexed: 02/25/2024]
Abstract
In order to solve the problem of how to perform path planning for AUVs with multiple obstacles in a 3D underwater environment, this paper proposes a six-direction search scheme based on neural networks. In known environments with stationary obstacles, the obstacle energy is constructed based on a neural network and the path energy is introduced to avoid a too-long path being generated. Based on the weighted total energy of obstacle energy and path energy, a six-direction search scheme is designed here for path planning. To improve the efficiency of the six-direction search algorithm, two optimization methods are employed to reduce the number of iterations and total path search time. The first method involves adjusting the search step length dynamically, which helps to decrease the number of iterations needed for path planning. The second method involves reducing the number of path nodes, which can not only decrease the search time but also avoid premature convergence. By implementing these optimization methods, the performance of the six-direction search algorithm is enhanced in favor of path planning with multiple underwater obstacles reasonably. The simulation results validate the effectiveness and efficiency of the six-direction search scheme.
Collapse
Affiliation(s)
- Kene Li
- School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China; (K.L.); (L.L.); (C.T.); (W.L.)
- Guangxi Engineering Research Center for Mechanism and Control Technology of Mobile Robots, Liuzhou 545006, China
| | - Liuying Li
- School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China; (K.L.); (L.L.); (C.T.); (W.L.)
| | - Chunyi Tang
- School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China; (K.L.); (L.L.); (C.T.); (W.L.)
| | - Wanning Lu
- School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China; (K.L.); (L.L.); (C.T.); (W.L.)
| | - Xiangsuo Fan
- School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China; (K.L.); (L.L.); (C.T.); (W.L.)
| |
Collapse
|
3
|
Wu D, Zhang Y. Zhang equivalency of inequation-to-inequation type for constraints of redundant manipulators. Heliyon 2024; 10:e23570. [PMID: 38173488 PMCID: PMC10761789 DOI: 10.1016/j.heliyon.2023.e23570] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Journal Information] [Subscribe] [Scholar Register] [Received: 02/06/2023] [Revised: 11/22/2023] [Accepted: 12/06/2023] [Indexed: 01/05/2024] Open
Abstract
In solving specific problems, physical laws and mathematical theorems directly express the connections between variables with equations/inequations. At times, it could be extremely hard or not viable to solve these equations/inequations directly. The PE (principle of equivalence) is a commonly applied pragmatic method across multiple fields. PE transforms the initial equations/inequations into simplified equivalent equations/inequations that are more manageable to solve, allowing researchers to achieve their objectives. The problem-solving process in many fields benefits from the use of PE. Recently, the ZE (Zhang equivalency) framework has surfaced as a promising approach for addressing time-dependent optimization problems. This ZEF (ZE framework) consolidates constraints at different tiers, demonstrating its capacity for the solving of time-dependent optimization problems. To broaden the application of ZEF in time-dependent optimization problems, specifically in the domain of motion planning for redundant manipulators, the authors systematically investigate the ZEF-I2I (ZEF of the inequation-to-inequation) type. The study concentrates on transforming constraints (i.e., joint constraints and obstacles avoidance depicted in different tiers) into consolidated constraints backed by rigorous mathematical derivations. The effectiveness and applicability of the ZEF-I2I are verified through two optimization motion planning schemes, which consolidate constraints in the velocity-tier and acceleration-tier. Schemes are required to accomplish the goal of repetitive motion planning within constraints. The firstly presented optimization motion planning schemes are then reformulated as two time-dependent quadratic programming problems. Simulative experiments conducted on the basis of a six-joint redundant manipulator confirm the outstanding effectiveness of the firstly presented ZEF-I2I in achieving the goal of motion planning within constraints.
Collapse
Affiliation(s)
- Dongqing Wu
- School of Computational Science, Zhongkai University of Agriculture and Engineering, Guangzhou 51220, Guangdong, China
- Research Institute of Sun Yat-sen University in Shenzhen, Sun Yat-sen University, Shenzhen 518057, Guangdong, China
- School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 510006, Guangdong, China
| | - Yunong Zhang
- Research Institute of Sun Yat-sen University in Shenzhen, Sun Yat-sen University, Shenzhen 518057, Guangdong, China
- School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 510006, Guangdong, China
| |
Collapse
|
4
|
Xiao L, Huang W, Li X, Sun F, Liao Q, Jia L, Li J, Liu S. ZNNs With a Varying-Parameter Design Formula for Dynamic Sylvester Quaternion Matrix Equation. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2023; 34:9981-9991. [PMID: 35412991 DOI: 10.1109/tnnls.2022.3163293] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/14/2023]
Abstract
This article aims to studying how to solve dynamic Sylvester quaternion matrix equation (DSQME) using the neural dynamic method. In order to solve the DSQME, the complex representation method is first adopted to derive the equivalent dynamic Sylvester complex matrix equation (DSCME) from the DSQME. It is proven that the solution to the DSCME is the same as that of the DSQME in essence. Then, a state-of-the-art neural dynamic method is presented to generate a general dynamic-varying parameter zeroing neural network (DVPZNN) model with its global stability being guaranteed by the Lyapunov theory. Specifically, when the linear activation function is utilized in the DVPZNN model, the corresponding model [termed linear DVPZNN (LDVPZNN)] achieves finite-time convergence, and a time range is theoretically calculated. When the nonlinear power-sigmoid activation function is utilized in the DVPZNN model, the corresponding model [termed power-sigmoid DVPZNN (PSDVPZNN)] achieves the better convergence compared with the LDVPZNN model, which is proven in detail. Finally, three examples are presented to compare the solution performance of different neural models for the DSQME and the equivalent DSCME, and the results verify the correctness of the theories and the superiority of the proposed two DVPZNN models.
Collapse
|
5
|
Xiao X, Jiang C, Mei Q, Zhang Y. Noise‐tolerate and adaptive coefficient zeroing neural network for solving dynamic matrix square root. CAAI TRANSACTIONS ON INTELLIGENCE TECHNOLOGY 2023. [DOI: 10.1049/cit2.12183] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/28/2023] Open
Affiliation(s)
- Xiuchun Xiao
- School of Electronics and Information Engineering Guangdong Ocean University Zhanjiang China
| | - Chengze Jiang
- School of Cyber Science and Engineering Southeast University Nanjing China
| | - Qixiang Mei
- School of Electronics and Information Engineering Guangdong Ocean University Zhanjiang China
| | - Yudong Zhang
- School of Computing and Mathematical Sciences University of Leicester Leicester UK
| |
Collapse
|
6
|
Wei P, Wang X, Wei Y. Neural Network Models for Time-Varying Tensor Complementarity Problems. Neurocomputing 2022. [DOI: 10.1016/j.neucom.2022.12.008] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/14/2022]
|
7
|
Xiao L, Jia L, Wang Y, Dai J, Liao Q, Zhu Q. Performance Analysis and Applications of Finite-Time ZNN Models With Constant/Fuzzy Parameters for TVQPEI. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2022; 33:6665-6676. [PMID: 34081588 DOI: 10.1109/tnnls.2021.3082950] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/12/2023]
Abstract
Based on extensive applications of the time-variant quadratic programming with equality and inequality constraints (TVQPEI) problem and the effectiveness of the zeroing neural network (ZNN) to address time-variant problems, this article proposes a novel finite-time ZNN (FT-ZNN) model with a combined activation function, aimed at providing a superior efficient neurodynamic method to solve the TVQPEI problem. The remarkable properties of the FT-ZNN model are faster finite-time convergence and preferable robustness, which are analyzed in detail, where in the case of the robustness discussion, two kinds of noises (i.e., bounded constant noise and bounded time-variant noise) are taken into account. Moreover, the proposed several theorems all compute the convergent time of the nondisturbed FT-ZNN model and the disturbed FT-ZNN model approaching to the upper bound of residual error. Besides, to enhance the performance of the FT-ZNN model, a fuzzy finite-time ZNN (FFT-ZNN), which possesses a fuzzy parameter, is further presented for solving the TVQPEI problem. A simulative example about the FT-ZNN and FFT-ZNN models solving the TVQPEI problem is given, and the experimental results expectably conform to the theoretical analysis. In addition, the designed FT-ZNN model is effectually applied to the repetitive motion of the three-link redundant robot and image fusion to show its potential practical value.
Collapse
|
8
|
Gerontitis D, Behera R, Shi Y, Stanimirović PS. A robust noise tolerant zeroing neural network for solving time-varying linear matrix equations. Neurocomputing 2022. [DOI: 10.1016/j.neucom.2022.08.036] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/15/2022]
|
9
|
Inverse kinematics of redundant manipulators with guaranteed performance. ROBOTICA 2022. [DOI: 10.1017/s026357472100045x] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
Abstract
AbstractIn this paper, the inverse kinematics (IK) of redundant manipulators is presented and studied, where the performance of end-effector path planning is guaranteed. A new Jacobian pseudoinverse (JP)-based IK method is proposed and studied using a typical numerical difference rule to discretize the existing IK method based on JP. The proposed method is depicted in a discrete-time form and is theoretically proven to exhibit great performance in the IK of redundant manipulators. A discrete-time repetitive path planning (DTRPP) scheme and a discrete-time obstacle avoidance (DTOA) scheme are developed for redundant manipulators using the proposed method. Comparative simulations are conducted on a universal robot manipulator and a PA10 robot manipulator to validate the effectiveness and superior performance of the DTRPP scheme, the DTOA scheme, and the proposed JP-based IK method.
Collapse
|
10
|
Pose control of constrained redundant arm using recurrent neural networks and one-iteration computing algorithm. Appl Soft Comput 2021. [DOI: 10.1016/j.asoc.2021.108007] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/19/2022]
|
11
|
Wang S, Jin L, Du X, Stanimirovi PS. Accelerated convergent zeroing neurodynamics models for solving multi-linear systems with M-tensors. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.06.005] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]
|
12
|
Zhang Z, Zheng L, Qiu T. A gain-adjustment neural network based time-varying underdetermined linear equation solving method. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.05.096] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/21/2022]
|
13
|
Veerasamy V, Abdul Wahab NI, Ramachandran R, Kamel S, Othman ML, Hizam H, Farade R. Power flow solution using a novel generalized linear Hopfield network based on Moore–Penrose pseudoinverse. Neural Comput Appl 2021. [DOI: 10.1007/s00521-021-05843-9] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
|
14
|
Liu B, Fu D, Qi Y, Huang H, Jin L. Noise-tolerant gradient-oriented neurodynamic model for solving the Sylvester equation. Appl Soft Comput 2021. [DOI: 10.1016/j.asoc.2021.107514] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/27/2022]
|
15
|
Real-domain QR decomposition models employing zeroing neural network and time-discretization formulas for time-varying matrices. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.03.014] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/21/2022]
|
16
|
Mo C, Gerontitis D, Stanimirović PS. Solving the time-varying tensor square root equation by varying-parameters finite-time Zhang neural network. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.03.011] [Citation(s) in RCA: 6] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/29/2022]
|
17
|
Li H, Shao S, Qin S, Yang Y. Neural networks with finite-time convergence for solving time-varying linear complementarity problem. Neurocomputing 2021. [DOI: 10.1016/j.neucom.2021.01.015] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/29/2022]
|
18
|
Tan N, Huang M, Yu P, Wang T. Neural-dynamics-enabled Jacobian inversion for model-based kinematic control of multi-section continuum manipulators. Appl Soft Comput 2021. [DOI: 10.1016/j.asoc.2021.107114] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
|
19
|
A Vary-Parameter Convergence-Accelerated Recurrent Neural Network for Online Solving Dynamic Matrix Pseudoinverse and its Robot Application. Neural Process Lett 2021. [DOI: 10.1007/s11063-021-10440-x] [Citation(s) in RCA: 3] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
|
20
|
Performance analysis of nonlinear activated zeroing neural networks for time-varying matrix pseudoinversion with application. Appl Soft Comput 2021. [DOI: 10.1016/j.asoc.2020.106735] [Citation(s) in RCA: 6] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
|
21
|
Hu Z, Li K, Li K, Li J, Xiao L. Zeroing neural network with comprehensive performance and its applications to time-varying Lyapunov equation and perturbed robotic tracking. Neurocomputing 2020. [DOI: 10.1016/j.neucom.2020.08.037] [Citation(s) in RCA: 6] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/10/2023]
|
22
|
Improved recurrent neural networks for solving Moore-Penrose inverse of real-time full-rank matrix. Neurocomputing 2020. [DOI: 10.1016/j.neucom.2020.08.026] [Citation(s) in RCA: 4] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
|
23
|
Huang H, Fu D, Zhang J, Xiao X, Wang G, Liao S. Modified Newton integration neural algorithm for solving the multi-linear M-tensor equation. Appl Soft Comput 2020. [DOI: 10.1016/j.asoc.2020.106674] [Citation(s) in RCA: 6] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
|
24
|
Tan Z, Li W, Xiao L, Hu Y. New Varying-Parameter ZNN Models With Finite-Time Convergence and Noise Suppression for Time-Varying Matrix Moore-Penrose Inversion. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2020; 31:2980-2992. [PMID: 31536017 DOI: 10.1109/tnnls.2019.2934734] [Citation(s) in RCA: 9] [Impact Index Per Article: 2.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/10/2023]
Abstract
This article aims to solve the Moore-Penrose inverse of time-varying full-rank matrices in the presence of various noises in real time. For this purpose, two varying-parameter zeroing neural networks (VPZNNs) are proposed. Specifically, VPZNN-R and VPZNN-L models, which are based on a new design formula, are designed to solve the right and left Moore-Penrose inversion problems of time-varying full-rank matrices, respectively. The two VPZNN models are activated by two novel varying-parameter nonlinear activation functions. Detailed theoretical derivations are presented to show the desired finite-time convergence and outstanding robustness of the proposed VPZNN models under various kinds of noises. In addition, existing neural models, such as the original ZNN (OZNN) and the integration-enhanced ZNN (IEZNN), are compared with the VPZNN models. Simulation observations verify the advantages of the VPZNN models over the OZNN and IEZNN models in terms of convergence and robustness. The potential of the VPZNN models for robotic applications is then illustrated by an example of robot path tracking.
Collapse
|
25
|
A recurrent neural network applied to optimal motion control of mobile robots with physical constraints. Appl Soft Comput 2019. [DOI: 10.1016/j.asoc.2019.105880] [Citation(s) in RCA: 25] [Impact Index Per Article: 5.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/21/2022]
|
26
|
Xiao L, Li K, Duan M. Computing Time-Varying Quadratic Optimization With Finite-Time Convergence and Noise Tolerance: A Unified Framework for Zeroing Neural Network. IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2019; 30:3360-3369. [PMID: 30716052 DOI: 10.1109/tnnls.2019.2891252] [Citation(s) in RCA: 34] [Impact Index Per Article: 6.8] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/09/2023]
Abstract
Zeroing neural network (ZNN), as a powerful calculating tool, is extensively applied in various computation and optimization fields. Convergence and noise-tolerance performance are always pursued and investigated in the ZNN field. Up to now, there are no unified ZNN models that simultaneously achieve the finite-time convergence and inherent noise tolerance for computing time-varying quadratic optimization problems, although this superior property is highly demanded in practical applications. In this paper, for computing time-varying quadratic optimization within finite-time convergence in the presence of various additive noises, a new framework for ZNN is designed to fill this gap in a unified manner. Specifically, different from the previous design formulas either possessing finite-time convergence or possessing noise-tolerance performance, a new design formula with finite-time convergence and noise tolerance is proposed in a unified framework (and thus called unified design formula). Then, on the basis of the unified design formula, a unified ZNN (UZNN) is, thus, proposed and investigated in the unified framework of ZNN for computing time-varying quadratic optimization problems in the presence of various additive noises. In addition, theoretical analyses of the unified design formula and the UZNN model are given to guarantee the finite-time convergence and inherent noise tolerance. Computer simulation results verify the superior property of the UZNN model for computing time-varying quadratic optimization problems, as compared with the previously proposed ZNN models.
Collapse
|
27
|
A Repeatable Motion Scheme for Kinematic Control of Redundant Manipulators. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE 2019; 2019:5426986. [PMID: 31641347 PMCID: PMC6769351 DOI: 10.1155/2019/5426986] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Download PDF] [Figures] [Subscribe] [Scholar Register] [Received: 05/29/2019] [Accepted: 07/28/2019] [Indexed: 11/18/2022]
Abstract
To achieve closed trajectory motion planning of redundant manipulators, each joint angle has to be returned to its initial position. Most of the repeatable motion schemes have been proposed to solve kinematic problems considering only the initial desired position of each joint at first. Actually, it is very difficult for various joint angles of the robot arms to be positioned in the expected trajectory before moving. To construct an effective kinematic model, a novel optimal programming index based on a recurrent neural network is designed and analyzed in this paper. The repetitiveness and timeliness are presented and analyzed. Combining the kinematic equation constraint of manipulators, a repeatable motion scheme is formulated. In addition, the Lagrange multiplier theorem is introduced to prove that such a repeatable motion scheme can be converted into a time-varying linear equation. A finite-time neural network solver is constructed for the solution of the motion scheme. Simulation results for two different trajectories illustrate the accuracy and timeliness of the proposed motion scheme. Finally, two different repetitive schemes are compared and verified the optimal time for the novelty of the proposed kinematic scheme.
Collapse
|
28
|
|
29
|
|
30
|
Xu Z, Li S, Zhou X, Yan W, Cheng T, Huang D. Dynamic neural networks based kinematic control for redundant manipulators with model uncertainties. Neurocomputing 2019. [DOI: 10.1016/j.neucom.2018.11.001] [Citation(s) in RCA: 43] [Impact Index Per Article: 8.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/27/2022]
|
31
|
Improved Gradient Neural Networks for Solving Moore–Penrose Inverse of Full-Rank Matrix. Neural Process Lett 2019. [DOI: 10.1007/s11063-019-09983-x] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/27/2022]
|
32
|
Lv X, Xiao L, Tan Z, Yang Z. Wsbp function activated Zhang dynamic with finite-time convergence applied to Lyapunov equation. Neurocomputing 2018. [DOI: 10.1016/j.neucom.2018.06.057] [Citation(s) in RCA: 11] [Impact Index Per Article: 1.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/28/2022]
|
33
|
Li Y, Li S, Hannaford B. A Novel Recurrent Neural Network for Improving Redundant Manipulator Motion Planning Completeness. IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION : ICRA : [PROCEEDINGS]. IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION 2018; 2018:2956-2961. [PMID: 34336368 DOI: 10.1109/icra.2018.8461204] [Citation(s) in RCA: 9] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/10/2022]
Abstract
Recurrent Neural Networks (RNNs) demonstrated advantages on control precision, system robustness and computational efficiency, and have been widely applied to redundant manipulator control optimization. Existing RNN control schemes locally optimize trajectories and are efficient and reliable on obstacle avoidance. However, for motion planning, they suffer from local minimum and do not have planning completeness. This work explained the cause of the planning incompleteness and addressed the problem with a novel RNN control scheme. The paper presented the proposed method in detail and analyzed the global stability and the planning completeness in theory. The proposed method was compared with other three control schemes on the precision, the robustness and the planning completeness in software simulation and the results shows the proposed method has improved precision and robustness, and planning completeness.
Collapse
Affiliation(s)
- Yangming Li
- Department of Electrical Engineering, University of Washington, Seattle, WA, USA 98195
| | - Shuai Li
- Department of Computing, The Hong Kong Polytechnic University, Kowloon, Hong Kong
| | - Blake Hannaford
- Departments of Electrical Engineering, Bioengineering, Mechanical Engineering, and Surgery, University of Washington, Seattle, WA, USA 98195
| |
Collapse
|
34
|
|
35
|
Bi-criteria minimization with MWVN–INAM type for motion planning and control of redundant robot manipulators. ROBOTICA 2018. [DOI: 10.1017/s0263574717000625] [Citation(s) in RCA: 13] [Impact Index Per Article: 2.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/07/2022]
Abstract
SUMMARYThis study proposes and investigates a new type of bi-criteria minimization (BCM) for the motion planning and control of redundant robot manipulators to address the discontinuity problem in the infinity-norm acceleration minimization (INAM) scheme and to guarantee the final joint velocity of motion to be approximate to zero. This new type is based on the combination of minimum weighted velocity norm (MWVN) and INAM criteria, and thus is called the MWVN–INAM–BCM scheme. In formulating such a scheme, joint-angle, joint-velocity, and joint-acceleration limits are incorporated. The proposed MWVN–INAM–BCM scheme is reformulated as a quadratic programming problem solved at the joint-acceleration level. Simulation results based on the PUMA560 robot manipulator validate the efficacy and applicability of the proposed MWVN–INAM–BCM scheme in robotic redundancy resolution. In addition, the physical realizability of the proposed scheme is verified in practical application based on a six-link planar robot manipulator.
Collapse
|
36
|
Jin L, Li S, Wang H, Zhang Z. Nonconvex projection activated zeroing neurodynamic models for time-varying matrix pseudoinversion with accelerated finite-time convergence. Appl Soft Comput 2018. [DOI: 10.1016/j.asoc.2017.09.016] [Citation(s) in RCA: 24] [Impact Index Per Article: 4.0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/18/2022]
|
37
|
Jin L, Li S. Nonconvex function activated zeroing neural network models for dynamic quadratic programming subject to equality and inequality constraints. Neurocomputing 2017. [DOI: 10.1016/j.neucom.2017.05.017] [Citation(s) in RCA: 59] [Impact Index Per Article: 8.4] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/24/2022]
|
38
|
Li Z, Ma W, Yin Z, Guo H. Tracking control of time-varying knee exoskeleton disturbed by interaction torque. ISA TRANSACTIONS 2017; 71:458-466. [PMID: 28823408 DOI: 10.1016/j.isatra.2017.08.004] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Subscribe] [Scholar Register] [Received: 02/27/2017] [Revised: 06/30/2017] [Accepted: 08/02/2017] [Indexed: 06/07/2023]
Abstract
Knee exoskeletons have been increasingly applied as assistive devices to help lower-extremity impaired people to make their knee joints move through providing external movement compensation. Tracking control of knee exoskeletons guided by human intentions often encounters time-varying (time-dependent) issues and the disturbance interaction torque, which may dramatically put an influence up on their dynamic behaviors. Inertial and viscous parameters of knee exoskeletons can be estimated to be time-varying due to unexpected mechanical vibrations and contact interactions. Moreover, the interaction torque produced from knee joint of wearers has an evident disturbance effect on regular motions of knee exoskeleton. All of these points can increase difficultly of accurate control of knee exoskeletons to follow desired joint angle trajectories. This paper proposes a novel control strategy for controlling knee exoskeleton with time-varying inertial and viscous coefficients disturbed by interaction torque. Such designed controller is able to make the tracking error of joint angle of knee exoskeletons exponentially converge to zero. Meanwhile, the proposed approach is robust to guarantee the tracking error bounded when the interaction torque exists. Illustrative simulation and experiment results are presented to show efficiency of the proposed controller. Additionally, comparisons with gradient dynamic (GD) approach and other methods are also presented to demonstrate efficiency and superiority of the proposed control strategy for tracking joint angle of knee exoskeleton.
Collapse
Affiliation(s)
- Zhan Li
- School of Automation Engineering, Center for Robotics, University of Electronic Science and Technology of China (UESTC), Chengdu 611731, China.
| | - Wenhao Ma
- School of Automation Engineering, Center for Robotics, University of Electronic Science and Technology of China (UESTC), Chengdu 611731, China
| | - Ziguang Yin
- School of Automation Engineering, Center for Robotics, University of Electronic Science and Technology of China (UESTC), Chengdu 611731, China
| | - Hongliang Guo
- School of Automation Engineering, Center for Robotics, University of Electronic Science and Technology of China (UESTC), Chengdu 611731, China
| |
Collapse
|
39
|
Feng J, Qin S, Shi F, Zhao X. A recurrent neural network with finite-time convergence for convex quadratic bilevel programming problems. Neural Comput Appl 2017. [DOI: 10.1007/s00521-017-2926-7] [Citation(s) in RCA: 13] [Impact Index Per Article: 1.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/20/2022]
|
40
|
Xiao L. A nonlinearly-activated neurodynamic model and its finite-time solution to equality-constrained quadratic optimization with nonstationary coefficients. Appl Soft Comput 2016. [DOI: 10.1016/j.asoc.2015.11.023] [Citation(s) in RCA: 62] [Impact Index Per Article: 7.8] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/28/2022]
|