Search Results - ((((((path algorithm) OR (tree algorithm))) OR (_ algorithm))) OR (based 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
A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree
Published 2022“…In order to enhance the commuting ability of autonomous vehicles on the road and ensure the comfort and safety of passengers, the Rapid-exploration Random Tree (RRT) algorithm is applied to the research of safe overtaking control of autonomous vehicles. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
3
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 -
4
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…The result will be compared with euler's path algorithm using heuristic search and a pseudo input to find the minimum interlace.…”
Get full text
Get full text
Thesis -
5
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 -
6
An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points
Published 2019“…The algorithm is designed to consider the ME’s tour length and the shortest path tree (SPT) jointly. …”
Get full text
Get full text
Get full text
Article -
7
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019Subjects: “…Algorithms…”
Get full text
Get full text
Thesis -
8
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 -
9
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010Subjects: Get full text
Get full text
Thesis -
10
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 -
11
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 -
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
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
Efficient terrain coverage for deploying wireless sensor nodes on multi-robot system
Published 2016“…Employing multi-robot system and path planning with spanning tree algorithm is a strategy for speeding up sensor nodes deployment. …”
Get full text
Get full text
Get full text
Article -
16
Nano-scale VLSI clock routing module based on useful-skew tree algorithm
Published 2006“…We implemented Useful-Skew Tree (UST) algorithm which is based on the deferred-merge embedding (DME) paradigm, as the clock layout synthesis engine. …”
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
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 -
20
Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method
Published 2018“…Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
Get full text
Get full text
Get full text
Get full text
Thesis
