Search Results - (( time evaluation path algorithm ) OR ( parallel distribution factor algorithm ))
Search alternatives:
- parallel distribution »
- distribution factor »
- factor algorithm »
- time evaluation »
- evaluation path »
- path algorithm »
-
1
Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach
Published 2024“…Additionally, a simplified path node strategy is also designed to shorten paths and reduce steering times. …”
Get full text
Get full text
Get full text
Article -
2
Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm
Published 2023“…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”
Article -
3
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
4
Shortest Path Trajectory System Based on Dijkstra Algorithm
Published 2012“…This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
5
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…Definitely this best first search algorithm saves the searching time and improves performance of shortest path finding.…”
Get full text
Get full text
Thesis -
6
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text
Thesis -
7
Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm
Published 2025“…Parallel power loads anomalies are processed by a fast-density peak clustering technique that capitalizes on the hybrid strengths of Canopy and K-means algorithms all within Apache Mahout's distributed machine-learning environment. …”
Article -
8
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
Published 2011“…The problem is to find the global path that satisfies the optimization criteria, which are shorter path length and less computation time. …”
Get full text
Get full text
Thesis -
9
Investigation on the dynamic of computation of semi autonomous evolutionary computation for syntactic optimization of a set of programming codes
Published 2007“…Genetic Algorithm as one of the Evolutionary Computation method improve the execution of parallel programming codes by optimizing the number of processors and the distribution of data. …”
Get full text
Get full text
Research Report -
10
Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios
Published 2025“…The evaluation focused on three key performance metrics: computational efficiency, path smoothness, and the number of turns. …”
Get full text
Get full text
Get full text
Article -
11
Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak
Published 2018“…However, existing algorithm seems too complicated to be applied. Since there is no technique can enable the quadrotor to implement precision navigation application, the research proposed a Real-Time Optimal Trajectory Correction (ROTC) algorithm. …”
Get full text
Get full text
Thesis -
12
Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques
Published 2024“…By contrast, the running time of the safe path selection model (96 µs) is shorter than the running times of Dijkstra's algorithm and the Floyd- Warshall algorithm (150 µs and 184 µs, respectively). …”
thesis::doctoral thesis -
13
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…For test data generation, the existing search-based techniques (SBTs) have been applied to satisfy only one OCL constraint by time. In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
Get full text
Get full text
Get full text
Thesis -
14
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In the benchmarking of the SKF and ssSKF algorithms’ performance in solving the 14-hole PCB drill path optimization case study with recent implementations, on average, both algorithms show the ability to converge to the optimal solution at a smaller number of function evaluations compared to the Gravitational Search Algorithm (GSA), Cuckoo Search (CS), and Intelligent Water Drop (IWD), although fall-short to the Taguchi- Genetic Algorithm optimization algorithm.…”
Get full text
Get full text
Thesis -
15
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
Get full text
Get full text
Thesis -
16
Improved black-winged kite algorithm and finite element analysis for robot parallel gripper design
Published 2024“…The Good Point Set (GPS), nonlinear convergence factor, and adaptive t-distribution method improve BKA, which enhances exploration and exploitation performance, convergence speed, and solution quality. …”
Get full text
Get full text
Get full text
Article -
17
A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning.
Published 2024“…For case study 2, the ACO algorithm achieved a best distance of 1071 (u) with execution time 1.91 (s), while the GA algorithm resulted in a best distance of 1082 (u) with execution time 0.08 (s). …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
18
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…We have incorporated a fuzzy logic controller (FLC) to fine tune the optimization algorithm in run time. The FLC takes into consideration both the exploration and exploitation aspect of the GA. …”
Get full text
Get full text
Article -
19
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…We have incorporated a fuzzy logic controller (FLC) to fine tune the optimization algorithm in run time. The FLC takes into consideration both the exploration and exploitation aspect of the GA. …”
Get full text
Get full text
Article -
20
Workload performance evaluation of large spatial database for DSS based disaster management
Published 2017“…Data recorded in the shortest path analysis process reveals that the evaluation and the prediction on workload performance of shortest path analysis using Dijkstra algorithm has been well implemented. …”
Get full text
Get full text
Get full text
Get full text
Thesis