Search Results - (( based optimization methods algorithm ) OR ( global optimization path algorithm ))

Refine Results
  1. 1

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

    Published 2019
    “…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Adaptive route optimization for mobile robot navigation using evolutionary algorithm by Kit Guan Lim, Guan Lim, Yoong Hean Lee, Hean Lee, Min Keng Tan, Keng Tan, Hou, Pin Yoong, Tienlei, Wang, Tze, Kenneth Kin Teo

    Published 2021
    “…For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11

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

    Published 2024
    “…Particle swarm optimization (PSO) outperforms conventional methods like artificial potential fields (APF), the Dijkstra algorithm, and the A* algorithm in path planning for mobile robots. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  12. 12
  13. 13
  14. 14

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
  15. 15

    Comprehensive review of drones collision avoidance schemes: challenges and open issues by Rezaee, Mohammad Reza, Abdul Hamid, Nor Asilah Wati, Hussin, Masnida, Ahmad Zukarnain, Zuriati

    Published 2024
    “…We explore collision avoidance methods for UAVs from various perspectives, categorizing them into four main groups: obstacle detection and avoidance, collision avoidance algorithms, drone swarm, and path optimization. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Design and modelling of an autonomous robotic airship with soft computing control by Wong, Wei Kitt

    Published 2012
    “…Along with the prototype airship, a path planner was also proposed for the UAV for the purpose of obstacle avoidance and path optimization using genetic algorithm to minimize on the distance travelled and to generate the shortest path to cover the specified waypoints. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

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

    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
    “…This paper presents the application of Genetic Algorithm and Ant Colony Optimization (ACO) Algorithm for robot path planning (RPP) in global static environment. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms by Shen, Jiazheng, Tang, Saihong, Zhao, Ruixin, Fan, Luxin, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan

    Published 2025
    “…Comparative experiments demonstrate that TLDW-JS outperforms classic optimization algorithms such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Dung Beetle Optimization (DBO), achieving superior path length optimization, reduced energy consumption, and improved convergence speed. …”
    Get full text
    Get full text
    Get full text
    Article