Search Results - intelligence _ ((tree algorithm) OR (((acs algorithm) OR (path algorithm))))

Refine Results
  1. 1
  2. 2
  3. 3

    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
    “…This evaluation focuses mostly on the accuracy of the different path-planning algorithms. Common collision-free path planning methodologies are examined in this paper, including classical or traditional and modern intelligence techniques, as well as both global and local approaches, in static and dynamic environments. …”
    Get full text
    Get full text
    Get full text
    Article
  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
  11. 11

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

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

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

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

    Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih by Ahmed Abuluaih, Saajid Akram

    Published 2019
    “…Since Constraint Satisfaction Problem (CSP) is an NP-complete problem, brute-force search algorithms such as Backtracking algorithm (BT) are required as the guarantee to find a solution, when there is one. …”
    Get full text
    Get full text
    Thesis
  16. 16

    A Kalman Filter Approach to PCB Drill Path Optimization Problem by Abdul Aziz, Nor Hidayati, Zuwairie, Ibrahim, Ab. Aziz, Nor Azlina, Saifudin, Razali, Abas, Khairul Hamimah, Mohamad, Mohd Saberi

    Published 2017
    “…This paper presents a Kalman Filter approach in solving printed circuit board (PCB) routing problem by using the Simulated Kalman Filter (SKF) algorithm. The experimental results are compared with those obtained by swarm intelligence approach, which are the Particle Swarm Optimization (PSO) variants, Ant Colony System (ACS) and Cuckoo Search (CS). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Linking Bayesian Network and Intensive Care Units Data: A Glycemic Control Study by Abu-Samah A., Abdul Razak N.N., Mohamad Suhaimi F., Jamaludin U.K., Chase G.

    Published 2023
    “…Decision support systems; Forecasting; Intensive care units; Medical informatics; Trees (mathematics); Accurate prediction; Causal Bayesian network; Discretization algorithms; Discretizations; Glycemic control; Intelligent mechanisms; Performance prediction; Variable selection; Bayesian networks…”
    Conference Paper
  18. 18
  19. 19

    A Robust Graph Theoretic Solution of Routing in Intelligent Networks by Qureshi, M.A., Hassan, M.F., Ehsan, M.K., Khan, M.O., Ali, M.Y., Khan, S.

    Published 2022
    “…The fast construction of shortest-path tree (SPT) is important to devise an efficient routing in a nondelay tolerant networks. …”
    Get full text
    Get full text
    Article
  20. 20