Search Results - (( _ ((evaluation path) OR (evaluation a)) algorithm ) OR ( panel notification based algorithm ))

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

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

Evaluation of Visual Network Algorithms on Historical Documents by Khairunnisa, Binti Ibrahim

“…Therefore, for a new document, evaluation of algorithms is ineluctable. …”
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. …”

Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

“…Experiments via WEKA tool and simulation prototype were conducted to evaluate the methods used. For the runtime path prediction method, the results showed that the path prediction method achieved promising prediction accuracy, and the number of paths involved in the prediction did not affect the accuracy. …”
Get full text
Get full text
Get full text
Get full text

Three-dimensional coverage control for multi-unmanned aerial vehicle by Siow, Wen Hao

“…Hence, this research addresses the development and evaluation of a Three-Dimensional (3D) coverage control algorithm for Multi Unmanned Aerial Vehicle (MUAV). …”
Get full text
Get full text

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

“…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
Get full text
Get full text
Get full text
Get full text

A multi-objective parametric algorithm for sensor-based navigation in uncharted terrains by Khaksar W., Sahari K.S.M.

“…In this paper, a novel parametric algorithm is proposed that is able to handle different planning goals by means of a set of objective-controller parameters. …”

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

“…The effectiveness of the proposed algorithm is evaluated through simulation. 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. …”

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

“…Active measurement techniques performed by overlay nodes can provide bandwidth estimations of an end-to-end overlay path. This thesis describes a new algorithm called “COPPA,” which is an in-band path probing algorithm for measuring the end-to-end available bandwidth of an overlay path accurately and continuously. …”
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

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

Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm by Krishnan P.S., Paw J.K.S., Kiong T.S.

Subjects:

Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

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

The impact of clustering on the average path length in wireless sensor networks by Aziz, A.A., Şekercioğlu, Y. A.

“…This property is evaluated by comparing the performance of several clustering algorithms with respect to the average path length. …”
Get full text
Get full text
Get full text

An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

“…The objectives of this study are to explore and evaluate the Ant System (AS) algorithm and Ant Colony System (ACS) algorithm in finding shortest paths. …”
Get full text
Get full text
Get full text

Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios by Yusuf, Zakariah, Mohamad, Sufian, Wan Ibrahim, Wan Suhaifiza

“…This paper presents a comparative study of the A* and Dijkstra algorithms for path planning in both 2D grid maps and real-world OpenStreetMap (OSM) environments. …”
Get full text
Get full text
Get full text