KLKe Li

Ke Li

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ke Li has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    Modified LSHADE-SPACMA with new mutation strategy and external archive mechanism for numerical optimization and point cloud registration

    by Shengwei Fu, Chi Ma, Ke Li, Cankun Xie, Qingsong Fan, Haisong Huang, Jiangxue Xie, Guozhang Zhang, Mingyang Yu

    Numerical optimization and point cloud registration are critical research topics in the field of artificial intelligence. The differential evolution algorithm is an effective approach to address these problems, and LSHADE-SPACMA, the winning algorithm of CEC2017, is a competitive differential evolution variant. However, LSHADE-SPACMA’s local exploitation capability can sometimes be insufficient when handling these challenges. Therefore, in this work, we propose a modified version of LSHADE-SPACMA (mLSHADE-SPACMA) for numerical optimization and point cloud registration. Compared to the original approach, this work presents three main innovations. First, we present a precise elimination and generation mechanism to enhance the algorithm’s local exploitation ability. Second, we introduce a mutation strategy based on a modified semi-parametric adaptive strategy and rank-based selective pressure, which improves the algorithm’s evolutionary direction. Third, we propose an elite-based external archiving mechanism, which ensures the diversity of the external population and can accelerate the algorithm’s convergence progress. Additionally, we utilize the CEC2014 (Dim = 10, 30, 50, 100) and CEC2017 (Dim = 10, 30, 50, 100) test suites for numerical optimization experiments, comparing our approach against: (1) 10 recent CEC winner algorithms, including LSHADE, EBOwithCMAR, jSO, LSHADE-cnEpSin, HSES, LSHADE-RSP, ELSHADE-SPACMA, EA4eig, L-SRTDE, and LSHADE-SPACMA; (2) 4 advanced variants: APSM-jSO, LensOBLDE, ACD-DE, and MIDE. The results of the Wilcoxon signed-rank test and Friedman mean rank test demonstrate that mLSHADE-SPACMA not only outperforms the original LSHADE-SPACMA but also surpasses other high-performance optimizers, except that it is inferior L-SRTDE on CEC2017. Finally, 25 point cloud registration cases from the Fast Global Registration dataset are applied for simulation analysis to demonstrate the potential of the developed mLSHADE-SPACMA technique for solving practical optimization problems. The code is available at https://github.com/ShengweiFu?tab=repositories and https://ww2.mathworks.cn/matlabcentral/fileexchange/my-file-exchange


  • Top Cited Papers
    Open Access

    Red-billed blue magpie optimizer: a novel metaheuristic algorithm for 2D/3D UAV path planning and engineering design problems

    by Shengwei Fu, Ke Li, Haisong Huang, Chi Ma, Qingsong Fan, Yunwei Zhu

    Numerical optimization, Unmanned Aerial Vehicle (UAV) path planning, and engineering design problems are fundamental to the development of artificial intelligence. Traditional methods show limitations in dealing with these complex nonlinear models. To address these challenges, the swarm intelligence algorithm is introduced as a metaheuristic method and effectively implemented. However, existing technology exhibits drawbacks such as slow convergence speed, low precision, and poor robustness. In this paper, we propose a novel metaheuristic approach called the Red-billed Blue Magpie Optimizer (RBMO), inspired by the cooperative and efficient predation behaviors of red-billed blue magpies. The mathematical model of RBMO was established by simulating the searching, chasing, attacking prey, and food storage behaviors of the red-billed blue magpie. To demonstrate RBMO’s performance, we first conduct qualitative analyses through convergence behavior experiments. Next, RBMO’s numerical optimization capabilities are substantiated using CEC2014 (Dim = 10, 30, 50, and 100) and CEC2017 (Dim = 10, 30, 50, and 100) suites, consistently achieving the best Friedman mean rank. In UAV path planning applications (two-dimensional and three − dimensional), RBMO obtains preferable solutions, demonstrating its effectiveness in solving NP-hard problems. Additionally, in five engineering design problems, RBMO consistently yields the minimum cost, showcasing its advantage in practical problem-solving. We compare our experimental results with three categories of widely recognized algorithms: (1) advanced variants, (2) recently proposed algorithms, and (3) high-performance optimizers, including CEC winners.