Search Results - time evaluation ((path algorithm) OR (based algorithm))
Search alternatives:
- time evaluation »
- path algorithm »
-
1
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text
Thesis -
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
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 -
4
Shortest Path Trajectory System Based on Dijkstra Algorithm
Published 2012“…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
5
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
Published 2011“…Subsequently, both algorithms were applied to the test environments. Finally, the performances of both algorithms were analyzed and evaluated based on the required criteria. …”
Get full text
Get full text
Thesis -
6
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
Get full text
Get full text
Thesis -
7
Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios
Published 2025“…In the OSM-based scenarios, both algorithms yielded paths of identical length. …”
Get full text
Get full text
Get full text
Article -
8
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
9
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 -
10
Biogeography based optimization (BBO) algorithm to minimise non-productive time during hole-making process
Published 2015“…The performance of proposed algorithm is evaluated based on various test problems adopted from the literature. …”
Get full text
Get full text
Get full text
Article -
11
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 -
12
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…Case study evaluation was conducted based on three industrial open source case studies in order to evaluate empirically the significant of the performance of the proposed method. …”
Get full text
Get full text
Get full text
Thesis -
13
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 -
14
Vision-based robot indoor navigation
Published 2022“…A navigation robot is built to test the workability and efficiency of the algorithms. In general, the algorithm can provide the nearest path to navigate around the environment without manual assistance. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
15
Dam haji game using A* search algorithm / Siti Farah Najwa Mukhlis
Published 2017“…The project is completed by going through the preliminary study phase, data preparation phase, system design and implementation phase, and the evaluation and result analysis phase. The results of this project is a Dam Haji game using A* algorithm which it is able to make legal movements based on the game’s rules and a matchup with a computer-based player that have gone through a process of computer learning to make movement based on the A* shortest path technique. …”
Get full text
Get full text
Thesis -
16
Transmission path optimization Based on Efficiency Communication System
Published 2022“…In this paper, routing attribute table that is maintained by the nodes, the density and relative distance of node distribution, is used to determine the clustering method. At the same time, the developed algorithm combines the relative position of the cluster and the base station to further improve the routing method of the sub-cluster head, Finally, the algorithm analyzes the influence of different parameters on the transmission path, and use the simulation experiments to evaluate the conclusions.…”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
Published 2021“…To evaluate the proposed algorithm, the solutions to the TSP problem obtained from the proposed algorithm and swap sequence based PSO are compared in terms of the best solution, mean solution, and time taken to converge to the optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
18
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…It calculates the appropriate adjustments for the control parameters such as selection and crossover rate. Possible attack paths are then identified and evaluated based on an attack graph representing the network under study. …”
Get full text
Get full text
Article -
19
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…It calculates the appropriate adjustments for the control parameters such as selection and crossover rate. Possible attack paths are then identified and evaluated based on an attack graph representing the network under study. …”
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