Search Results - (( initial solution path algorithm ) OR ( using classification modelling algorithm ))
Search alternatives:
- classification modelling »
- using classification »
- modelling algorithm »
- initial solution »
- path algorithm »
-
1
Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach
Published 2024“…To address the nutcracker algorithm’s sensitivity to initial conditions and slow convergence, a population initialization strategy is introduced for more diverse initial populations. …”
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“…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 -
3
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 -
4
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 -
5
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 -
6
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 -
7
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 -
8
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 -
9
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 -
10
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
Get full text
Get full text
Thesis -
11
Solving the optimal path planning of a mobile robot using improved Q-learning
Published 2019“…Yet, despite such advantage, Q-learning exhibits slow convergence to the optimal solution. In order to address this limitation, the concept of partially guided Q-learning is introduced wherein, the flower pollination algorithm (FPA) is utilized to improve the initialization of Q-learning. …”
Get full text
Get full text
Get full text
Article -
12
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 -
13
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 -
14
A novel hybrid classification model of genetic algorithms, modified k-Nearest Neighbor and developed backpropagation neural network
Published 2014“…In the present study, the results of the implementation of a novel hybrid feature selection-classification model using the above mentioned methods are presented. …”
Get full text
Get full text
Get full text
Article -
15
Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms
Published 2025“…The VFSMRCTP model is solved using the TLDW-JS algorithm and a number of comparison algorithms in order to analyze the algorithm’s performance. …”
Get full text
Get full text
Get full text
Article -
16
Comparison of expectation maximization and K-means clustering algorithms with ensemble classifier model
Published 2018“…EM and K-means clustering algorithms are used to cluster the multi-class classification attribute according to its relevance criteria and afterward, the clustered attributes are classified using an ensemble random forest classifier model. …”
Get full text
Get full text
Get full text
Article -
17
An adaptive ant colony optimization algorithm for rule-based classification
Published 2020“…Various classification algorithms have been developed to produce classification models with high accuracy. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
18
Predicting breast cancer using ant colony optimisation / Siti Sarah Aqilah Che Ani
Published 2021“…This study implements a machine learning algorithm called Ant Colony Optimization (ACO) algorithm to develop an accurate classification model for predicting breast cancer cells. …”
Get full text
Get full text
Student Project -
19
Formulating new enhanced pattern classification algorithms based on ACO-SVM
Published 2013“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text
Article -
20
Classification model for water quality using machine learning techniques
Published 2015“…In assessing the result, the Lazy model using K Star algorithm was the best classification model among the five models had the most outstanding accuracy of 86.67%. …”
Get full text
Get full text
Article
