Search Results - (( _ simulation ((method algorithm) OR (path algorithm)) ) OR ( java application using algorithm ))
Search alternatives:
- method algorithm »
- java application »
- using algorithm »
- path algorithm »
-
1
A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance
Published 2022“…According to the results, the GLS algorithm outperformed the original laser simulator (LS) method in path and success rate. …”
Get full text
Get full text
Get full text
Get full text
Article -
2
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 -
3
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
Get full text
Thesis -
4
Simulation Of Path Optimisation Algorithms
Published 2017“…The main concern is to find and calculate the shortest distance from one node to another in the most efficient way. 3 algorithms (A* algorithm, Dijkstra algorithm and Greedy algorithm) and 2 concepts (Bidirectional Searching and Replanning) are explored and simulated. …”
Get full text
Get full text
Monograph -
5
Simulation method of shortest and safest path algorithm for evacuation in high rise building
Published 2014“…The objectives of this research are to identify the suitable shortest and safest path algorithm for evacuation, and followed by design and develop an evacuation preparedness model simulation via shortest path algorithm to choose a suitable exit route to evacuate the evacuees. …”
Get full text
Get full text
Get full text
Get full text
Article -
6
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…This means A • algorithm only calculates and consider the next node m path that has the lowest value of G and F, plus searching the shortest route by using heuristic estimation in Manhattan method. …”
Get full text
Get full text
Thesis -
7
Simulation performance comparison of A*, GLS, RRT and PRM path planning algorithms
Published 2022“…In this study, four robust path planning algorithms, namely: Probabilistic Roadmaps (PRMs), A-star, the Rapidly Exploring Random Trees (RRTs), and Generalized Laser Simulator (GLS), were simulated and their performance was measured and compared according to the total path distance covered, search time and path smoothness. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
8
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 -
9
Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm
Published 2023Subjects:Conference Paper -
10
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 -
11
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 -
12
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 -
13
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 -
14
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 -
15
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 -
16
Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis
Published 2021“…The IEEE-14 bus system was modeled in PSCAD software for simulating nineteen types of fault based on multi-objective shortest path algorithm. …”
Get full text
Get full text
Get full text
Article -
17
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 -
18
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text
Article -
19
Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control
Published 2016“…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 -
20
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
Get full text
Get full text
Article