Search Results - (( its application ((path algorithm) OR (_ algorithm)) ) OR ( based application need algorithm ))

Refine Results
  1. 1

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

    Published 2017
    “…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
    Thesis
  2. 2
  3. 3
  4. 4

    Improved tree routing protocol in zigbee networks by Al-Harbawi, Mostafa Kamil Abdulhusain

    Published 2010
    “…If any ZigBee router loses its link to its parent the routing path is broken and the TR cannot recover the routing path by itself , for that the second main objective is overcome the link failure problem. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

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

    Published 2018
    “…Thus, the A* algorithm is implemented in a small mobile robot, this is to see its effectiveness in real world application. …”
    Get full text
    Get full text
    Final Year Project
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…This is because each path planning algorithm has its own applicable domain, performance, advantages and disadvantages in various situations. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  17. 17

    Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

    Published 2020
    “…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

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

    Published 2004
    “…This thesis also provides an explanation about the advantages. functions, characteristics. the degree of complexity in A • algorithm and its implementation in real-world application. …”
    Get full text
    Get full text
    Thesis
  20. 20

    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

    Published 2025
    “…On the other hand, Dijkstra's algorithm, though robust and optimal, exhibited longer runtimes and produced paths with more turns due to its exhaustive search approach. …”
    Get full text
    Get full text
    Get full text
    Article