Search Results - (( based iteration ((method algorithm) OR (path algorithm)) ) OR ( panel information a algorithm ))

Refine Results
  1. 1

    Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group by Azali Saudi, Jumat Sulaiman

    Published 2014
    “…In this paper, a robust searching algorithm to generate path planning for mobile robot is proposed. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…Moreover, to cope with dynamic environments, a combination of global and local path planning methods is introduced. The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

    Robot path planning using family of SOR iterative methods with laplacian behaviour-based control by Azali Saudi

    Published 2015
    “…In terms of iterations count, the iterative methods based on the 9-Point Laplacian give the less number of iterations than the 5-Point Laplacian. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Image Fusion for Travel Time Tomography Inversion by Liu, L., Zhao, X., Yin, X., Ashraf, M.A.

    Published 2015
    “…We presented an imaging fusion method based on improved Wilkinson iteration method. …”
    Get full text
    Get full text
    Article
  5. 5

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…For the result, shortest path for the order pickers in iterations. The algorithm used can help the order picker to have the shortest path, but it have no direct path. …”
    Get full text
    Get full text
    Student Project
  6. 6

    Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation by Hasan, Talib Hashim, Chowdhury, Md. Sazzad Hossien, Prayoto, .

    Published 2011
    “…Our homotop algorithm is much more efficient than the conventional iterations type algorithms. …”
    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, 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
  8. 8

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

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

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

    Autonomous path planning through application of rotated two-parameter overrelaxation 9-point Laplacian iteration technique by W. K. Ling, A. A. Dahalan, Azali Saudi

    Published 2020
    “…The harmonic functions are an appropriate method to be used on autonomous path planning because it satisfies the min-max principle, therefore avoiding the occurrence of local minima which traps robot’s movements, and that it offers complete path planning algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

    Published 2024
    “…Particle swarm optimization (PSO) outperforms conventional methods like artificial potential fields (APF), the Dijkstra algorithm, and the A* algorithm in path planning for mobile robots. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  14. 14
  15. 15
  16. 16

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

    Improvement Of Stereo Matching Algorithm Based On Sum Of Gradient Magnitude Differences And Semi-Global Method With Refinement Step by Hamzah, Rostam Affendi, Ibrahim, Haidi

    Published 2018
    “…To get over these problems,sum of gradient magnitude differences has been introduced at the first stage.This method is strong against the radio-metric differences on the stereo images.Hence,this approach will reduce the error of preliminary data for stereo corresponding process.The SGM is used at the aggregation,and optimisation stage uses 16 different directions of 2D path.Additionally,the iterative guided filter is utilised at the refinement stage which minimises the errors and increases the accuracy.The proposed work produces accurate results and performs much better compared with some established algorithms based on the standard stereo benchmarking evaluation from the Middlebury and KITTI.…”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    A new routing mechanism for energy-efficient in bluetooth mesh-low power nodes based on wireless sensor network by Almuslehi, Hussein Saad Mohammed

    Published 2023
    “…The multi-criterion energyefficient routing mechanism uses the ACO algorithm, inspired by ants' foraging behaviour. In Bluetooth M-LPNWSN systems, virtual ants explore paths based on signal robustness, distances, and energy consumption. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…Genetic Algorithms (GA) which is based on biological evolution is one of the metaheuristics that has been successfully applied to JSSP. …”
    Get full text
    Get full text
    Get full text
    Thesis