Search Results - optimal ((((path algorithm) OR (search algorithm))) OR (((bee algorithm) OR (tree algorithm))))

Search alternatives:

Refine Results
  1. 1
    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
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    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
    “…A depth - first search algorithm is used to search for optimal chaining. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    A review on path planning and obstacle avoidance algorithms for autonomous mobile robots

    A review on path planning and obstacle avoidance algorithms for autonomous mobile robots by Anis Naema Atiyah, Rafai, Noraziah, Adzhar, Nor Izzati, Jaini

    Published 2022
    “…This paper reviews the mobile robot navigation approaches and obstacle avoidance used so far in various environmental conditions to recognize the improvement of path planning strategists. Taking into consideration commonly used classical approaches such as Dijkstra algorithm (DA), artificial potential field (APF), probabilistic road map (PRM), cell decomposition (CD), and meta-heuristic techniques such as fuzzy logic (FL), neutral network (NN), particle swarm optimization (PSO), genetic algorithm (GA), cuckoo search algorithm (CSO), and artificial bee colony (ABC). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    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
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment

    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
    Save to List
    Saved in:
  7. 7
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    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
    Save to List
    Saved in:
  8. 8
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    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
    Save to List
    Saved in:
  9. 9
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    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
    Save to List
    Saved in:
  10. 10
    Optimization of drilling path using the bees algorithm

    Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

    Published 2021
    “…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Application of the Bees Algorithm to find optimal drill path sequence

    Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

    Published 2024
    “…The main finding of the study is that the Bees Algorithm found optimal drill path length and minimum machining time comparable to the results of the other algorithms for the 5 × 5, 7 × 7 and 9 × 9 problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  12. 12
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by HERU SUWOYO, HERU SUWOYO, ANDI ADRIANSYAH, ANDI ADRIANSYAH, JULPRI ANDIKA, JULPRI ANDIKA, SHAMSUDIN, A LT 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
    Save to List
    Saved in:
  13. 13
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by Heru Sowoyo, Heru Sowoyo, Andi Adrianshah, Andi Adrianshah, Julpri Andika, Julpri Andika, Shamsuddin, 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
    Save to List
    Saved in:
  14. 14
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    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
    Save to List
    Saved in:
  15. 15
    Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network

    Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network by Tareq, M., Abed, S.A., Sundararajan, E.A.

    Published 2019
    “…The aim of this paper is to find the best possible route from the source to the destination based on a method inspired by the searching behaviour of bee colonies, i.e. artificial bee colony (ABC) algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    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
    Save to List
    Saved in:
  17. 17
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    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
    Save to List
    Saved in:
  18. 18
    Improving the efficiency of minimum determinant computation in space time trellis code with optimal subtree pruning

    Improving the efficiency of minimum determinant computation in space time trellis code with optimal subtree pruning by Ungku Azlin Ungku Chulan, Norbahiah Misran, Mohammad Tariqul Islam

    Published 2024
    “…Although the algorithm is relatively efficient, it is not optimized in terms of the pruning strategy. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Robotic path planning using rapidly-exploring random trees

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    Published 2013
    “…This study concerns the implementation of Rapidly-Exploring Random Trees (RRTs) algorithm for an autonomous robot path planning. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Articulated robots motion planning using foraging ant strategy

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

    Published 2008
    “…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
    Save to List
    Saved in:

Search Tools: