Search alternatives:
fast research » pain research (Expand Search)
Showing 1 - 20 results of 33 for search '(( fast research random tree algorithm ) OR ( fast search random three algorithm ))', query time: 0.27s Refine Results
  1. 1

    Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm by Ning YU

    Published 2024-12-01
    “…To address this, a method based on fast search random tree algorithm is proposed. An urban microcirculation traffic network is constructed using directed graphs, and road network interference intensity and capacity are calculated. …”
    Get full text
    Article
  2. 2
  3. 3
  4. 4

    Automated guided vehicle (AGV) path optimization method based on improved rapidly-exploring random trees by Zhigang Ren, Anjiang Cai, Feilong Xu

    Published 2025-06-01
    “…In response to the issues of low computational efficiency, slow convergence speed, curvy paths, and the tendency to fall into local optima in rapidly-exploring random tree (RRT) algorithms for automated guided vehicle (AGV) path planning, this article proposes an improved RRT algorithm that combines adaptive step-size optimization with K-dimensional tree (KD-Tree) based fast nearest neighbor search. …”
    Get full text
    Article
  5. 5
  6. 6

    Research on vehicle scheduling for forest fires in the northern Greater Khingan Mountains by Jie Zhang, Junnan He, Shihao Ren, Pei Zhou, Jun Guo, Mingyue Song

    Published 2025-01-01
    “…Improvement of ordinary genetic algorithm, design of double population strategy selection operation, the introduction of chaotic search initialization population, to improve the algorithm’s solution efficiency and accuracy, through the northern pristine forest area of Daxing’anling real forest fire cases and generation of large-scale random fire point simulation experimental test to verify the effectiveness of the algorithm, to ensure that the effectiveness and reasonableness of the solution to the problem of forest fire emergency rescue vehicle scheduling program. …”
    Get full text
    Article
  7. 7

    Smart Chaining: Templing and Temple Search by Rajeev Ranjan Kumar Tripathi, Rahul Mishra, Shailesh Kumar Agrahari, Pradeep Kumar Singh, Sarvpal Singh

    Published 2025-01-01
    “…Experimental evidence illustrates the dominance of Templing and Temple Search as it delivers <inline-formula> <tex-math notation="LaTeX">$4.5x$ </tex-math></inline-formula> faster searches and <inline-formula> <tex-math notation="LaTeX">$3.5x$ </tex-math></inline-formula> faster insertions over plain chaining at equal space complexity. …”
    Get full text
    Article
  8. 8

    Applications of Multi-Robotic Arms to Assist Agricultural Production: A Review by Xiaojian Gai, Chang Xu, Yajia Liu, Qingchun Feng, Shubo Wang

    Published 2025-06-01
    “…This paper summarizes the key technologies used in current research, including heuristic algorithms, fast search rapidly exploring random trees, reinforcement learning algorithms, etc., and focuses on reviewing the present applications of cutting-edge reinforcement learning algorithms in agricultural robotic arms. …”
    Get full text
    Article
  9. 9

    Streamlining ICI Transformed as a Nonnegative System by David Hyland

    Published 2025-07-01
    “…The previous algorithm used initial conditions that were randomly assorted pixel intensities. …”
    Get full text
    Article
  10. 10

    Design of path planning robot simulator by applying sampling based method by Heru Suwoyo, Julpri Andika, Andi Adriansyah

    Published 2025-05-01
    “…Various sampling-based methods such as Rapidly-exploring Random Tree (RRT), RRT*, and Fast-RRT, along with other derivative algorithms, have been widely used to solve path-planning problems in mobile robots. …”
    Get full text
    Article
  11. 11
  12. 12

    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
  13. 13

    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
  14. 14

    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
  15. 15

    Dye-cleaning prediction with a variant of nature-inspired algorithms coupled with extreme gradient boosting by Tiyasha Tiyasha, Chijioke Elijah Onu, Mohamed A. Ismail, Rama Rao Karri, Abdelfattah Amari, Vinay Kumar, Suraj Kumar Bhagat

    Published 2025-07-01
    “…Hyperparameter tuning via differential evolution (DE), genetic algorithm (GA), random search (RS), and grid search (GS) with the XGBoost model was conducted to achieve more accurate results. …”
    Get full text
    Article
  16. 16

    Set-Based Differential Evolution Algorithm Based on Guided Local Exploration for Automated Process Discovery by Si-Yuan Jing

    Published 2020-01-01
    “…There are three major innovations in this work. First of all, a hybrid evolutionary strategy is proposed, in which a differential evolution algorithm is employed to search the solution space and rapidly approximate the optimal solution firstly, and then a specific local exploration method joins to help the algorithm skip out the local optimum. …”
    Get full text
    Article
  17. 17
  18. 18

    Wavelet-Based ensembled intelligent technique for a better quality of fault detection and classification in AC microgrids by Nityananda Giri, Pravati Nayak, Ranjan Kumar Mallick, Sairam Mishra, Aymen Flah, Habib Kraiem, Lukas Prokop, Mohammad Kanan

    Published 2024-10-01
    “…The hyperparameters of the EBDT are optimized using a random search algorithm to enhance robustness in fault classification. …”
    Get full text
    Article
  19. 19

    Rapid diagnosis of power battery faults in new energy vehicles based on improved boosting algorithm and big data by Jiali Wang, Jia Chen

    Published 2024-12-01
    “…Subsequently, the importance of indicators in the data was analyzed using the Random Forest algorithm (RF). Finally, three improved Boosting algorithms were proposed, namely Light Gradient Boosting Machine (LightGBM), eXtreme Gradient Boosting Tree (XGBoost), and Gradient Boosting Decision Tree (CatBoost). …”
    Get full text
    Article
  20. 20

    Optimizing Kernel Extreme Learning Machine based on a Enhanced Adaptive Whale Optimization Algorithm for classification task. by ZeSheng Lin

    Published 2025-01-01
    “…Secondly, the WOA's position update formula was modified by incorporating inertia weight ω and enhancing convergence factor α, thus improving its capability for local search. Furthermore, inspired by the grey wolf optimization algorithm, use 3 excellent particle surround strategies instead of the original random selecting particles. …”
    Get full text
    Article