Search Results - (( wave optimization path algorithm ) OR ( problem application system algorithm ))
Search alternatives:
- problem application »
- wave optimization »
- optimization path »
- system 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
-
13
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 -
14
Heuristic factors in ant system algorithm for course timetabling problem
Published 2009Get full text
Get full text
Conference or Workshop Item -
15
Ant colony optimization in dynamic environments
Published 2010“…In order to achieve this objective, six ant algorithms namely Ant System (AS), Ant Colony System (ACS), Best-Worst Ant System (BWAS), Elitist Ant System (EAS), Max-Min Ant System (MMAS) and Rank-Based Ant System (RBAS) were implemented to solve a dynamic optimization problem in the form of the dynamic Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Get full text
Thesis -
16
Development of optimization Alghorithm for uncertain non-linear dynamical system
Published 2004Get full text
Get full text
Monograph -
17
-
18
Scheduling jobs in computational grid using hybrid ACS and GA approach
Published 2014Get full text
Get full text
Get full text
Conference or Workshop Item -
19
New heuristic function in ant colony system for job scheduling in grid computing
Published 2012Get full text
Get full text
Conference or Workshop Item -
20
Interacted Multiple Ant Colonies for Search Stagnation Problem
Published 2010“…The experimental results show the superiority of the proposed approach than existing one colony ant algorithms like the ant colony system and max-min ant system. …”
Get full text
Get full text
Get full text
Thesis
