Search alternatives:
fast » east (Expand Search)
Showing 41 - 60 results of 237 for search '((fast OR fact) OR face) (search OR research) random three algorithm', query time: 0.31s Refine Results
  1. 41
  2. 42
  3. 43
  4. 44
  5. 45
  6. 46
  7. 47
  8. 48

    Path Planning Algorithm for Manipulators in Complex Scenes Based on Improved RRT* by Xiqing Zhang, Pengyu Wang, Yongrui Guo, Qianqian Han, Kuoran Zhang

    Published 2025-01-01
    “…Aiming at the problems of a six-degree-of-freedom robotic arm in a three-dimensional multi-obstacle space, such as low sampling efficiency and path search failure, an improved fast extended random tree (RRT*) algorithm for robotic arm path planning method (abbreviated as HP-APF-RRT*) is proposed. …”
    Get full text
    Article
  9. 49
  10. 50
  11. 51
  12. 52

    Routing algorithm for heterogeneous computing force requests based on computing first network by ZHANG Gang, LI Xi

    Published 2025-02-01
    “…An optimized genetic algorithm to address this issue was proposed. This algorithm was designed from both local and global perspectives: to ensure fast convergence to the target solution locally, a single parameter satisfying the randomness strategy was used to initialize the population, making it widely dispersed in the solution space; adopting a multi-parameter solution (or path) balanced selection strategy for selection operations, making the selected population rich and diverse; adopting a two-layer crossover strategy for crossover operations, with the aim of expanding the breadth of global search; adopting a multi parameter random single point mutation strategy for mutation operations, with the aim of deepening local search capabilities. …”
    Get full text
    Article
  13. 53

    A revamped black winged kite algorithm with advanced strategies for engineering optimization by Sarada Mohapatra, Deepa Kaliyaperumal, Farhad Soleimanian Gharehchopogh

    Published 2025-05-01
    “…Initially, the technique uses a logistic map for population initialization, swapping random generation to enhance global search effectiveness and fast convergence. …”
    Get full text
    Article
  14. 54

    Research on Cooperative Localization Method in Dynamic Networks by ZHANG Zhihua, SUN Bin, LI Bingchen, ZHOU Zhongfu, SHEN Feng

    Published 2024-12-01
    “…These circumstances can result in a decrease in the accuracy of cooperative localization algorithms or even cause them to malfunction. In order to address the above problems, this paper carries out the research on cooperative localization method, and proposes the filtering method of adaptive adjustment of observation error covariance matrix and the fusion of the federated filtering method, which enables the cooperative localization system to work normally in the case of the change of anchor nodes and ordinary nodes among mobile nodes, the disappearance or emergence of ranging values between nodes, and the random access and exit of nodes, etc. …”
    Get full text
    Article
  15. 55
  16. 56

    Structural Parameter Identification Using Multi-Objective Modified Directional Bat Algorithm by LIU Li-jun, LIN Ying-hai, SU Yong-hui, LEI Ying

    Published 2025-01-01
    “…MOMDBA addressed these limitations through three key improvements: 1) Individual Historical Best Position Tracking: This feature allowed the algorithm to retain and utilize the best individual solutions encountered during the search process, improving its ability to explore the solution space effectively. 2) Hybrid Global-Local Search Strategy: By combining global exploration with local exploitation, MOMDBA enhanced its ability to converge towards optimal solutions while avoiding local optima. 3) Elimination Mechanism: To maintain population diversity and prevent stagnation, low-performing individuals were periodically replaced with new solutions. …”
    Get full text
    Article
  17. 57
  18. 58
  19. 59
  20. 60