Search Results - (( java implementation max algorithm ) OR ( wolf optimization path algorithm ))

  • Showing 1 - 10 results of 10
Refine Results
  1. 1

    Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking by Shen, Jiazheng, Hong, Tang Sai, Fan, Luxin, Zhao, Ruixin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

    Published 2024
    “…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3

    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

    Published 2025
    “…Through extensive simulations across various static environment maps, we demonstrate that the ABGPSO algorithm outperforms existing state-of-the-art optimization techniques, including Genetic Algorithms (GA), Grey Wolf Optimization (GWO), and modern optimizers like the Sine Cosine Algorithm (SCA), Harris Hawks Optimization (HHO) and Reptile search algorithm (RSA). …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Continuous path planning of Kinematically redundant manipulator using Particle Swarm Optimization by Machmudah, A., Parman, S., Baharom, M.B.

    Published 2018
    “…Based on a geometrical analysis, feasible postures of a self-motion are mapped into an interval so that there will be an angle domain boundary and a redundancy resolution to track the desired path lies within this boundary. To choose a best solution among many possible solutions, meta-heuristic optimizations, namely, a Genetic Algorithm (GA), a Particle Swarm Optimization (PSO), and a Grey Wolf Optimizer (GWO) will be employed with an optimization objective to minimize a joint angle travelling distance. …”
    Get full text
    Get full text
    Article
  5. 5

    Continuous path planning of Kinematically redundant manipulator using Particle Swarm Optimization by Machmudah, A., Parman, S., Baharom, M.B.

    Published 2018
    “…Based on a geometrical analysis, feasible postures of a self-motion are mapped into an interval so that there will be an angle domain boundary and a redundancy resolution to track the desired path lies within this boundary. To choose a best solution among many possible solutions, meta-heuristic optimizations, namely, a Genetic Algorithm (GA), a Particle Swarm Optimization (PSO), and a Grey Wolf Optimizer (GWO) will be employed with an optimization objective to minimize a joint angle travelling distance. …”
    Get full text
    Get full text
    Article
  6. 6

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”
    Review
  7. 7

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…Many algorithms have been implemented to solve the grid scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9
  10. 10