Search Results - (( its ((application path) OR (application a)) algorithm ) OR ( _ application search algorithm ))*
Search alternatives:
- application search »
- application path »
- application a »
-
1
IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION
Published 2018“…Thus, the A* algorithm is implemented in a small mobile robot, this is to see its effectiveness in real world application. …”
Get full text
Get full text
Final Year Project -
2
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…This thesis also provides an explanation about the advantages. functions, characteristics. the degree of complexity in A • algorithm and its implementation in real-world application. …”
Get full text
Get full text
Thesis -
3
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 -
4
Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios
Published 2025“…While Dijkstra remains a reliable benchmark, A* offers a balanced trade-off between speed and path quality, making it more suitable for real-world path planning applications in both structured and unstructured environments.…”
Get full text
Get full text
Get full text
Article -
5
Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
Published 2017“…The algorithm searches in a weighted directed network to find the shortest path from a given node to every other node in the network. …”
Get full text
Get full text
Thesis -
6
-
7
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
Get full text
Get full text
Thesis -
8
-
9
Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).
Published 2007Get full text
Get full text
Conference or Workshop Item -
10
Reducing Iteration Using Candidate List
Published 2008Get full text
Get full text
Conference or Workshop Item -
11
-
12
Comprehensive review of the development of the harmony search algorithm and its applications
Published 2019“…This paper presents a comprehensive overview of the development of the harmony search (HS) algorithm and its applications. …”
Get full text
Get full text
Get full text
Article -
13
-
14
-
15
-
16
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 -
17
Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
Published 2017“…The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution; secondly, the algorithm has proven its success in solving the problem and finds a shortest route. …”
Get full text
Get full text
Get full text
Article -
18
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 -
19
-
20