Search Results - (( making based path algorithm ) OR ( java application optimized algorithm ))

Refine Results
  1. 1

    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

    Published 2020
    “…All Possible Path Algorithm (APPA) was another algorithm that was also used to rank all the alternatives path based on multiple criteria. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

    Published 2013
    “…Although several extensions of the sampling-based algorithms have been proposed for solving each drawback, but the lack of a randomized planner that overcomes abovementioned inefficiencies in a single package is evident and makes the sampling-based path planning less effective for certain purposes. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group by Azali Saudi, Jumat Sulaiman

    Published 2014
    “…In this paper, a robust searching algorithm to generate path planning for mobile robot is proposed. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

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

    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
  9. 9

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  10. 10

    Resource-efficient coverage path planning for unmanned aerial vehicle based aerial gateway in LoRaWAN by Ibrahim, Nurul Saliha Amani

    Published 2022
    “…With efficient path planning along with mobile nature of AG, enabled it to hover at each stop points thus making it ideal to be used in remote areas where fixed base station is not accessible, crowded areas with high demand, and in emergency situations.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13
  14. 14

    Study and Designing of Digital Three-Dimension Space Visualizer for Centralize Drone Performance by Kiun, Sie Suai [

    Published 2019
    “…A framework will be created base on the algorithm make using Delaunay Triangulation method which discussed in chapter 3. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  15. 15

    Utilization of Tabu search heuristic rules in sampling-based motion planning by Khaksar W., Hong T.S., Sahari K.S.M., Khaksar M.

    Published 2023
    “…We propose a sampling-based algorithm for path planning in unknown environments using Tabu search. …”
    Conference Paper
  16. 16

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…The performance of PSO was then compared with other meta-heuristic algorithms, including Genetic Algorithm (GA) and Ant Colony Optimisation (ACO), Whale Optimisation Algorithm (WOA), Ant Lion Optimiser (ALO), Dragonfly Algorithm (DA), Grasshopper Optimisation Algorithm (GOA), Moth Flame Optimisation (MFO) and Sine Cosine Algorithm (SCA). …”
    Get full text
    Get full text
    Thesis
  17. 17

    Motion Control Algorithm for Path Following and Trajectory Tracking for Unmanned Surface Vehicle: A Review Paper by Putri Nur Farhanah, Mohd Shamsuddin, Muhamad Arifpin, Mansor

    Published 2021
    “…As the conclusion, various types of mathematical computation are introduced in the USV control system is customizes with the requirement based on the situation needed will make this autonomous vehicle more advanced.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Resource-Efficient Coverage Path Planning for UAV-Based Aerial IoT Gateway by Nurul Saliha A. Ibrahim, Nurul Saliha A. Ibrahim, Faiz A. Saparudin, Faiz A. Saparudin

    Published 2023
    “…The EECPP is composed of two algorithms: the Stop Point Prediction Algorithm using K-Means, and Path Planning Algorithm using Particle Swarm Optimization. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article