Search Results - (( solution using ((path algorithm) OR (tree algorithm)) ) OR ( java implication based algorithm ))

Refine Results
  1. 1
  2. 2

    Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments by Jauwairia Nasir, Fahad Islam, Yasar Ayaz

    Published 2013
    “…Rapidly Exploring Random Trees (RRT) are regarded as one of the most efficient tools for planning feasible paths for mobile robots in complex obstacle cluttered environments. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

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

    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment by Suwoyo, Heru, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

    Published 2023
    “…The use of sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, ANDIKA, JULFRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by Suwayo, Heri, Adrishah, Andi, Andika, Juleri, Shamdudin, Abu Ubaidah, Zakaria, Mohamad Fauzi

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSHAH, ANDI, ANDIKA, JULPRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9
  10. 10

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, JULI RI ANDIKA, JULI RI ANDIKA, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Efficient terrain coverage for deploying wireless sensor nodes on multi-robot system by Arezoumand, Reza, Mashohor, Syamsiah, Marhaban, Mohammad Hamiruce

    Published 2016
    “…Employing multi-robot system and path planning with spanning tree algorithm is a strategy for speeding up sensor nodes deployment. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUW, HERU, MI ATILTIANSYAH, AN, ANDIKA, JULI RI, SHAVISUDIN, UBAIDAH, AUZI ZAICARIX, M °H MAD

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUW, HERU, AtiltIANSYAH, AN- MI, RI ANDIKA, JULI, SHAVISUDIN, UBAIDAH, AUZI ZAICARIX, M °H MAD

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Power line corridor vegetation encroachment detection from satellite images using retinanet and support vector machine by Fathi Mahdi Elsiddig Haroun, Mr.

    Published 2023
    “…A routing algorithm has been developed to create a routing path between all transmission towers in the image, which helps identify the power line path. …”
    text::Thesis
  15. 15

    An Intelligent System Approach to the Dynamic Hybrid Robot Control by Md. Yeasin, Md. Mahmud Hasan

    Published 1996
    “…A one-pass smoothing algorithm was used to generate a practical smooth trajectory path in near real time. …”
    Get full text
    Get full text
    Thesis
  16. 16

    A Mininet emulation study for SDN fat tree data center sleep mode routing algorithms by Fawzi S., Din N.M.

    Published 2025
    “…In this work meta heuristic algorithm is incorporated at the SDN central controller in a fat tree-based data centre for bandwidth usage monitoring, sleep decisions and path selection using Mininet emulation. …”
    Article
  17. 17
  18. 18

    Electricity distribution network for low and medium voltages based on evolutionary approach optimization by Hasan, Ihsan Jabbar

    Published 2015
    “…This thesis proposes an algorithm to find the optimum distribution substation placement and sizing by utilizing the PSO algorithm and optimum feeder routing using modified Minimum Spanning Tree (MST). …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

    Published 2023
    “…However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. …”
    Article