Shuai  Li

Dr. Shuai Li

Department of Computing, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
24 February 2017 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
LJLong Jin
Long Jin
Shuai  LiShuai Li
Shuai Li
HLHung Manh La
Hung Manh La
XLXin Luo
Xin Luo
For solving the singularity problem arising in the control of manipulators, an efficient way is to maximize its manipulability. However, it is challenging to optimize manipulability effectively because it is a nonconvex function to the joint angles of a robotic arm. In addition, the involvement of an inversion operation in the expression of manipulability makes it even hard for timely optimization due to the intensively computational burden for matrix inversion. In this paper, we make progress on real-time manipulability optimization by establishing a dynamic neural network for recurrent calculation of manipulability-maximal control actions for redundant manipulators under physical constraints in an inverse-free manner. By expressing position tracking and matrix inversion as equality constraints, physical limits as inequality constraints, and velocity-level manipulability measure, which is affine to the joint velocities, as the objective function, the manipulability optimization scheme is further formulated as a constrained quadratic program. Then, a dynamic neural network with rigorously provable convergence is constructed to solve such a problem online. Computer simulations are conducted and show that, compared to the existing methods, the proposed scheme can raise the manipulability almost 40% on average, which substantiates the efficacy, accuracy, and superiority of the proposed manipulability optimization scheme.


25 April 2018 in International Journal of Robotics and Control
Verified
Journal Article
Open access
PDF file
XJXiangyuan Jiang
Xiangyuan Jiang
Shuai  LiShuai Li
Shuai Li
Meta-heuristic algorithms have become very popular because of powerful performance on the optimization problem. A new algorithm called beetle antennae search algorithm (BAS) is proposed in the paper inspired by the searching behavior of long-horn beetles. The BAS algorithm imitates the function of antennae and the random walking mechanism of beetles in nature, and then two main steps of detecting and searching are implemented. Finally, the algorithm is benchmarked on 2 well-known test functions, in which the numerical results validate the efficacy of the proposed BAS algorithm.

22 May 2015 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XLXin Luo
Xin Luo
MZMengChu Zhou
MengChu Zhou
Shuai  LiShuai Li
Shuai Li
ZYZhu-Hong You
Zhu-Hong You
YXYunni Xia
Yunni Xia
QZQingsheng Zhu
Qingsheng Zhu
Nonnegative matrix factorization (NMF)-based models possess fine representativeness of a target matrix, which is critically important in collaborative filtering (CF)-based recommender systems. However, current NMF-based CF recommenders suffer from the problem of high computational and storage complexity, as well as slow convergence rate, which prevents them from industrial usage in context of big data. To address these issues, this paper proposes an alternating direction method (ADM)-based nonnegative latent factor (ANLF) model. The main idea is to implement the ADM-based optimization with regard to each single feature, to obtain high convergence rate as well as low complexity. Both computational and storage costs of ANLF are linear with the size of given data in the target matrix, which ensures high efficiency when dealing with extremely sparse matrices usually seen in CF problems. As demonstrated by the experiments on large, real data sets, ANLF also ensures fast convergence and high prediction accuracy, as well as the maintenance of nonnegativity constraints. Moreover, it is simple and easy to implement for real applications of learning systems.

1 April 2018 in Neurocomputing
Verified
Journal Article
Closed access
LJLong Jin
Long Jin
Shuai  LiShuai Li
Shuai Li
JYJiguo Yu
Jiguo Yu
JHJinbo He
Jinbo He

24 June 2016 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Shuai  LiShuai Li
Shuai Li
YZYunong Zhang
Yunong Zhang
LJLong Jin
Long Jin
Redundancy resolution is a critical problem in the control of robotic manipulators. Recurrent neural networks (RNNs), as inherently parallel processing models for time-sequence processing, are potentially applicable for the motion control of manipulators. However, the development of neural models for high-accuracy and real-time control is a challenging problem. This paper identifies two limitations of the existing RNN solutions for manipulator control, i.e., position error accumulation and the convex restriction on the projection set, and overcomes them by proposing two modified neural network models. Our method allows nonconvex sets for projection operations, and control error does not accumulate over time in the presence of noise. Unlike most works in which RNNs are used to process time sequences, the proposed approach is model-based and training-free, which makes it possible to achieve fast tracking of reference signals with superior robustness and accuracy. Theoretical analysis reveals the global stability of a system under the control of the proposed neural networks. Simulation results confirm the effectiveness of the proposed control method in both the position regulation and tracking control of redundant PUMA 560 manipulators.