Search Results - (( optimal ((path algorithm) OR (based algorithm)) ) OR ( optimal tree algorithm ))
Search alternatives:
- path algorithm »
- tree algorithm »
- optimal tree »
-
1
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
Get full text
Get full text
Get full text
Article -
2
Robot manipulator minimum jerk trajectory planning based on the improved dung Beetle Optimizer Algorithm
Published 2024“…This paper discusses different algorithms and finally proposes a fusion of the improved Dung Beetle Optimizer (IDBO) algorithm using chaotic mapping, sinusoidal random mutation, and nonlinear convergence strategies with the bidirectional Rapidly exploring Random Tree (RRT) algorithm to achieve manipulator trajectory planning and minimum jerk optimization trajectory. …”
Get full text
Get full text
Article -
3
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text
Thesis -
4
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…A depth - first search algorithm is used to search for optimal chaining. Theorems on number of branches needed to be explored at each node of search tree are derived. …”
Get full text
Get full text
Thesis -
5
Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments
Published 2013“…The recent development of its variant: RRT* is considered as a major breakthrough as it makes it possible to achieve optimality in paths planning. However, its limitations include the infinite time it takes to reach the optimal solution and a very slow rate of convergence. …”
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 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 -
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 safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree
Published 2022“…The rough path is optimized by applying the cubic spline interpolation method to solve the problem that the path cannot be applied to the actual vehicle driving task. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
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 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 -
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
Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm
Published 2015“…Developing an exploration algorithm based on spanning tree is the main contribution. …”
Get full text
Get full text
Thesis -
15
Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network
Published 2010“…This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
Get full text
Get full text
Thesis -
16
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 -
17
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 -
18
-
19
Electricity distribution network for low and medium voltages based on evolutionary approach optimization
Published 2015“…This thesis proposes an algorithm to find the optimum distribution substation placement and sizing by utilizing the PSO algorithm and optimum feeder routing using modified Minimum Spanning Tree (MST). …”
Get full text
Get full text
Get full text
Thesis -
20
Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks
Published 2012“…It is based on Ant Colony Optimization (ACO) meta heuristic, which is adopted to enhance the paths with the best-quality function. …”
Get full text
Get full text
Thesis
