Search Results - same ((drops algorithm) OR (((path algorithm) OR (search algorithm))))

Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

“…It needs the appropriate algorithm to search the shortest path. Therefore, the purpose of this research is to explore which is the best shortest path algorithm by comparing the two types of algorithms. …”
Get full text
Get full text
Get full text
Get full text

Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

“…If all the robots use the same path planning algorithm, it is possible that they may not bring the greatest benefit. …”
Get full text
Get full text

Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

“…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text

Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

“…This paper develops a path planning algorithm of hyper-redundant manipulators to achieve a cyclic property. …”
Get full text
Get full text
Get full text

Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah A., Parman S., Abbasi A., Solihin M.I., Manan T.S.A., Beddu S., Ahmad A., Rasdi N.W.

Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm by Enshaei, Mehdi

“…Throughput and packet overhead is improved in the NIPT algorithm with an average of 4% and 6% respctively over the PT algorithm. …”
Get full text
Get full text

Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

“…In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
Get full text
Get full text
Get full text

Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

“…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
Get full text
Get full text
Get full text

Token based path allocation approach for mobile robots in sorting centre for achieving high throughput by Khoo, Zong Zheng

“…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

Vehicle pick-up and drop-off schedule optimization in a university setting by Teo, Chun Kit

“…A simulated annealing-based multi-directional iterative local search algorithm is employed for solution optimization. …”
Get full text
Get full text

Efficient task scheduling strategies using symbiotic organisms search algorithm for cloud computing environment by Sa'ad, Suleiman

“…However, the efficiency of the clouds drops as the size of the search space gets larger, like in the case of most metaheuristic optimisation algorithms. …”
Get full text
Get full text

Application of Genetic Algorithm in solving Tourist Routing Problem by Yusof, Siti Sarah

“…TRP is a variance of Travelling Salesman Problem (TSP) which can defined by finding the optimal path to travel from point A to point B by going through the same place not more than twice at a shortest distance. …”
Get full text
Get full text

The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi by Mohd Radzi, Mohamad Khairul Ikhwan

“…However, for optimum distance, dijkstra algorithm has been used. This algorithm is one of the algorithms used for getting the lowest cost search path. …”
Get full text
Get full text

Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

“…For the purpose of testing the algorithm’s capability and reliability, it was applied to solve the same problem online validated and it achieved success in finding a shorter route. …”
Get full text
Get full text
Get full text

Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

“…The RRSEB operations focus on enhancement of the path recovery process, this is done by introducing proactively route mechanism to create alternative paths together with the data routing obtained by path discovery stage in order to reduce the packet drops. …”
Get full text
Get full text

Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network by Halim, Nurul Hamimi

“…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

Efficient multi-UAV coordination via rl: joint path planning and task scheduling for post-disaster UAV-assisted MEC systems by Adnan, Mohd Hirzi, Ahmad Zukarnain, Zuriati, Subramaniam, Shamala K.

“…In this paper, we propose the Geometric Reinforcement Learning Algorithm (GRLA), a unified framework for joint path planning and task scheduling in multi-UAV MEC systems. …”
Get full text
Get full text
Get full text
Get full text

Genetic algorithm based network coding in wireless ad hoc networks by Tan, Shee Eng

“…Therefore, coding-aware routing is important to explore the data traffic flows with more network coding opportunities. Genetic algorithm based coding-aware routing (GACAR) is embedded in the wireless ad hoc network with network coding capabilities to search for coding opportunities for unicast sessions. …”
Get full text
Get full text
Get full text

A real-time integrated fire detection and alarm (FDA) system for network based building automation by Anwar, Farhat, Islam, Rounakul, Hussain, Sabahat, Rashid, Muhammad Mahbubur, Shaikh, Zuhaib

“…Methods/Analysis: In this work, the shortest path algorithm was chosen for series of buildings connected by a fiber-optic network. …”
Get full text
Get full text
Get full text