Search Results - global optimization ((method algorithm) OR (((path algorithm) OR (_ algorithm))))
Search alternatives:
- method algorithm »
- path algorithm »
-
1
Modelling of multi-robot system for search and rescue
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
-
3
Adaptive route optimization for mobile robot navigation using evolutionary algorithm
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
-
5
-
6
-
7
-
8
Particle swarm optimization (PSO) for CNC route problem
Published 2002“…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
Get full text
Get full text
Undergraduates Project Papers -
9
Simulated Kalman Filter algorithms for solving optimization problems
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 -
10
-
11
-
12
-
13
Optimised multi-robot path planning via smooth trajectory generation
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 -
14
A review on autonomous mobile robot path planning algorithms
Published 2020“…This yield to a lot of improvement and suggestions in many areas related to mobile robot such as path planning. The purpose of this paper is to review the mobile robots path planning problem, optimization criteria and various methodologies reported in the literature for global and local mobile robot path planning. …”
Get full text
Get full text
Get full text
Article -
15
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
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
-
17
-
18
Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin
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
A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
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 -
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
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
