Search Results - (( based optimization sensor algorithm ) OR ( time destination path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Modelling of multi-robot system for search and rescue

    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
    Save to List
    Saved in:
  2. 2
    Industry 4.0 With Intelligent Manufacturing 5G Mobile Robot Based On Genetic Algorithm

    Industry 4.0 With Intelligent Manufacturing 5G Mobile Robot Based On Genetic Algorithm by Anwar Apandi, Nur Ilyana, Hawari, Mohd Zarifitri Kasim

    Published 2021
    “…The proposed scheme improves the robot path and delivery efficiency of the robot on average at 68% by moving on the industrial environment's shortest path and time average of the mobile robot reach its destination.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    New robot navigation algorithm for arbitrary unknown dynamic environments based on future prediction and priority behavior

    New robot navigation algorithm for arbitrary unknown dynamic environments based on future prediction and priority behavior by Tang, Sai Hong, Kamil, Farah, Zulkifli, Norzima, Ahmad, Siti Azfanizam, Khaksar, Weria, Moghrabiah, Mohammed Yasser

    Published 2017
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]

    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] by Muhammat Pazil, Nur Syuhada, Mahmud, Norwaziah, Jamaluddin, Siti Hafawati, Mustafa, Nur Farasyaqirra

    Published 2020
    “…Nevertheless, both time and cost of shortest path are constructed in different paths. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan

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

    Published 2017
    “…In this paper, users requirement are determined based on the time taken to reach the destination station. The time taken to reach the destination station was influenced by how many stations that users need to pass through. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Path planning for constant speed robot

    Path planning for constant speed robot by Abdullah @ Idris, Ahmad Takiyuddin

    Published 2006
    “…At the moment, the guidance algorithm managed to assist the robot to reach the desired destination, within a certain small error tolerance. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    UiTM Malaysia route planner / Mohamad Yunus Mohamed Nasir

    UiTM Malaysia route planner / Mohamad Yunus Mohamed Nasir by Mohamed Nasir, Mohamad Yunus

    Published 2008
    “…The shortest route is most appropriate than others because it can save time, cost and effort. The Route Planner's core is Dijkstra's shortest-path-finding algorithm, with extensions for time dependent delays and paths constrained by travel mode. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Analysis of Dijkstra’s and A* algorithm to find the shortest path

    Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

    Published 2015
    “…In this study, two algorithms will be focused on. This study compares the Dijkstra’s, and A* algorithm to estimate search time and distance of algorithms to find the shortest path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    AUTOMATIC ROUTE FINDER FOR NEW VISITORS

    AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

    Published 2006
    “…Automatic Route Finder tool for New Visitors is developed to help them to find or plan the shortest and effective way in order to reach their destination without loss of time. This project proposes a new visitor route model that is based on shortest path algorithms for road networks. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  10. 10
    Autonomous path planning robot using geographical information

    Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

    Published 2008
    “…At the moment, the guidance algorithm managed to assist the robot to reach the desired destination, within a certain small error tolerance. …”
    Get full text
    Learning Object
    Save to List
    Saved in:
  11. 11
    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs

    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akhbar, R.

    Published 2010
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Travelling choices made easier using dijkstra algorithm / Wardah Mohd Nor and Noraini Noordin

    Travelling choices made easier using dijkstra algorithm / Wardah Mohd Nor and Noraini Noordin by Mohd Nor, Wardah, Noordin, Noraini

    “…In finding the minimum total travel cost and shortest total completion time for a journey between two destinations, the step-by-step Dijkstra algorithm was applied in the time-dependent shortest path problem (TDSPP) and cost-dependent shortest path problem (CDSPP) in this research. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Optimal path planning algorithms in virtual environments

    Optimal path planning algorithms in virtual environments by Hassan, Rohayanti

    Published 2006
    “…The main aim of the research was to find an efficient route tour approach that combines path finding, path planning and path optimization algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    ZLS: A next-door lightweight QoS aware location service technique for VANET on highways

    ZLS: A next-door lightweight QoS aware location service technique for VANET on highways by Rehan, M., Hasbullah, H., Chughtai, O., Rehan, W.

    Published 2014
    “…Other than digital maps, Dijkstra or Bellmen ford algorithms at source or intermediate nodes are also used to find shortest path, which is a computationally time consuming activity leading to an extra delay during path finding and before packet transmission. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Shortest Path Trajectory System Based on Dijkstra Algorithm

    Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

    Published 2012
    “…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    A study of vehicle routing problem via trade-off ranking method

    A study of vehicle routing problem via trade-off ranking method by Nor Izzati, Jaini, Adam Shariff Adli, Aminuddin, Farahanim, Misni, Zaitul Marlizawati, Zainuddin

    Published 2021
    “…Instead, to avoid congestion, a few algorithms use a randomized algorithm that routes a path to a randomly picked intermediate destination, and from there to its true destination. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    Metaheuristic multi-hop clustering optimization for energy-efficient wireless sensor network

    Metaheuristic multi-hop clustering optimization for energy-efficient wireless sensor network by Vincent Chung, Norah Tuah, Kit Guan Lim, Min Keng Tan, Ismail Saad, Kenneth Tze Kin Teo

    Published 2020
    “…Based on the performance evaluation, GACS outperforms both Genetic Algorithm (GA)-based cluster optimization algorithm and Cuckoo Search (CS)-based multi-hop optimization algorithm.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The problem is to find the global path that satisfies the optimization criteria, which are shorter path length and less computation time. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Boolean routing on high degree chordal ring networks

    Boolean routing on high degree chordal ring networks by Matroud Bashi, Atheer Abbas

    Published 2001
    “…O(1) time complexity to compute a shortest path to any destination for the ring topologies has been shown. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Cluster head selection optimization in wireless sensor network via genetic-based evolutionary algorithm

    Cluster head selection optimization in wireless sensor network via genetic-based evolutionary algorithm by Vincent Chung, Hamzarul Alif Hamzah, Norah Tuah, Kit, Guan Lim, Min, Keng Tan, Kenneth Tze Kin Teo

    Published 2020
    “…Genetic-based evolutionary algorithms such as Genetic Algorithm (GA) and Differential Evolution (DE) have been popularly used to optimize cluster head selection in WSN to improve energy efficiency for the extension of network lifetime. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: