Search Results - (( using simulation approach algorithm ) OR ( based optimization path algorithm ))
Search alternatives:
- optimization path »
- path algorithm »
-
1
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text
Thesis -
2
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
Get full text
Get full text
Thesis -
3
Simulation of identifying shortest path walkway in library by using ant colony optimization
Published 2012“…A research is proposed based on Ant Colony Optimization for solving the shortest path problem in library.This is a research that the algorithm is aim to implement on a robot. …”
Get full text
Get full text
Undergraduates Project Papers -
4
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text
Article -
5
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
Published 2014“…In this thesis, a smart QoS-aware service composition approach is proposed. The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
6
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
Get full text
Get full text
Thesis -
7
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 -
8
A noble approach of ACO algorithm for WSN
Published 2018“…The proposed algorithm has been simulated and verified utilizing MATLAB and the simulation results demonstrate that new ant colony optimization based algorithm can achieve better performance and faster convergence to determine the best cost route.…”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
9
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…The algorithm which consider the error value, e to increment pixels is the crucial part of the line generation applies the same concept in the second approach, where the error value, e is used as indicator to determine the heuristic cost of the path. …”
Get full text
Get full text
Get full text
Thesis -
10
Multi agent quality of service routing based on scheme ant colony optimization algorithm
Published 2014“…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
Get full text
Get full text
Thesis -
11
Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Hierarchical gaussian reinforcement learning for path planning in uncertain environments
Published 2015“…The simulation experimental results seem suggest the efficiency of the proposed algorithm in finding optimal paths of autonomous agents.…”
Get full text
Get full text
Get full text
Article -
13
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…A model-driven approach was used for generating abstract test cases from the feasible paths. …”
Get full text
Get full text
Get full text
Thesis -
14
A novel bio-inspired routing algorithm based on ACO for WSNs
Published 2019“…The proposed algorithm has been simulated and verified using MATLAB and the simulation results demonstrate that new ACO based algorithm achieved improved performance, about 30% improvement compared with the traditional ACO algorithm, and faster convergence to determine the best cost route, and recorded an improvement in the energy consumption of the nodes per transmission.…”
Get full text
Get full text
Get full text
Get full text
Article -
15
Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri
Published 2013“…The main objectives of this project is to design the DNA sequence generator module using the Eulerian Path algorithm. This project is designed based on speed optimization. …”
Get full text
Get full text
Student Project -
16
Hybrid optimal path traceback system development for optimization DNA sequences alignment
Published 2012“…This paper present the new hybrid optimal path trace back system development for solving optimal path trace back complexity issue. …”
Get full text
Get full text
Student Project -
17
Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article
Published 2012“…This paper present the new hybrid optimal path trace back system development for solving optimal path trace back complexity issue. …”
Get full text
Get full text
Article -
18
-
19
Accurate range free localization in multi-hop wireless sensor networks
Published 2019“…The performance is evaluated in terms of RMSE in terms of three algorithms WLS, CRLR, and GMSDP based on using the Monte Carlo simulation with account the number of anchors that varying from anchor=4 to anchor =20. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Predetermined path of mobile data gathering in wireless sensor networks based on network layout
Published 2014“…There are two prevailing strategies used to collect data in sensor networks. The first approach requires data packets to be serviced via multi-hop relay to reach the respective base station (BS). …”
Get full text
Get full text
Article
