Search Results - (( using simulation path algorithm ) OR ( using optimization modified algorithm ))*
Search alternatives:
- optimization modified »
- simulation path »
- path algorithm »
-
1
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 -
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
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 -
4
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 -
5
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 -
6
Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm
Published 2016“…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
7
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 -
8
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…Results: The analysis of computational results showed that the modified RTS algorithm provided a better solution quality in terms of minimizing the objective function of TSPs, while the SA algorithm was useful for obtaining instant solutions for TSPs with a large number of cities. …”
Get full text
Get full text
Get full text
Article -
9
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 -
10
Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm
Published 2015“…One of the solutions to this problem is by using mobile robots with concern on exploration algorithm for mobile robot. …”
Get full text
Get full text
Thesis -
11
-
12
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 -
13
Cut-off solar charge controller as an alternative towards system efficiency optimization
Published 2014“…The main difference between the method used in the proposed Cut-Off controller and other technique used in the past is that PV array output power is used directly through a bypass MOSFET to charge the battery bank when the voltage of the battery bank at lower level that its maximum while switching on another path when the batteries reaches its full charge value through another MOSFET to transfer this surplus power to what is called as an Auxiliary load ,fans or auxiliary battery used for system ventilation or solar tracking to reduce the ambient temperature for the system components, so adding more improvements on system performance, this would reduce the complexity of the system on one hand and produce a competitive efficiency, low cost and can be easily modified on the other hand.…”
Get full text
Get full text
Conference or Workshop Item -
14
Design of self-tuning minimum effort active noise control with feedback inclusion architecture
Published 2009“…It was found that the optimal controller designed using this technique which is constrained only by the accuracy of the two models identified using recursive least squares algorithm, yields good cancellation level. …”
Get full text
Get full text
Get full text
Article -
15
Enhancing Autonomous Guided Vehicles with Red-Black TOR Iterative Method
Published 2023“…By carefully choosing the optimal parameter values, the suggested B-MTOR improved the computational execution of the algorithm. …”
Get full text
Get full text
Get full text
Get full text
Article -
16
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 -
17
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 -
18
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 -
19
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 -
20
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