Search Results - (( based application search algorithm ) OR ( its application path algorithm ))*
Search alternatives:
- application search »
- based application »
- application path »
- its application »
- path algorithm »
-
1
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 -
2
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 -
3
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 -
4
Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
Published 2017“…Dijkstra’s algorithm is one of the classic shortest path search algorithms. …”
Get full text
Get full text
Thesis -
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network
Published 2018“…Coverage and energy efficiency metrics are two fundamental issues for almost all types of application in wireless sensor network (WSNs).Coverage reflects how well an area is monitored by sensor nodes and in energy efficient networks where less energy is consumed to provide the same level of services.These twin specifics are presented to evaluate the performance of a wireless sensor network.Due to its simplicity and ease of analysis,full coverage is widely implemented in many theoretical studies.However,sometimes full coverage is not the best way to represent some real-world application due to its strong restrictions and its deterministic characteristics.In this thesis,Modified Harmony Search algorithm (MHS) is proposed to achieve a sensor node deployment such that the covered area is optimal and data transfer has low energy consumption.Through computer simulations, experimental results verified that the proposed method improved the coverage of area in compare to some related methods.Based on the result obtain from every experiments,coverage area percentage performance is affected by the number of hotspots.This is shown by Harmony Search (HS) based method where the coverage area percentage increases as the number of hotspot increase. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
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
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 -
15
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 -
16
A Hybrid Metaheuristic Technique Based on Grey Wolf Optimisation, Symbiotic Organism Search, and Ant Colony Optimisation for Solving Multi-Objective Vehicle Routing Problems
Published 2025“…The algorithm was first developed and tested using a standard benchmark dataset (Dantzig42), which was selected due to its standard usage in VRP research and its suitability for performance comparison owing to its structured complexity. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
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
-
19
Dynamic interactive 3D mobile navigation aid
Published 2012Get full text
Get full text
Get full text
Article -
20
An experiment on the performance of shortest path algorithm
Published 2016Get full text
Get full text
Get full text
Conference or Workshop Item
