Search Results - (( parameter optimization path algorithm ) OR ( parameter evaluation from algorithm ))

Refine Results
  1. 1

    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin by Sariff, Nohaidda, Buniyamin, Norlida

    Published 2010
    “…These nodes generally represent the free space extracted from the robot map. Performances between both algorithms were compared and evaluated in terms of speed and number of iterations that each algorithm takes to find an optimal path within several selected environments. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    Published 2013
    “…Afterward, a genetic algorithm-based optimization framework was designed to improve the interpretability and accuracy of the proposed fuzzy-tabu controller by optimizing the parameters of the FLC and also some of the planner’s parameters in order to improve the quality of the generated paths and runtimes of the planner and also to decrease the variation of the results in different runs of the planner. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators by Nor Maniha, Abdul Ghani, Nizaruddin, M. Nasir, Azrul Azim, Abdullah Hashim

    Published 2024
    “…This study aims to evaluate the effectiveness of two optimization algorithms, artificial bee colony (ABC) and spiral dynamic algorithm (SDA), in controlling the position of a flexible-link manipulator. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak by Abdul Razak, Noorfadzli

    Published 2018
    “…However, existing algorithm seems too complicated to be applied. Since there is no technique can enable the quadrotor to implement precision navigation application, the research proposed a Real-Time Optimal Trajectory Correction (ROTC) algorithm. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

    Published 2020
    “…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    Published 2023
    “…The proposed B-MTOR technique employs red-black ordering with four different weighted parameters. 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
  7. 7

    Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

    Published 2016
    “…In dealing with traffic routing problem, two algorithms, Dijkstra's Shortest Path and Genetic Algorithm (GA) are combined together and enhanced to re-strategize a better routing mechanism for a heterogeneous mix of traffic classes ranging from traditional voice calls to multimedia data services in Low Earth Orbit (LEO) satellite networks. …”
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…As a route improvement strategy, two heuristics which are the swap among routes procedure and 3-opt algorithm are also employed within the ASH algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Workload performance evaluation of large spatial database for DSS based disaster management by Rohman, Muhammad Syaifur

    Published 2017
    “…Additionally, the results of the study indicated that the prediction model for workload performance evaluation using CBR that is optimized with Hash Search technique for determining workload data on Shortest Path analysis via the employment of Dijkstra algorithm can be useful for the prediction of incoming workload based on the status of the DBMS parameters. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network by Tareq, M., Abed, S.A., Sundararajan, E.A.

    Published 2019
    “…The evaluation is based on node speed and packet size topology parameters. …”
    Get full text
    Get full text
    Article
  11. 11
  12. 12

    Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller by Zaridah, Mat Zain

    Published 2010
    “…The optimization technique involved from two points to four points and end with six points. …”
    Get full text
    Thesis
  13. 13

    Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network by Halim, Nurul Hamimi

    Published 2018
    “…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

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

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

    The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

    Published 2005
    “…Therefore, the implementation ofGA in path optimization can be ascertained offering a compelling result.…”
    Get full text
    Get full text
    Final Year Project
  18. 18

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

    Published 2023
    “…Genetic algorithm (GA) is a powerful search and optimization algorithm inspired by the theory of genetics and natural selection. …”
    Conference paper
  19. 19

    Minimization of tool path length of drilling process using particle swarm optimization (PSO) by Abdullah, Haslina, Zaman, Nizam Nurehsan, Talib, Norfazillah, Lee, Woon Kiow, Saleh, Aslinda, Zakaria, Mohamad Shukri

    Published 2020
    “…For this study, the main purpose is to apply the Particle Swarm Optimization (PSO) algorithm for use in searching for the optimal tool routing path for in simulation of drilling process…”
    Get full text
    Get full text
    Book Section
  20. 20