Search Results - (( using simulation ((method algorithm) OR (path algorithm)) ) OR ( java application _ algorithm ))
Search alternatives:
- method algorithm »
- java application »
- path algorithm »
-
1
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text
Thesis -
2
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
Get full text
Thesis -
3
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
Get full text
Get full text
Thesis -
4
Simulation Of Path Optimisation Algorithms
Published 2017“…Likewise, when comparing between Bidirectional Searching with Replanning and Unidirectional Searching with Replanning, a decrease of 41.08%, 25.57% and 14.41% on algorithm total time can be seen. Thus, in this final year project, the optimum algorithm to use is A* algorithm with Bidirectional Searching method and Replanning method included during the searching process. …”
Get full text
Get full text
Monograph -
5
Novel algorithm for mobile robot path planning in constrained environment
Published 2021“…Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text
Get full text
Article -
6
An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town
Published 2005“…Both algorithms are compared. Simulation is used as a method in this study. …”
Get full text
Get full text
Get full text
Thesis -
7
New algorithm for autonomous dynamic path planning in real-time intelligent robot car
Published 2017“…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
Get full text
Get full text
Get full text
Article -
8
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 -
9
Novel algorithm for mobile robot path planning in constrained environment
Published 2022“…Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text
Article -
10
Novel algorithm for mobile robot path planning in constrained environment
Published 2022“…Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text
Article -
11
Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm
Published 2023Conference Paper -
12
-
13
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Hence, the results of the optimization were implemented in MasterCAM software to run the machining simulation. Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
14
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Hence, the results of the optimization were implemented in MasterCAM software to run the machining simulation. Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
15
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Hence, the results of the optimization were implemented in MasterCAM software to run the machining simulation. Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
16
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Hence, the results of the optimization were implemented in MasterCAM software to run the machining simulation. Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
17
Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control
Published 2016“…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
Get full text
Get full text
Thesis -
18
Path planning algorithm for a car-like robot based on cell decomposition method
Published 2013“…This project proposes an obstacle avoiding path planning algorithm based on cell decomposition method for a car-like robot. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…The solution is further refined by re-routing all nets in different orders using simulated annealing method. Through simulation program, our proposed algorithm succeeded in performing complete routing up to 81 nodes with 40 nets in 9×9 SD-Torus network size.…”
Get full text
Get full text
Get full text
Article -
20
Modelling of multi-robot system for search and rescue
Published 2023“…Moreover, to cope with dynamic environments, a combination of global and local path planning methods is introduced. The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis
