Search Results - (( based evaluation path algorithm ) OR ( based application study algorithm ))
Search alternatives:
- based application »
- application study »
- based evaluation »
- evaluation path »
- path algorithm »
-
1
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 -
2
Autonomous mobile robots path planning with integrative edge cloud-based ant colony optimization
Published 2025“…To address these challenges, this study proposes an Integrative Edge Cloud-Based Ant Colony Optimization (IECACO) algorithm. …”
Get full text
Get full text
Get full text
Get full text
Article -
3
Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios
Published 2025“…In the OSM-based scenarios, both algorithms yielded paths of identical length. …”
Get full text
Get full text
Get full text
Article -
4
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…Case study evaluation was conducted based on three industrial open source case studies in order to evaluate empirically the significant of the performance of the proposed method. …”
Get full text
Get full text
Get full text
Thesis -
5
Three-dimensional coverage control for multi-unmanned aerial vehicle
Published 2024“…The performance of the transitioned 3D algorithm is evaluated against the original 2D MBC algorithm in terms of computational load, convergence analysis, path length, coverage quality, and scalability. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
6
A new routing mechanism for energy-efficient in bluetooth mesh-low power nodes based on wireless sensor network
Published 2023“…The multi-criterion energyefficient routing mechanism uses the ACO algorithm, inspired by ants' foraging behaviour. In Bluetooth M-LPNWSN systems, virtual ants explore paths based on signal robustness, distances, and energy consumption. …”
Get full text
Get full text
Get full text
Thesis -
7
Comparison of performance and computational complexity of nonlinear active noise control algorithms
Published 2011“…The evaluation of the algorithms performance is standardized in terms of the normalized mean square error while the computational complexity is calculated based on the number of multiplications and additions in a single iteration. …”
Get full text
Get full text
Get full text
Article -
8
Token based path allocation approach for mobile robots in sorting centre for achieving high throughput
Published 2024“…This project proposes an improved path-finding algorithm that implements token-based path finding while a robot wants to access a grid cell. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
9
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…Their performances were compared and the appropriate algorithm for solving TSPs was then identified. The solution quality was evaluated using empirical testing, benchmark solutions and probabilistic analyses. …”
Get full text
Get full text
Get full text
Article -
10
-
11
Steganography based on utilizing more surrounding pixels
Published 2010“…The purpose of this study is to investigate the application of least significant bit insertion method (LSB) in concealing a definite amount of message bits inside a typical media such as an 8-bit gray-scale image and develop an alternative model structure selection algorithm based on considering more surrounding pixels in order to compute the best capacity value for each target pixel. …”
Get full text
Get full text
Thesis -
12
Adaptable decentralized orchestration engine for block structured non-transactional workflow in service oriented architecture.
Published 2011“…The latter considers the frequent-path adaptability and both of them together satisfy both frequent-path and proportionalfragment adaptability aspects; v) A Fuzzy Decentralization Decision Making algorithm (FDDM) is presented based on the fuzzy logic to choose a suitable method of decentralization that satisfies the three adaptability aspects frequent-path,proportional- fragment and available-bandwidth; and, vi) an algorithm is introduced for wiring of dynamic fragments. …”
Get full text
Get full text
Thesis -
13
A Fuzzy Logic Positional-Based Controller For Sensorbased Robotic Motion Planning
Published 2023“…Despite the large volume of research in this field, the computational complexity of the motion planning and the increasing potential application domains require more accurate and efficient motion planning algorithms. …”
Article -
14
Collision avoidance mechanisms using artificial potential field for UAVs
Published 2025“…The APF algorithm, based on the combination of attractive and repulsive potential functions, is modeled and simulated in MATLAB to guide UAVs toward target destinations while avoiding obstacles. …”
Get full text
Get full text
Get full text
Article -
15
-
16
Ant system with heuristics for capacitated vehicle routing problem
Published 2013“…Finally, the proposed ASH was tested on two well known benchmark data sets to evaluate its performance and effectiveness. The computational results suggest that the AS approach embedded with heuristic(s) outperforms the pure AS algorithm. …”
Get full text
Get full text
Thesis -
17
Ant colony optimization for vehicle traffic systems: applications and challenges
Published 2014“…Thus, ant-based algorithms are now being adopted by vehicle traffic systems VTSs to guide vehicles to less congested paths. …”
Get full text
Get full text
Get full text
Get full text
Article -
18
Solving vehicle routing problem by using improved genetic algorithm for optimal solution
Published 2023Article -
19
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2006“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Get full text
Get full text
Get full text
Article -
20
A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
Published 2011“…RTS is an improved method of TS and it dynamically adjusts tabu list size based on how the search is performed.The performance of SA, TS and RTS algorithms in solving TSP with different size of problems are evaluated by using empirical testing, benchmarking solution and simple probabilistic analysis. …”
Get full text
Get full text
Get full text
Monograph
