Search Results - intelligence _ ((tree algorithm) OR (((acs algorithm) OR (path algorithm))))
Search alternatives:
- tree algorithm »
- path algorithm »
- acs algorithm »
-
1
Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).
Published 2007Get full text
Get full text
Conference or Workshop Item -
2
A Scalable Algorithm for Constructing Frequent Pattern Tree
Published 2014Get full text
Get full text
Get full text
Article -
3
A comprehensive overview of classical and modern route planning algorithms for self-driving mobile robots
Published 2022“…This evaluation focuses mostly on the accuracy of the different path-planning algorithms. Common collision-free path planning methodologies are examined in this paper, including classical or traditional and modern intelligence techniques, as well as both global and local approaches, in static and dynamic environments. …”
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 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 -
5
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 -
6
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 -
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
-
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
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 -
11
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 -
12
An Intelligent System Approach to the Dynamic Hybrid Robot Control
Published 1996“…A one-pass smoothing algorithm was used to generate a practical smooth trajectory path in near real time. …”
Get full text
Get full text
Thesis -
13
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 -
14
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 -
15
Neutralisation state driven single-agent search strategy for solving constraint satisfaction problem / Saajid Akram Ahmed Abuluaih
Published 2019“…Since Constraint Satisfaction Problem (CSP) is an NP-complete problem, brute-force search algorithms such as Backtracking algorithm (BT) are required as the guarantee to find a solution, when there is one. …”
Get full text
Get full text
Thesis -
16
A Kalman Filter Approach to PCB Drill Path Optimization Problem
Published 2017“…This paper presents a Kalman Filter approach in solving printed circuit board (PCB) routing problem by using the Simulated Kalman Filter (SKF) algorithm. The experimental results are compared with those obtained by swarm intelligence approach, which are the Particle Swarm Optimization (PSO) variants, Ant Colony System (ACS) and Cuckoo Search (CS). …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
Linking Bayesian Network and Intensive Care Units Data: A Glycemic Control Study
Published 2023“…Decision support systems; Forecasting; Intensive care units; Medical informatics; Trees (mathematics); Accurate prediction; Causal Bayesian network; Discretization algorithms; Discretizations; Glycemic control; Intelligent mechanisms; Performance prediction; Variable selection; Bayesian networks…”
Conference Paper -
18
Online PID controller tuning using tree physiology optimization
Published 2017Get full text
Get full text
Article -
19
A Robust Graph Theoretic Solution of Routing in Intelligent Networks
Published 2022“…The fast construction of shortest-path tree (SPT) is important to devise an efficient routing in a nondelay tolerant networks. …”
Get full text
Get full text
Article -
20
Modeling and simulation of WSNs for agriculture applications using dynamic transmit power control algorithm
Published 2013Get full text
Working Paper
