Search Results - (( based optimization modified algorithm ) OR ( using simulation path algorithm ))
Search alternatives:
- optimization modified »
- simulation path »
- path algorithm »
-
1
Modelling of multi-robot system for search and rescue
Published 2023“…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 -
2
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
Get full text
Get full text
Get full text
Thesis -
3
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text
Thesis -
4
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 -
5
Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
Published 2022“…As a multi-agent algorithm, every agent in the population acts as a Kalman filter by using a standard Kalman filter framework, which includes a simulated measurement process and a best-so-far solution as a reference. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
6
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 -
7
Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network
Published 2018“…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
8
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 -
9
Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network
Published 2020“…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
Get full text
Get full text
Thesis -
10
Cut-off solar charge controller as an alternative towards system efficiency optimization
Published 2014“…Based on the concept of optimizing the efficiency of the automated solar system in residential buildings application, this paper proposed a High efficiency solar Cut-Off charge controller as an alternative to the main solar charge controller in most conventional buildings solar system, the idea is to design an electronic circuit with low losses as a compared with the conventional charge controller to be a part of the integrated and automated building solar system, the design has an algorithm based on some environment parameters like sun Irradiance and weather temperature, this algorithm seems to be inversely calculated because its start from the value of full charge battery voltage. …”
Get full text
Get full text
Conference or Workshop Item -
11
SNR-Based OLSR Routing Protocol for Wireless Mesh Networks
Published 2009“…Unfortunately the routing protocols used such as AODV and Dynamic source routing (DSR) are hop count-based; where the routing algorithm uses the number of nodes to determine the optimum path to the destination. …”
Get full text
Get full text
Thesis -
12
Comparison of path planning in simulated robot
Published 2020“…Thus, a comparison of path planning algorithm in simulated robot will be conducted in this study. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
13
Implementation of laser simulator in robot path determination
Published 2016“…In addition, one of the classical path planning approach which is A* algorithm will be used to compare the result generated by laser simulator. …”
Get full text
Get full text
Undergraduates Project Papers -
14
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 -
15
Global Mobile Robot Path Planning using Laser Simulator
Published 2017“…From the results, the laser simulator has advantages in computational time and low collision possibility in comparison with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
16
Autonomous path planning robot using geographical information
Published 2008“…The development of the path planning algorithm is initially presented by the geometrical analysis and it is then analyzed by simulation using Matlab. …”
Get full text
Learning Object -
17
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 -
18
Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space
Published 2015“…A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
Get full text
Get full text
Get full text
Article -
19
Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site
Published 2017“…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
Get full text
Get full text
Final Year Project -
20
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…All simulations were performed using MATLAB with visualization of UAV path planning. …”
Get full text
Get full text
Thesis
