Search Results - (( _ evaluation path algorithm ) OR ( wave optimization path algorithm ))

Development of a State-Space Observer for Active Noise Control Systems by Muhssin, Mazin T.

“…The secondary path of the ANC system is modeled by using the LMS algorithm to complete the design of the Filtered-X Least Mean Square (FXLMS) controller. …”
Get full text
Get full text

Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
Get full text
Get full text
Get full text

Efficient and scalable ant colony optimization based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

“…The proposed routing algorithm is simulated using MATLAB for performance evaluations. …”
Get full text
Get full text
Get full text
Get full text

Efficient relay placement algorithm using landscape aware routing (erpalar) by Onabajo, Olawale Olusegun

“…ERP ALAR was implemented in Matlab R2009a using Genetic Algorithm (GA) with multi-objectives. GA is an optimization algorithm that simulates natural selection process as found in nature. …”
Get full text
Get full text

A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

“…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text

A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance by Muhammad, Aisha, Ali, Mohammed A.H., Turaev, Sherzod, Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Shanono, Ibrahim Haruna, Alzaid, Zaid, Alruban, Abdulrahman, Alabdan, Rana, Dutta, Ashit Kumar, Almotairi, Sultan

“…An optimal path between the start and target point is found by forming a wave of points in all directions towards the target position considering target minimum and border maximum distance principles. …”
Get full text
Get full text
Get full text
Get full text

Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

“…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text
Get full text

Novel algorithm for mobile robot path planning in constrained environment by Aisha, Muhammad, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi Faiz, ., Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

“…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text

Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi, Faiz, Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

“…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text

Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin by Sariff, Nohaidda, Buniyamin, Norlida

“…Performances between both algorithms were compared and evaluated in terms of speed and number of iterations that each algorithm takes to find an optimal path within several selected environments. …”
Get full text
Get full text
Get full text

Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

“…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
Get full text
Get full text
Get full text

A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text

Quantitative and qualitative analysis of unmanned aerial vehicle's path planning using master-slave parallel vector-evaluated genetic algorithm

Get full text

Master-Slave Parallel Vector-Evaluated Genetic Algorithm for Path Planning of Unmanned Aerial Vehicles by Pierre, Djamalladine Mahamat

Get full text

Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis by Awalin, Lilik J., Syahirah, Abd Halim, Jafferi, Jamaludin, Nor Azuana, Ramli

“…To evaluate the performance of the multi-objective shortest path algorithm, all sections of the IEEE-14 bus system were simulated with faults. …”
Get full text
Get full text
Get full text

Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions by Ting Kien Hua, Noraini Abdullah

“…Dijkstra’s algorithm was one of the shortest path algorithms that would be used to identify the path with the least cost. …”
Get full text
Get full text
Get full text

Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

“…Subsequently, both algorithms were applied to the test environments. Finally, the performances of both algorithms were analyzed and evaluated based on the required criteria. …”
Get full text
Get full text

A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

“…Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. The obtained results show that the continuous in-band overlay path probing algorithm (COPPA) provides up-to-date bandwidth information with reduced overhead and minimal impact on the traffic of the path.…”
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. …”

Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

“…This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. …”
Get full text
Get full text
Get full text
Get full text