Search Results - (( _ application ria algorithm ) OR ( its application ((graph algorithm) OR (path algorithm)) ))

Refine Results
  1. 1

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

    Published 2018
    “…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
    Final Year Project
  2. 2
  3. 3

    Modeling dynamic weight for 3D navigation routing by Musliman, Ivin Amri, Abdul Rahman, Alias, Coors, Volker

    Published 2007
    “…Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in time-critical applications such as emergency response applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    High-Speed shortest path co-processor design by Idris, Mohd Yamani Idna, Abu Bakar, Suraya, Tamil, Emran Mohd, Razak, Zaidi, Noor, Noorzaily Mohamed

    Published 2009
    “…Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6

    Path planning methods for autonomous vehicles at intersections: A review by Vinayak, Akhil, Muhammad Aizzat, Zakaria, Younus, Maryam, Mohamad Heerwan, Peeie, Muhammad Izhar, Ishak

    Published 2026
    “…Each method is analysed in terms of its strengths, limitations, and applicability to real-world scenarios, focusing on the specific demands of intersection navigation. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8
  9. 9
  10. 10

    Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

    Published 2024
    “…Although the swmcan algorithm solves the noise problem in multi-view data, its initial and final graphs are independent and cannot learn from each other. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

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

    Hybrid global structure model for unraveling influential nodes in complex networks by Mukhtar, Mohd Fariduddin, Abdul Rasib, Amir Hamzah, Mohd Zaki, Nurul Hafizah, Zainal Abidin, Zaheera, Abal Abas, Zuraida, Hairol Anuar, Siti Haryanti, Abdul Rahman, Ahmad Fadzli Nizam, Shibghatullah, Abdul Samad

    Published 2023
    “…In graph analytics, the identification of influential nodes in real-world networks plays a crucial role in understanding network dynamics and enabling various applications. …”
    Get full text
    Get full text
    Get full text
    Article
  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
  18. 18

    Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

    Published 2016
    “…MVC and MIS are notable for its capability of modelling other combinatorial problems and real-world applications. …”
    Get full text
    Get full text
    Get full text
    Article
  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