Search Results - (( initial solving path algorithm ) OR ( using optimisation based algorithm ))

Refine Results
  1. 1

    Search algorithms for path planning problems in harsh wireless sensor network environment by Hong, Siaw Swin

    Published 2017
    “…Each algorithm solves its respective problem with Enhanced D* solving long initial delay in dynamic environment, NBN solves harsh conditions with limited computational power, and FWN optimized the result of TSP path planning problem with minimal computational effort. …”
    Get full text
    Get full text
    Thesis
  2. 2

    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
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    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
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    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 Suwayo, Heri, Adrishah, Andi, Andika, Juleri, Shamdudin, Abu Ubaidah, Zakaria, Mohamad Fauzi

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    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, ADRIANSHAH, ANDI, ANDIKA, JULPRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    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 HERU SUWOYO, HERU SUWOYO, ANDI ADRIANSYAH, ANDI ADRIANSYAH, JULPRI ANDIKA, JULPRI ANDIKA, SHAMSUDIN, A LT UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    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 Heru Sowoyo, Heru Sowoyo, Andi Adrianshah, Andi Adrianshah, Julpri Andika, Julpri Andika, Shamsuddin, Abu Ubaidah, Zakaria, Mohamad Fauzi

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    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, JULI RI ANDIKA, JULI RI ANDIKA, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…This algorithm provides the robot the possibility to move from the initial position to the final position (target). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  12. 12
  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
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    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
    “…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The objective is to verify and compare the effectiveness of both algorithms in finding the optimal robot path in different types of global map environments. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…In the benchmarking of the SKF and ssSKF algorithms’ performance in solving the 14-hole PCB drill path optimization case study with recent implementations, on average, both algorithms show the ability to converge to the optimal solution at a smaller number of function evaluations compared to the Gravitational Search Algorithm (GSA), Cuckoo Search (CS), and Intelligent Water Drop (IWD), although fall-short to the Taguchi- Genetic Algorithm optimization algorithm.…”
    Get full text
    Get full text
    Thesis
  18. 18

    Solving traveling salesman problem on cluster compute nodes by I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P.

    Published 2009
    “…Initially a sequential algorithm is fabricated from scratch and written in C language. …”
    Get full text
    Get full text
    Article
  19. 19

    Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation by M. F. F., Ab Rashid

    Published 2013
    “…The aim of this research is to establish a methodology and algorithm for integrating ASP and ALB optimisation using Particle Swarm Optimisation. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Optimization Of Pid Controller Using Grey Wolf Optimzer And Dragonfly Algorithm by Nik Mohamed Hazli, Nik Muhammad Aiman

    Published 2018
    “…In this research, swarming intelligence is used to solve optimisation problem. Grey Wolf Optimizer and Dragonfly Algorithm were chosen. …”
    Get full text
    Get full text
    Monograph