Search Results - (( developing application path algorithm ) OR ( java application bees algorithm ))
Search alternatives:
- developing application »
- application path »
- java application »
- application bees »
- path algorithm »
- bees algorithm »
-
1
-
2
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 -
3
-
4
Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control
Published 2016“…Using this method, the need for the knowledge of the degree of nonlinearity in advance can be avoided. The proposed algorithm models the Wiener-Hammerstein linear and nonlinear components in the secondary path and applies the estimated degree of nonlinearity of the nonlinear secondary path in the control algorithm design.In previous works, SEF-NLFXLMS and THF-NLFXLMS algorithms for Hammerstein and Wiener structures were developed where the acoustic path is assumed to be a unit gain. …”
Get full text
Get full text
Thesis -
5
Path planning for unmanned aerial vehicles using visibility line-based methods
Published 2011“…Simulation results have proven that the proposed 2D path planning algorithms are much faster in comparison with the VG and hence are suitable for real time path planning applications. …”
Get full text
Get full text
Thesis -
6
Dynamic path planning algorithm in mobile robot navigation
Published 2011“…MATLAB simulation is developed to verify and validate the algorithm before they are real time implemented on Team AmigoBotTM robot. …”
Get full text
Get full text
Conference or Workshop Item -
7
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 -
8
A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance
Published 2022“…With application of the all-direction border scan, it outperforms the A-star (A*) and PRM algorithms and provides safer and shorter paths. …”
Get full text
Get full text
Get full text
Get full text
Article -
9
Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques
Published 2024“…Fuzzy arithmetic operations on fuzzy numbers and artificial neural networks with a back-propagation learning algorithm were used to represent the structure of the neuro-fuzzy risk assessment model, whereas genetic algorithms were used to develop the safe path selection model. …”
thesis::doctoral thesis -
10
Modelling of multi-robot system for search and rescue
Published 2023Get full text
Get full text
Final Year Project / Dissertation / Thesis -
11
-
12
-
13
-
14
-
15
AUTOMATIC ROUTE FINDER FOR NEW VISITORS
Published 2006“…This project proposes a new visitor route model that is based on shortest path algorithms for road networks. Shortest path problems are among the best studied network flow optimization problems, with interesting applications in a range of fields. …”
Get full text
Get full text
Final Year Project -
16
-
17
-
18
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
19
Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm
Published 2023“…Thus, this thesis aims to develop a mobile robot for industrial applications by leveraging a genetic algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan
Published 2017“…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
Get full text
Get full text
Thesis
