Search Results - optimal ((((path algorithm) OR (drops algorithm))) OR (((tree algorithm) OR (_ algorithm))))
Search alternatives:
- path algorithm »
- tree algorithm »
-
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
Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks
Published 2012“…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
Get full text
Get full text
Thesis -
3
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In the benchmarking of the SKF and ssSKF algorithms’ performance in solving the 14-hole PCB drill path optimization case study with recent implementations, on average, both algorithms show the ability to converge to the optimal solution at a smaller number of function evaluations compared to the Gravitational Search Algorithm (GSA), Cuckoo Search (CS), and Intelligent Water Drop (IWD), although fall-short to the Taguchi- Genetic Algorithm optimization algorithm.…”
Get full text
Get full text
Thesis -
4
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 -
5
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 -
6
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 -
7
Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments
Published 2013“…Rapidly Exploring Random Trees (RRT) are regarded as one of the most efficient tools for planning feasible paths for mobile robots in complex obstacle cluttered environments. …”
Get full text
Get full text
Get full text
Article -
8
A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree
Published 2022“…Firstly, the kinematics and dynamic model of the vehicle are implemented. Secondly, the RRT algorithm and the A-star algorithm are expounded, and the idea of the A-star algorithm is applied to the RRT algorithm for improvement. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
9
Optimized topology control in mobile IP networks using a new parametric routing algorithm
Published 2018“…Then, a new optimal routing algorithm is proposed to make up the node failure and changing Foreign Agent (FA). …”
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 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 -
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
The performance effect due to varying network topologies on a software-defined network employing the k-shortest path
Published 2022“…K-shortest paths algorithm discovers a set of paths ordered in the most optimal, optimal, and suboptimal, has a very wide application is integrated into SDN controller to handle routing functionality. …”
Get full text
Get full text
Article -
15
Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm
Published 2015“…Employing a multi-robot system and path planning with spanning tree algorithm is a strategy for speeding up sensor node deployment. …”
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
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 -
19
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 -
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
