Search Results - (( _ application ((tree algorithm) OR (path algorithm)) ) OR ( based applications a algorithm ))

Refine Results
  1. 1

    Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm by Arezoumand, Reza

    Published 2015
    “…Employing a multi-robot system and path planning with spanning tree algorithm is a strategy for speeding up sensor node deployment. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3
  4. 4

    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

    Published 2010
    “…This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Improved tree routing protocol in zigbee networks by Al-Harbawi, Mostafa Kamil Abdulhusain

    Published 2010
    “…Wireless Sensor Networks (WSNs) is becoming more important in various application areas. Many application scenarios require connectivity between WSN’s nodes to transmit the collected data to a sink node. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    Articulated robots motion planning using foraging ant strategy by Mohamad, Mohd. Murtadha

    Published 2008
    “…An alternative search approach using ant behaviour in a robotics application is applied. This paper proposes a novel search technique, the F-Ant algorithm, in order to find a reliable path between the initial configuration and the goal configuration of the articulated robot. …”
    Get full text
    Get full text
    Article
  11. 11
  12. 12
  13. 13

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

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

    Published 2020
    “…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20