-
1
Urban Microcirculation Traffic Network Planning Method Based on Fast Search Random Tree Algorithm
Published 2024-12-01Get full text
Article -
2
Automated guided vehicle (AGV) path optimization method based on improved rapidly-exploring random trees
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 -
3
-
4
Research on vehicle scheduling for forest fires in the northern Greater Khingan Mountains
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 -
5
Comparison of KNN and Random Forest Algorithms on E-Commerce Service Chatbot
Published 2025-01-01Get full text
Article -
6
Novel Hybrid Feature Selection Using Binary Portia Spider Optimization Algorithm and Fast mRMR
Published 2025-03-01Get full text
Article -
7
-
8
-
9
Smart Chaining: Templing and Temple Search
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 -
10
-
11
Leveraging Machine Learning for Accurate and Fast Stellar Mass Estimation of Galaxies
Published 2025-01-01Get full text
Article -
12
Streamlining ICI Transformed as a Nonnegative System
Published 2025-07-01“…The previous algorithm used initial conditions that were randomly assorted pixel intensities. …”
Get full text
Article -
13
Fast and Efficient Drone Path Planning Using Riemannian Manifold in Indoor Environment
Published 2024-09-01Get full text
Article -
14
COMPARATIVE ANALYSIS OF COLORING ALGORITHMS FOR ORDINARY WEIGHTED GRAPH
Published 2014-06-01Get full text
Article -
15
Illustration Design Model with Clustering Optimization Genetic Algorithm
Published 2021-01-01Get full text
Article -
16
-
17
Path Planning Algorithm for Manipulators in Complex Scenes Based on Improved RRT*
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 -
18
In-Memory Versus Disk-Based Computing with Random Forest for Stock Analysis: A Comparative Study
Published 2025-08-01Get full text
Article -
19
Routing algorithm for heterogeneous computing force requests based on computing first network
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 -
20
A revamped black winged kite algorithm with advanced strategies for engineering optimization
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