Search Results - ((((graph algorithm) OR (path algorithm))) OR (bat algorithm))

Search alternatives:

Refine Results
  1. 1
    A comprehensive overview of classical and modern route planning algorithms for self-driving mobile robots

    A comprehensive overview of classical and modern route planning algorithms for self-driving mobile robots by Wan Daud, Wan Mohd Bukhari, Abu, Nur Syuhadah, Omar, Siti Nashayu, Sohaimeh, Shahirul Ashraf, Adli,, M. H.

    Published 2022
    “…Classical or traditional methods, such as Roadmaps (Visibility Graph and Voronoi Diagram), Potential Fields, and Cell Decomposition, and modern methodologies such as heuristic-based (Dijkstra Method, A* Algorithms, and D* Algorithms), metaheuristics algorithms (such as PSO, Bat Algorithm, ACO, and Genetic Algorithm), and neural systems such as fuzzy neural networks or fuzzy logic (FL) and Artificial Neural Networks (ANN) are described in this report. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Optimal path planning algorithm for swarm robots using bat algorithm with mutation (bam)

    Optimal path planning algorithm for swarm robots using bat algorithm with mutation (bam) by Lim, Pei Yee

    Published 2022
    “…The current research in robot navigation is to implement an obstacle avoidance algorithm to a single mobile robot to realize the path planning of a mobile robot. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  3. 3
    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm

    Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

    Published 2020
    “…This paper investigates the swarm intelligence behaviour represented by a population-based approach called the bat algorithm (BA) to find the smallest set of nodes that dominate the graph. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs

    An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R., Sammi, R.

    Published 2010
    “…This paper concentrates on this very idea and presents an algorithm for calculating shortest path for nonnegative weighted undirected graphs. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing

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

    Published 2007
    “…It has been shown that the performance of a graph-based shortest path algorithm can severely be affected by the performance of its priority queue. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    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
    “…This paper concentrates on this very idea and presents an algorithms for calculating shortest path for (i) nonnegative weighted undirected graphs (ii) unweighted undirected graphs. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Hybrid bat algorithm for minimum dominating set problem

    Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

    Published 2017
    “…In this paper, the stochastic search represented by hybrid swarm intelligence algorithm to find the smallest set of nodes that dominate the graph. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION

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

    Published 2018
    “…In which the obstacles, start node and target node will be known in advance of starting the path planning algorithms. Based on the results of MATLAB simulation, the A* algorithm is the best algorithm in finding the shortest path with the least time taken. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  9. 9
    Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs

    Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs by Qureshi, MA., Hassan, M.F., Safdar, S., Akhbar, R.

    Published 2010
    “…Breadth First Search (BFS) can calculate the shortest path for un-weighted graphs very efficiently but when it comes to non-negative weighted graphs it fails at a point when a successor updates a predecessor. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    A hybrid algorithm for finding shortest path in network routing.

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Path Optimization For Cooperative Multi-Head 3d Printing

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…The performance of the two proposed algorithms is compared against Cura, which is a commonly used software for generating the nozzle path. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  13. 13
    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site

    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

    Published 2017
    “…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  14. 14
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  15. 15
    Revolutionizing crowd safety: A breakthrough hybrid whale-bat chaotic algorithm (WOABCM) for optimized evacuation simulations

    Revolutionizing crowd safety: A breakthrough hybrid whale-bat chaotic algorithm (WOABCM) for optimized evacuation simulations by Hamizan, Sharbini, Mohamad Shukor, Talib, Noorfa Haszlinna, Mustaffa, Habibollah, Haron

    Published 2024
    “…The Whale-Bat Chaotic Algorithm (WOABCM) is a revolutionary tool for optimizing pathfinding navigation in crowd evacuation scenarios. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Bat Algorithm for Complex Event Pattern Detection in Sentiment Analysis

    Bat Algorithm for Complex Event Pattern Detection in Sentiment Analysis by Kabir Ahmad, Farzana, Kamaruddin, Siti Sakira, Yusof, Yuhanis, Yusoff, Nooraini

    Published 2021
    “…This algorithm mainly based on the echolocation behavior of bats. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  17. 17
    FROM IMAGE TO GRAPH-BASED DATA FOR PATH PLANNING

    FROM IMAGE TO GRAPH-BASED DATA FOR PATH PLANNING by MOHAMAD YATIM, NOOR AMANINA HANISAH

    Published 2019
    “…This implementation of graph traversal, statistics and machine learning algorithms were a challenging part to be done. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  18. 18
    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…The result will be compared with euler's path algorithm using heuristic search and a pseudo input to find the minimum interlace.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics

    Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

    Published 2023
    “…This study employs use Random Forest algorithm to identify and forecast attacks to dynamically locate the attack location in the network for attack graph analysis. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: