Search Results - (( _ application ((amh algorithm) OR (path algorithm)) ) OR ( based application a algorithm ))*

Partitional clustering algorithms for highly similar and sparseness y-short tandem repeat data / Ali Seman by Seman, Ali

“…The idea was incorporated into a new algorithm called, k-Approximate Modal Haplotypes (&-AMH) algorithm. …”
Get full text
Get full text

IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

“…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
Get full text
Get full text

Modelling of multi-robot system for search and rescue by Poy, Yi Ler

Get full text
Get full text

The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

Get full text
Get full text

Path planning for constant speed robot by Abdullah @ Idris, Ahmad Takiyuddin

Get full text
Get full text

Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

“…Simulation results have proven that the proposed 2D path planning algorithms are much faster in comparison with the VG and hence are suitable for real time path planning applications. …”
Get full text
Get full text

Mobile robot path planning using hybrid genetic algorithm and traversability vectors method by Loo, C.K., Rajeswari, M., Wong, E.K., RaoTask, M.V.C.

“…Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. …”
Get full text
Get full text
Get full text

Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

“…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
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

“…Finally, the two algorithms were fused together and we conducted four experiments to validate the performance of the MANOA, IDWA, and MANOA-IDWA algorithms, as well as the application of MANOA-IDWA in multi-robot path planning. …”
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

Get full text
Get full text

MULTIPLE DRONES PATH OPTIMIZATION ALGORITHM FOR 3D SPACE PERFORMANCE USING CENTRALIZED VISUALIZATION PLATFORM by Teng, Chu Yao

“…The existing methods aim for planning optimal path of drone flight. In this report, a variant of A*, Theta* algorithm is proposed to find the optimal path within a grid-based environment. …”
Get full text
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. …”

Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

“…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
Get full text
Get full text

A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

“…However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. …”

Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

“…Thus, this thesis aims to develop a mobile robot for industrial applications by leveraging a genetic algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text

Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

“…Filtered-X least mean square (FXLMS) control algorithm is a conventional algorithm employed to cancel the noise in linear environment. …”
Get full text
Get full text

Extensions to the K-AMH algorithm for numerical clustering by Seman, Ali, Mohd Sapawi, Azizian

Get full text
Get full text
Get full text

Link utilization of GA-based QoS routing algorithm by Yussof S., See O.H.

“…In the previous work, a GA-based QoS routing algorithm has been proposed and the performance of the algorithm with respect to its ability to a find a feasible path has been evaluated. …”

AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

“…Shortest path finding algorithms are necessary in road network of a city or country for tourists and visitors. …”
Get full text
Get full text

Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

Get full text
Get full text