Search Results - (( using simulation path algorithm ) OR ( evolution optimization modified algorithm ))*
Search alternatives:
- evolution optimization »
- optimization modified »
- simulation path »
- path algorithm »
-
1
A new modified differential evolution algorithm scheme-based linear frequency modulation radar signal de-noising
Published 2015“…A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. …”
Get full text
Get full text
Article -
2
Application of swarm intelligence optimization on bio-process problems / Mohamad Zihin Mohd Zain
Published 2018“…This modified algorithm called Modified Multi-Objective Particle Swarm Optimization (M-MOPSO) employs a fixed-sized external archive along with a dynamic boundary-based search mechanism to evolve the population. …”
Get full text
Get full text
Thesis -
3
A refined differential evolution algorithm for improving the performance of optimization process
Published 2011“…Various Artificial Intelligent (AI) algorithms can be applied in solving optimization problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
4
Improved chemotaxis differential evolution optimization algorithm
Published 2015“…The social foraging behavior of Escherichia coli has recently received great attention and it has been employed to solve complex search optimization problems.This paper presents a modified bacterial foraging optimization BFO algorithm, ICDEOA (Improved Chemotaxis Differential Evolution Optimization Algorithm), to cope with premature convergence of reproduction operator.In ICDEOA, reproduction operator of BFOA is replaced with probabilistic reposition operator to enhance the intensification and the diversification of the search space.ICDEOA was compared with state-of-the-art DE and non-DE variants on 7 numerical functions of the 2014 Congress on Evolutionary Computation (CEC 2014). …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Broadening selection competitive constraint handling algorithm for faster convergence
Published 2020“…In this study, the BSCCH algorithm has been coupled with Differential Evolution algorithm as a proof of concept because it is found to be an efficient algorithm in the literature for constrained optimization problems. …”
Get full text
Get full text
Article -
6
Comparison of path planning in simulated robot
Published 2020“…Thus, a comparison of path planning algorithm in simulated robot will be conducted in this study. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
7
Implementation of laser simulator in robot path determination
Published 2016“…In addition, one of the classical path planning approach which is A* algorithm will be used to compare the result generated by laser simulator. …”
Get full text
Get full text
Undergraduates Project Papers -
8
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
Get full text
Get full text
Thesis -
9
Global Mobile Robot Path Planning using Laser Simulator
Published 2017“…From the results, the laser simulator has advantages in computational time and low collision possibility in comparison with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Autonomous path planning robot using geographical information
Published 2008“…The development of the path planning algorithm is initially presented by the geometrical analysis and it is then analyzed by simulation using Matlab. …”
Get full text
Learning Object -
11
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
Get full text
Thesis -
12
Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space
Published 2015“…A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
Get full text
Get full text
Get full text
Article -
13
Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site
Published 2017“…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
Get full text
Get full text
Final Year Project -
14
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…All simulations were performed using MATLAB with visualization of UAV path planning. …”
Get full text
Get full text
Thesis -
15
Path planning for constant speed robot
Published 2006“…The development of the path planning algorithm is initially presented by the geometrical analysis and it is then analyzed by simulation using Matlab. …”
Get full text
Get full text
Thesis -
16
Simulation of identifying shortest path walkway in library by using ant colony optimization
Published 2012Get full text
Get full text
Undergraduates Project Papers -
17
-
18
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text
Thesis -
19
New algorithm for autonomous dynamic path planning in real-time intelligent robot car
Published 2017“…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
Get full text
Get full text
Get full text
Article -
20
A robust GA-based QoS routing algorithm for solving multi-constrained path problem
Published 2023“…However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. …”
Article
