Search Results - (( initial optimization path algorithm ) OR ( using simulation methods algorithm ))
Search alternatives:
- initial optimization »
- simulation methods »
- optimization path »
- methods 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
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
Get full text
Get full text
Thesis -
3
Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization
Published 2015“…Here, in this paper, we propose a path planning with predetermined waypoints method using Particle Swarm Optimization (PSO) algorithm. …”
Get full text
Get full text
Get full text
Article -
4
-
5
Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method
Published 2021“…This paper presents the results of optimization for substation grounding systems using the Simulated Annealing (SA) algorithm in different soil conditions which conforms to the safety requirements of the grounding system. …”
Get full text
Get full text
Article -
6
-
7
Articulated robots motion planning using foraging ant strategy
Published 2008“…This paper proposes a novel search technique, the F-Ant algorithm, in order to find a reliable path between the initial configuration and the goal configuration of the articulated robot. …”
Get full text
Get full text
Article -
8
Adaptive model predictive control based on wavelet network and online sequential extreme learning machine for nonlinear systems
Published 2015“…Moreover, the ability of initialization the hidden nodes parameters using density function and recursive algorithm will help WN-OSELM to perform useful generalization facility and modeling accuracy. …”
Get full text
Get full text
Thesis -
9
Enhancing Autonomous Guided Vehicles with Red-Black TOR Iterative Method
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 -
10
Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller
Published 2010“…In this regards, a new method of Pico-satellite attitude control using Mamdani Fuzzy Logic Principles is introduced. …”
Get full text
Thesis -
11
Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib
Published 2019“…The initial solution is important to guide the optimization methods in finding the optimal solution. …”
Get full text
Get full text
Get full text
Thesis -
12
Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach
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 -
13
Network reconfiguration and DG sizing incorporating optimal switching sequence for system improvement / Ola Subhi Waheed Badran
Published 2018“…To assess the capabilities of the proposed method, simulations using MATLAB were carried out on IEEE 16-bus, IEEE 33-bus, IEEE 69-bus, and IEEE 118-bus radial distribution networks. …”
Get full text
Get full text
Get full text
Thesis -
14
Search algorithms for path planning problems in harsh wireless sensor network environment
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 -
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
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
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 -
17
An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment
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 -
18
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
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 -
19
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
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 -
20
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
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
