Search Results - (( initial solving based algorithm ) OR ( using combination using algorithm ))
Search alternatives:
- combination using »
- initial solving »
- using algorithm »
-
1
An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment
Published 2023“…The use of sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
2
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
3
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
4
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
5
A genetic algorithm for solving single level lotsizing problems
Published 2003“…The combination of the population-generating heuristic with genetic algorithm results in a faster convergence in finding the optimal lot-sizing scheme due to the guaranteed feasibility of the initial population.…”
Get full text
Get full text
Article -
6
MRI segmentation of medical images using FCM with initialized class centers via genetic algorithm
Published 2008“…We noticed that for some images, FCM is sensitive to initialization of centre of clusters. This article introduced a new method based on the combination of genetic algorithm and FCM to solve this problem. …”
Get full text
Get full text
Conference or Workshop Item -
7
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
8
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
9
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article -
10
A Dual Recurrent Neural Network-based Hybrid Approach for Solving Convex Quadratic Bi-Level Programming Problem
Published 2020“…The current paper presents a neural network-based hybrid strategy that combines a Genetic Algorithm (GA) and a Dual Recurrent Neural Network (DRNN) for efficiently and accurately solving the quadratic-Bi-level Programming Problem (BLPP). …”
Get full text
Get full text
Article -
11
Path planning algorithm for a car like robot based on MILP method
Published 2013“…This algorithm provides the robot the possibility to move from the initial position to the final position (target). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Disparity map algorithm for stereo matching process using local based method
Published 2022“…At this stage, the proposed work uses the combination of Absolute Difference (AD) and Gradient Matching (GM) to produce the initial disparity map. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
13
Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics
Published 2016“…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
Get full text
Get full text
Get full text
Article -
14
Solving computational algorithm using CLONALNet technique based on artificial clonal selection
Published 2023“…This paper discusses the approach of CLONALNet in determining the optimum fitness function and mean population by benchmarking it with CLONALG. By using this algorithm the steps to obtain the fitness function is optimized and processing time is reduced. …”
Conference paper -
15
Solving an application of university course timetabling problem by using genetic algorithm
Published 2022“…Among the approaches, genetic algorithm (GA), constructed based on Darwin's theory of evolution, becomes the renowned approach to solve various types of timetabling problems. …”
Get full text
Get full text
Get full text
Thesis -
16
Data mining based damage identification using imperialist competitive algorithm and artificial neural network
Published 2018“…In this study, to predict the damage severity of sin-gle-point damage scenarios of I-beam structures a data mining based damage identification framework and a hybrid algorithm combining Artificial Neural Network (ANN) and Imperial Competitive Algorithm (ICA), called ICA-ANN method, is proposed. …”
Get full text
Get full text
Article -
17
Fuzzy clustering method and evaluation based on multi criteria decision making technique
Published 2018“…The proposed algorithm is used as a pre-processing method for data followed by Gustafson-Kessel (GK) algorithm to classify credit scoring data. …”
Get full text
Get full text
Get full text
Thesis -
18
Enhancing the Sorting Layers in the Initial Stage of High School Timetabling
Published 2020“…KHE is an algorithm that generates initial solution of HSTP. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
Disparity map algorithm using hierarchical of bitwise pixel differences and segment-tree from stereo image
Published 2024“…This thesis presents a local-based stereo matching algorithm to increase the accuracy on complex regions. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
Get full text
Get full text
Get full text
Article
