Search Results - (( develop ((computing path) OR (computing _)) algorithm ) OR ( java implication tree algorithm ))

Refine Results
  1. 1
  2. 2

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…IE attained a 92% probability rate of achieving a short path length in 100 case studies. With regard to computational cost, IE attained a 97% probability rate of achieving a faster processing speed in comparison with tested algorithms. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

    Published 2018
    “…Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…The most common pathfinding algorithm used in video game is A*. Even though A* is the most popular algorithm amongst game developers, it's hardly the best algorithm in finding the true shortest path. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

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

    Published 2024
    “…The performance of the transitioned 3D algorithm is evaluated against the original 2D MBC algorithm in terms of computational load, convergence analysis, path length, coverage quality, and scalability. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  10. 10

    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

    Published 2007
    “…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12
  13. 13
  14. 14

    Path planning algorithm for a car like robot based on Coronoi Diagram Method by Inun, Haidie

    Published 2013
    “…The purpose of this study is to develop an efficient offline path planning algorithm that is capable of finding optimal collision-free paths from a starting point to a goal point. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20