Search Results - (( using function methods algorithm ) OR ( based iteration path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group

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

    Published 2014
    “…Consequently, the gradient of the potential functions would be used by the searching algorithm to generate path from starting to goal location. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Modelling of multi-robot system for search and rescue

    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
    Save to List
    Saved in:
  3. 3
    Autonomous path planning through application of rotated two-parameter overrelaxation 9-point Laplacian iteration technique

    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
    Save to List
    Saved in:
  4. 4
    Logical effort base adder circuits transistor sizing using constriction factor and mutative variants of particle swarm optimization algorithm / Muhammad Aiman Johari

    Logical effort base adder circuits transistor sizing using constriction factor and mutative variants of particle swarm optimization algorithm / Muhammad Aiman Johari by Johari, Muhammad Aiman

    Published 2015
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Optimised multi-robot path planning via smooth trajectory generation

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

    Published 2024
    “…A MPSO algorithm, without path smoothening, is used for comparison. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  6. 6
    Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms

    Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

    Published 2020
    “…In the sizing of the SAPV system, the mutation adaptive DE (MADE) algorithm based multi-objective functions minimizes three constraint objective functions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Robot path planning using family of SOR iterative methods with laplacian behaviour-based control

    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
    Save to List
    Saved in:
  8. 8
    Energy efficient path-planning for unmanned aerial vehicle

    Energy efficient path-planning for unmanned aerial vehicle by Debnath, Sanjoy Kumar

    Published 2022
    “…The proposed path planning algorithm is called Iterative Elliptical- Convex Visibility Graph (IECoVG) which is based on visibility graph (VG) and Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Image Fusion for Travel Time Tomography Inversion

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

    Published 2015
    “…The travel time tomography technology had achieved wide application, the hinge of tomography was inversion algorithm, the ray path tracing technology had a great impact on the inversion results. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    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

    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
    Save to List
    Saved in:
  11. 11
    The effect of GA parameters on the performance of GA-based QoS routing algorithm

    The effect of GA parameters on the performance of GA-based QoS routing algorithm by Yussof S., See O.H.

    Published 2023
    “…In the previous work, a GA-based QoS routing algorithm for solving the multiconstrained path (MCP) problem has been developed. …”
    Conference paper
    Save to List
    Saved in:
  12. 12
    Joint routing protocol and image compression algorithm for prolonging node lifetime in wireless sensor network

    Joint routing protocol and image compression algorithm for prolonging node lifetime in wireless sensor network by Ahmed Al-Doori, Ahmed Jamal

    Published 2018
    “…The comparison between the proposed CPF protocol and the energy aware protocol has been carried out on the basis of number of iterations and the dead nodes in the network. Thorough simulations have been carried out based on different number of network iterations to validate the potential of the proposed solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation

    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
    Save to List
    Saved in:
  14. 14
    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method

    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

    Published 2018
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    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:
  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 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:
  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 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:
  18. 18
    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:
  19. 19
    Fast robot path planning with Laplacian Behaviour-Based control via four-point explicit decoupled group SOR

    Fast robot path planning with Laplacian Behaviour-Based control via four-point explicit decoupled group SOR by Azali Saudi, Jumat Sulaiman, Mohd Hanafi Ahmad Hijazi

    Published 2014
    “…This study proposed a robot path planning technique that employs Laplacian Behaviour-Based Control (LBBC) for space exploration which relies on the use of Laplace’s equation to constrain the generation of the potential function of the configuration space of a mobile point-robot. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    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:

Search Tools: