Search Results - (( time navigation search algorithm ) OR ( data distribution issues algorithm ))*

Refine Results
  1. 1
  2. 2
  3. 3

    Search algorithms for path planning problems in harsh wireless sensor network environment by Hong, Siaw Swin

    Published 2017
    “…Open issues of reviewed algorithms had been briefed in this dissertation. In order to solve the addressed problem, this dissertation proposed three algorithms which are Enhanced D*, Natural Behaviour Navigation (NBN), and Frothing Waypoint Navigation (FWN). …”
    Get full text
    Get full text
    Thesis
  4. 4

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…A* algorithm was also incorporated with Cell Mapping technique to speed up the searching process. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Dynamic interactive 3D mobile navigation aid by Adamu, Abubakar Ibrahim, Mantoro, Teddy, SHAFI’I, M.A.

    Published 2012
    “…The use of bi-A* Algorithm is to establish a forward and backward search for a destination or a position of users, while the use of voronoi diagram is to establish points and region within the navigation environment. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim by Lukman Hakim, Mohamad Aliff Hakimi

    Published 2017
    “…In network theory, it’s known as the shortest-path problem, and Dijkstra’s algorithm is usually used to solve it. Dijkstra’s algorithm is one of the classic shortest path search algorithms. …”
    Get full text
    Get full text
    Thesis
  7. 7

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

    Published 2023
    “…Unlike the normal PSO algorithm which initializes the particle swarm at the robot’s starting position and iteratively determining each waypoint until a completed path is generated, MPSO algorithm initializes the particle swarm within a predefined search space and searches for the global best position within it to determine a specific robot waypoint through iteration updates. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  8. 8

    Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm by Abu Samah, Khyrina Airin Fariza

    Published 2016
    “…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Natural extensions: Bat algorithm with memory by Taha A.M., Chen S.-D., Mustapha A.

    Published 2023
    “…Bat Algorithm (BA) has recently started to attract a lot of attention as a powerful search method in various machine learning tasks including feature selection. …”
    Article
  10. 10

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

    Published 2020
    “…Hence, path planning algorithm such as A* algorithm and Dijkstra’s algorithm are essential for the robot to navigate efficiently from one place to the targeted place. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  11. 11

    Agent Navigation based on Boundary Value Problem using Iterative Methods by Farhah Athirah Musli, Azali Saudi

    Published 2023
    “…The generated harmonic functions are then utilized by the searching algorithm to find a smooth navigational route for an agent to travel in its environment without colliding with any obstacles. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  12. 12
  13. 13
  14. 14

    Collision prediction based genetic network programming-reinforcement learning for mobile robot navigation in unknown dynamic environments by Findi, Ahmed H. M., Marhaban, Mohammad Hamiruce, Raja Ahmad, Raja Mohd Kamil, Hassan, Mohd Khair

    Published 2017
    “…Genetic Network Programming with Reinforcement Learning (GNP-RL) has several important features over other evolutionary algorithms such as it combines offline and online learning on the one hand, and it combines diversified and intensified search on the other hand, but it was used in solving the problem of MR navigation in static environment only. …”
    Get full text
    Get full text
    Article
  15. 15

    Simulation performance comparison of A*, GLS, RRT and PRM path planning algorithms by Muhammad, Aisha, Nor Rul Hasma, Abdullah, Mohammad A.H., Ali, Shanono, Ibrahim Haruna, Rosdiyana, Samad

    Published 2022
    “…The result obtained reveals that all the four algorithms could navigate and generate a feasible through the 2D map successfully. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Binary Vote Assignment on Cloud Quorum Algorithm for Fragmented MyGRANTS Database Replication by Noraziah, Ahmad, Ainul Azila, Che Fauzi, Herawan, Tutut, Zailani, Abdullah

    Published 2015
    “…Therefore, the storage, availability, and consistency are important issues to be addressed in order to allow distributed users efficiently and safely access data from many different sites. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Rapid Penang travel planner mobile application using GPS positioning and decision-making algorithm / Naslyiana Abdul Latif by Abdul Latif, Naslyiana

    Published 2015
    “…The technique used by this project are GPS positioning and decision-making algorithm. GPS Positioning used for searching nearby location (station) whereas decision making algorithm used for making a decision by provide result on bus recommended, fares and routes. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
    Get full text
    Thesis
  20. 20

    A novel binary vote assignment grid quorum algorithm for distributed database fragmentation by Ainul Azila, Che Fauzi, Noraziah, Ahmad, Noriyani, Mohd Zin

    Published 2011
    “…Therefore, the storage, availability, and consistency are important issues to be addressed in order to allow distributed users efficiently and safely access data from many different sites. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item