Search Results - optimal ((((((path algorithm) OR (tree algorithm))) OR (graph algorithm))) OR (based algorithm))
Search alternatives:
- graph algorithm »
- 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
Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan
Published 1997“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text
Thesis -
3
-
4
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text
Article -
5
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text
Article -
6
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text
Student Project -
7
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
Published 1997“…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
Get full text
Get full text
Thesis -
8
High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm
Published 2015“…The information then is used to generate a directed graph in order to obtain the shortest path results through the implementation of shortest path algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
9
Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm
Published 2023“…The environment design is based on a 2-D coordinated graph with irregular shapes as the semi-dynamic obstacle and by restructuring the genes to plan a robot path. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text
Article -
11
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text
Article -
12
Path planning algorithm for a car-like robot based on cell decomposition method
Published 2013“…Then, the connectivity graph is created followed by calculating the shortest path by Dijkstra’s algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
13
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 -
14
AUTOMATIC ROUTE FINDER FOR NEW VISITORS
Published 2006“…This study is based on Dijkstra's algorithm as the algorithm finds the most effective way to traverse an entire graph. …”
Get full text
Get full text
Final Year Project -
15
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 -
16
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 -
17
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 -
18
Modeling of static and dynamic components of bio-nanorobotic systems
Published 2012“…In addition, a graph algorithm based on greedy methods is employed to compute a new set of optimal weighted electronic properties of the fullerenes via computing their Minimum Weight Spanning Trees (MWSTs). …”
Get full text
Get full text
Thesis -
19
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 -
20
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