Search Results - (( based application path algorithm ) OR ( simulation optimization method algorithm ))
Search alternatives:
- based application »
- application path »
- method algorithm »
- path algorithm »
-
1
Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm
Published 2023“…The environment design for mobile robots' path planning based on industry environment shows excellent combinations with the GA method that generate the optimal path for the mobile robot with a semi-dynamic obstacle.…”
Get full text
Get full text
Get full text
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
Modelling of multi-robot system for search and rescue
Published 2023“…One of the key aspects in multi-robot systems is the path planning problem, which involves finding collision-free paths for each robot to reach their respective destinations while optimizing various performance metrics. This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
4
Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article
Published 2012“…This will cause disadvantages in the performance and speed level of the Smith-Waterman Algorithm. Thus, based on other researchers there was various kind of method being use in order to overcome this problem. …”
Get full text
Get full text
Article -
5
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…This increases the complexity to route later nets and makes routing longer than optimal, or sometimes impossible to complete. The solution is further refined by re-routing all nets in different orders using simulated annealing method. …”
Get full text
Get full text
Get full text
Article -
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
Optimised multi-robot path planning via smooth trajectory generation
Published 2024“…Compared to a single robot, an MRS is more effective and robust in completing tasks, even when one robot breaks down. Particle swarm optimization (PSO) outperforms conventional methods like artificial potential fields (APF), the Dijkstra algorithm, and the A* algorithm in path planning for mobile robots. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
8
-
9
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…The whole constraint analyzer and the fitness function were combined with four SBTs (genetic algorithm, evolutionary algorithm, simulating annealing, and quantum genetic algorithm). …”
Get full text
Get full text
Get full text
Thesis -
10
Reliable Fuzzy-Based Multi-Path Routing Protocol Based on Whale Optimization Algorithm to Improve QOS in 5G Networks for IOMT Applications
Published 2024“…The Whale Optimization Algorithm (WOA) enhances the routing protocol performance. …”
Article -
11
A novel bio-inspired routing algorithm based on ACO for WSNs
Published 2019“…A novel approach of ant colony optimization (ACO) algorithm for discovering the optimum route for information transmission in the WSNs is proposed here for optimization and enhancement. …”
Get full text
Get full text
Get full text
Get full text
Article -
12
Three-dimensional coverage control for multi-unmanned aerial vehicle
Published 2024“…This project aims to model and simulate a group of quadrotors for area coverage in 3D space with the objectives of reviewing existing MUAV coverage methods, algorithm development, and assessing computational load, convergence, path length, coverage quality, and scalability in both Two-Dimensional (2D) and 3D spaces. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
13
-
14
Simulation of spline based NC- manufacturing of plastic optical components
Published 2011Get full text
Get full text
Conference or Workshop Item -
15
A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
Published 2011“…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
Get full text
Get full text
Get full text
Monograph -
16
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…The modified RTS algorithm also performed better compared to the existing heuristic methods. …”
Get full text
Get full text
Get full text
Article -
17
Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm
Published 2015“…Developing an exploration algorithm based on spanning tree is the main contribution. …”
Get full text
Get full text
Thesis -
18
Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network
Published 2018“…Coverage and energy efficiency metrics are two fundamental issues for almost all types of application in wireless sensor network (WSNs).Coverage reflects how well an area is monitored by sensor nodes and in energy efficient networks where less energy is consumed to provide the same level of services.These twin specifics are presented to evaluate the performance of a wireless sensor network.Due to its simplicity and ease of analysis,full coverage is widely implemented in many theoretical studies.However,sometimes full coverage is not the best way to represent some real-world application due to its strong restrictions and its deterministic characteristics.In this thesis,Modified Harmony Search algorithm (MHS) is proposed to achieve a sensor node deployment such that the covered area is optimal and data transfer has low energy consumption.Through computer simulations, experimental results verified that the proposed method improved the coverage of area in compare to some related methods.Based on the result obtain from every experiments,coverage area percentage performance is affected by the number of hotspots.This is shown by Harmony Search (HS) based method where the coverage area percentage increases as the number of hotspot increase. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks
Published 2012“…The performance of the proposed algorithms has been studied through simulations and a significant improvement in terms of energy consumption, energy efficiency, energy balancing and packet delivery ratio has been achieved. …”
Get full text
Get full text
Thesis -
20
Adaptive model predictive control based on wavelet network and online sequential extreme learning machine for nonlinear systems
Published 2015“…On the other hand, an adaptive model predictive controller (WNMPC) based on LWN-OSELM modelling method is proposed for nonlinear system control applications. …”
Get full text
Get full text
Thesis
