Search Results - (( _ application using algorithm ) OR ( its application ((path algorithm) OR (search algorithm)) ))
Search alternatives:
- using algorithm »
- path algorithm »
-
1
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…It has been applied in many practical applications. For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
Get full text
Get full text
Thesis -
2
Comparison of path planning in simulated robot
Published 2020“…This is because each path planning algorithm has its own applicable domain, performance, advantages and disadvantages in various situations. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
3
Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
Published 2017“…This route-finding problem is one of the most important computer applications in the transportation industry. In network theory, it’s known as the shortest-path problem, and Dijkstra’s algorithm is usually used to solve it. …”
Get full text
Get full text
Thesis -
4
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 -
5
-
6
Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).
Published 2007Get full text
Get full text
Conference or Workshop Item -
7
-
8
Reducing Iteration Using Candidate List
Published 2008Get full text
Get full text
Conference or Workshop Item -
9
-
10
-
11
-
12
IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION
Published 2018“…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
Get full text
Get full text
Final Year Project -
13
Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
Published 2017“…Approach: The approach has been presented based on two phases: firstly, the algorithms have been adapted to solve the research problem, where its procedure is different than the common algorithm. …”
Get full text
Get full text
Get full text
Article -
14
-
15
Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…There were also attempts to hybridize SKF with other famous algorithms such as Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Sine Cosine Algorithm (SCA) to improve its performance. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
-
17
Implementation of autonomous vehicle navigation algorithms using event-driven programming
Published 2012Get full text
Get full text
Get full text
Conference or Workshop Item -
18
Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network
Published 2018“…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios
Published 2025“…On the other hand, Dijkstra's algorithm, though robust and optimal, exhibited longer runtimes and produced paths with more turns due to its exhaustive search approach. …”
Get full text
Get full text
Get full text
Article -
20
Robot path planning using family of SOR iterative methods with laplacian behaviour-based control
Published 2015“…In addition, the newly proposed LBBC overcomes the drawback of the existing GDS that face difficulty when handling complex environment. Finally, the path planning problem is solved by combining the fast iterative method with the robust path searching LBBC technique, so that the path planning algorithm is capable of handling large and complex environment.…”
Get full text
Get full text
Get full text
Thesis
