Lunan Zheng

Lunan Zheng

Auto-generated profile, based on publicly available information

Lunan Zheng

Nanyang Technological University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 February 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
Zhijun ZhangZhijun Zhang
Zhijun Zhang
LZLunan Zheng
Lunan Zheng
JWJian Weng
Jian Weng
YMYijun Mao
Yijun Mao
WLWei Lu
Wei Lu
LXLin Xiao
Lin Xiao
Solving Sylvester equation is a common algebraic problem in mathematics and control theory. Different from the traditional fixed-parameter recurrent neural networks, such as gradient-based recurrent neural networks or Zhang neural networks, a novel varying-parameter recurrent neural network, [called varying-parameter convergent-differential neural network (VP-CDNN)] is proposed in this paper for obtaining the online solution to the time-varying Sylvester equation. With time passing by, this kind of new varying-parameter neural network can achieve super-exponential performance. Computer simulation comparisons between the fixed-parameter neural networks and the proposed VP-CDNN via using different kinds of activation functions demonstrate that the proposed VP-CDNN has better convergence and robustness properties.

27 February 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
Zhijun ZhangZhijun Zhang
Zhijun Zhang
YLYeyun Lu
Yeyun Lu
LZLunan Zheng
Lunan Zheng
Shuai  LiShuai Li
Shuai Li
ZYZhuliang Yu
Zhuliang Yu
YLYuanqing Li
Yuanqing Li
To solve online continuous time-varying convex quadratic-programming problems constrained by a time-varying linear-equality, a novel varying-parameter convergent-differential neural network (termed as VP-CDNN) is proposed and analyzed. Different from fixed-parameter convergent-differential neural network (FP-CDNN) like the gradient-based recurrent neural network, the classic Zhang neural network and the finite-time Zhang neural network (FT-ZNN), VP-CDNN is based on monotonically increasing time-varying design-parameters. 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. Computer simulations based on different activation functions are illustrated to verify the super exponential convergence performance and strong robustness characteristics of the proposed VP-CDNN. A robot tracking example is finally presented to verify the effectiveness and availability of the proposed VP-CDNN.

16 March 2017 in IEEE/ASME Transactions on Mechatronics
Verified
Journal Article
Closed access
ZZZhijun Zhang
Zhijun Zhang
LZLunan Zheng
Lunan Zheng
JYJunming Yu
Junming Yu
YLYuanqing Li
Yuanqing Li
ZYZhuliang Yu
Zhuliang Yu
Three neural networks and three numerical methods are investigated, developed, and compared to solve a repetitive motion planning (RMP) scheme for remedying joint-drift problems of redundant robot manipulators. Three recurrent neural networks, i.e., a dual neural network, a linear variational inequality (LVI)-based primal-dual neural network, and a simplified LVI-based primal-dual neural network, are recurrent and real time, and they do not need to be trained in advance. Three numerical methods, i.e., the 94LVI method, the E47 method, and the M4 method, are time discrete and ready to conduct in digital computers. All these solutions have global linear convergence. Computer simulations and physical robot experiments verify that they are all effective to solve the RMP scheme. The comparisons show that neural networks are more accurate and faster than numerical methods on the same simulated condition under the majority normal circumstances. Furthermore, numerical methods are easy to be applied in digital computers since they are time discrete.

20 April 2020 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Zhijun ZhangZhijun Zhang
Zhijun Zhang
LZLunan Zheng
Lunan Zheng
ZCZhuoming Chen
Zhuoming Chen
LKLingdong Kong
Lingdong Kong
Hamid Reza KarimiHamid Reza Karimi
Hamid Reza Karimi
Collision between dual robot manipulators during working process will lead to task failure and even robot damage. To avoid mutual collision of dual robot manipulators while doing collaboration tasks, a novel recurrent neural network (RNN)-based mutual-collision-avoidance (MCA) scheme for solving the motion planning problem of dual manipulators is proposed and exploited. Because of the high accuracy and low computation complexity, the linear variational inequality-based primal-dual neural network is used to solve the proposed scheme. The proposed scheme is applied to the collaboration trajectory tracking and cup-stacking tasks, and shows its effectiveness for avoiding collision between the dual robot manipulators. Through network iteration and online learning, the dual robot manipulators will learn the ability of MCA. Moreover, a line-segment-based distance measure algorithm is proposed to calculate the minimum distance between the dual manipulators. If the computed minimum distance is less than the first safe-related distance threshold, a speed brake operation is executed and guarantees that the robot cannot exceed the second safe-related distance threshold. Furthermore, the proposed MCA strategy is formulated as a standard quadratic programming problem, which is further solved by an RNN. Computer simulations and a real dual robot experiment further verify the effectiveness, accuracy, and physical realizability of the RNN-based MCA scheme when manipulators cooperatively execute the end-effector tasks.

24 September 2018 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
Zhijun ZhangZhijun Zhang
Zhijun Zhang
LKLingdong Kong
Lingdong Kong
LZLunan Zheng
Lunan Zheng
PZPengchao Zhang
Pengchao Zhang
XQXilong Qu
Xilong Qu
ZYZhuliang Yu
Zhuliang Yu
Varying-parameter recurrent neural network, being a special kind of neural-dynamic methodology, has revealed powerful abilities to handle various time-varying problems, such as quadratic minimization (QM) and quadratic programming (QP) problems. In this paper, a novel power-type varying-parameter recurrent neural network (PT-VP-RNN) is proposed to solve the perturbed time-varying QM and QP problems. First, based on the generalization of time-varying QM and QP problems, the design process of the PT-VP-RNN is presented in detail. Second, the robustness performance of the proposed PT-VP-RNN is theoretically analyzed and proved. What is more, two numerical examples are simulated to illustrate the robustness convergence performance of PT-VP-RNN even in a large disturbance condition. Finally, two practical application examples (i.e., a robot tracking example and a venture investment example) further verify the effectiveness, accuracy, and widespread applicability of the proposed PT-VP-RNN.

25 December 2018 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Zhijun ZhangZhijun Zhang
Zhijun Zhang
LKLing-Dong Kong
Ling-Dong Kong
LZLunan Zheng
Lunan Zheng
Many practical problems can be solved by being formulated as time-varying quadratic programing (TVQP) problems. In this paper, a novel power-type varying-parameter recurrent neural network (VPNN) is proposed and analyzed to effectively solve the resulting TVQP problems, as well as the original practical problems. For a clear understanding, we introduce this model from three aspects: design, analysis, and applications. Specifically, the reason why and the method we use to design this neural network model for solving online TVQP problems subject to time-varying linear equality/inequality are described in detail. The theoretical analysis confirms that when activated by six commonly used activation functions, VPNN achieves a superexponential convergence rate. In contrast to the traditional zeroing neural network with fixed design parameters, the proposed VPNN has better convergence performance. Comparative simulations with state-of-the-art methods confirm the advantages of VPNN. Furthermore, the application of VPNN to a robot motion planning problem verifies the feasibility, applicability, and efficiency of the proposed method.