Search Results - (( developing function affect algorithm ) OR ( wave optimization path algorithm ))
Search alternatives:
- developing function »
- wave optimization »
- optimization path »
- affect algorithm »
- path algorithm »
-
1
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text
Thesis -
2
A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance
Published 2022“…An optimal path between the start and target point is found by forming a wave of points in all directions towards the target position considering target minimum and border maximum distance principles. …”
Get full text
Get full text
Get full text
Get full text
Article -
3
Novel algorithm for mobile robot path planning in constrained environment
Published 2021“…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text
Get full text
Article -
4
Novel algorithm for mobile robot path planning in constrained environment
Published 2022“…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text
Article -
5
Novel algorithm for mobile robot path planning in constrained environment
Published 2022“…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
Get full text
Get full text
Get full text
Article -
6
Development of a State-Space Observer for Active Noise Control Systems
Published 2009“…The secondary path of the ANC system is modeled by using the LMS algorithm to complete the design of the Filtered-X Least Mean Square (FXLMS) controller. …”
Get full text
Get full text
Thesis -
7
Levy slime mould algorithm for solving numerical and engineering optimization problems
Published 2022“…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
8
Efficient and scalable ant colony optimization based WSN routing protocol for IoT
Published 2020“…For this reason, many intelligent systems have been utilized to design routing algorithms to handle the network's dynamic state. In this paper, an ant colony optimization (ACO) based WSN routing algorithm for IoT has been proposed and analyzed to enhance scalability, to accommodate node mobility and to minimize initialization delay for time critical applications in the context of IoT to find the optimal path of data transmission, improvising efficient IoT communications. …”
Get full text
Get full text
Get full text
Get full text
Article -
9
-
10
Efficient relay placement algorithm using landscape aware routing (erpalar)
Published 2011“…ERP ALAR was implemented in Matlab R2009a using Genetic Algorithm (GA) with multi-objectives. GA is an optimization algorithm that simulates natural selection process as found in nature. …”
Get full text
Get full text
Thesis -
11
-
12
Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid
Published 2012“…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text
Monograph -
13
Semiparametric inference procedure for the accelarated failure time model with interval-censored data
Published 2019“…The rank-based methods, estimating algorithms, and resampling techniques that are developed do not involve the difficulties of the existing estimating procedures. …”
Get full text
Get full text
Get full text
Thesis -
14
Shunt active power filter using hybrid fuzzy-proportional and crisp-integral control algorithms for total harmonic distortion improvement
Published 2016“…Nevertheless, it has limited function in which it requires a supported conventional synchronization algorithm. …”
Get full text
Get full text
Thesis -
15
Development of automatic pest sampling and detection system for cash crops
Published 2019“…Different kernel functions such as disk, diamond, square, and sphere are used as matching functions for insect detection and counting algorithm. …”
Get full text
Get full text
Thesis -
16
March-based diagnosis algorithm for static random-access memory stuck-at faults and transition faults
Published 2012“…March tests are developed based on functional fault model (FFM) such as stuck-at faults (SAFs), transition faults (TFs) and coupling faults (CFs). …”
Get full text
Get full text
Thesis -
17
Real time nonlinear filtered-x lms algorithm for active noise control
Published 2012“…The NLFXLMS algorithm is a stochastic gradient algorithm that incorporates the derivative of a nonlinear plant model which is represented by the scaled error function (SEF) in the controller design. …”
Get full text
Get full text
Thesis -
18
-
19
Tree-based contrast subspace mining method
Published 2020“…Then, the tree-based method, the genetic algorithm based parameter values identification of tree-based method, and followed by the genetic algorithm based tree-based method, for numerical data sets are developed and evaluated. …”
Get full text
Get full text
Get full text
Thesis -
20
Particle swarm optimization for neural network learning enhancement
Published 2006“…Two programs have been developed; Particle Swarm Optimization Feedforward Neural Network (PSONN) and Genetic Algorithm Backpropagation Neural Network (GANN). …”
Get full text
Get full text
Thesis
