Search Results - (( based making based algorithm ) OR ( using optimization path 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

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

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

    Published 2013
    “…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
    Get full text
    Get full text
    Thesis
  4. 4

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

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

    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman by Isman, Muhammad Iskandar

    Published 2017
    “…Therefore, in this research, will be use Ant Colony Optimization (ACO) algorithm as an optimize technique that provide a shortest path of defining a successor that is their highest value of criteria. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…The amount of phenomenon on the shortest path proves that ACO-based approach is capable to optimize the route taken for CNC machine in order to drill the holes on PCB. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  8. 8

    Dam haji game using A* search algorithm / Siti Farah Najwa Mukhlis by Mukhlis, Siti Farah Najwa

    Published 2017
    “…The results of this project is a Dam Haji game using A* algorithm which it is able to make legal movements based on the game’s rules and a matchup with a computer-based player that have gone through a process of computer learning to make movement based on the A* shortest path technique. …”
    Get full text
    Get full text
    Thesis
  9. 9

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

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

    Published 2022
    “…EECPP consist of two algorithms which is Stop Point Prediction Algorithm using K-Means, which finding the stop point for the AG after grouping the IDs into clusters, and Path Planning Algorithm using Particle Swarm Optimization which connect all of the stop point in shortest route. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

    Published 2024
    “…A MPSO algorithm, without path smoothening, is used for comparison. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  12. 12

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

    Optimized topology control in mobile IP networks using a new parametric routing algorithm by Gholizadeh, Somayyeh, Abdullah, Azizol, Othman, Mohamed, Mohd Hanapi, Zurina

    Published 2018
    “…Then, a new optimal routing algorithm is proposed to make up the node failure and changing Foreign Agent (FA). …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments by Jauwairia Nasir, Fahad Islam, Yasar Ayaz

    Published 2013
    “…The recent development of its variant: RRT* is considered as a major breakthrough as it makes it possible to achieve optimality in paths planning. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar, Weria, Tang, Sai Hong, Mohamed Sahari, Khairul Salleh, Khaksar, Mansoor, Toressen, Jim

    Published 2019
    “…Despite the proven advantages of sampling-based motion planning algorithms, their inability to handle online navigation tasks and providing low-cost solutions make them less efficient in practice. …”
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Smart Microgrid QoS and Network Reliability Performance Improvement using Reinforcement Learning by Singh, N., Elamvazuthi, I., Nallagownden, P., Badruddin, N., Ousta, F., Jangra, A.

    Published 2021
    “…The work is tested and compared with four routing oriented decision-making algorithms, Open shortest path first (OSPF), Optimized link state routing (OLSR), Routing information protocol (RIP) and Multi-agent based Bellmanford routing (MABR). …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20