Search Results - (( initial optimization path algorithm ) OR ( using optimization modified algorithm ))

Refine Results
  1. 1

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

    Published 2023
    “…This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  2. 2
  3. 3

    Path Following Using A Learning Neural Network by NHH , Mohamad Hanif

    Published 2004
    “…This thesis is a development ofprevious works done by [2} on capability of neural controller to efficiently track prescribed paths. Equipped with knowledge on optimal preview control obtained from [1], the initial weights of linear and nonlinear neural controller are initialized to the optimal gains. …”
    Get full text
    Get full text
    Final Year Project
  4. 4

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

    Published 2013
    “…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Enhancing Autonomous Guided Vehicles with Red-Black TOR Iterative Method by A’Qilah Ahmad Dahalan, Azali Saudi, Jumat Sulaiman

    Published 2023
    “…By carefully choosing the optimal parameter values, the suggested B-MTOR improved the computational execution of the algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

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

    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
    “…Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    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, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

    Published 2023
    “…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
  11. 11

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

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

    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
    “…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

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. …”
    Get full text
    Get full text
    Article
  15. 15

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

    Published 2013
    “…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18
  19. 19

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. …”
    Get full text
    Get full text
    Student Project
  20. 20