Search Results - (( initial solving path algorithm ) OR ( data distribution function algorithm ))
Search alternatives:
- function algorithm »
- data distribution »
- initial solving »
- path algorithm »
- solving path »
-
1
Search algorithms for path planning problems in harsh wireless sensor network environment
Published 2017“…Each algorithm solves its respective problem with Enhanced D* solving long initial delay in dynamic environment, NBN solves harsh conditions with limited computational power, and FWN optimized the result of TSP path planning problem with minimal computational effort. …”
Get full text
Get full text
Thesis -
2
An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment
Published 2023“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
3
AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT
Published 2023“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
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“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
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“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
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“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
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“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
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“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
9
Path planning algorithm for a car like robot based on MILP method
Published 2013“…This algorithm provides the robot the possibility to move from the initial position to the final position (target). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
10
Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms
Published 2025“…The VFSMRCTP model is solved using the TLDW-JS algorithm and a number of comparison algorithms in order to analyze the algorithm’s performance. …”
Get full text
Get full text
Get full text
Article -
11
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text
Thesis -
12
Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system
Published 2021“…A common algorithm to solve the single-source shortest path (SSSP) is the Dijkstra algorithm. …”
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“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
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“…Thus, RRT*-Smart, a further development of RRT*, is considered ideal for solving RRT* problems. Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
Get full text
Get full text
Get full text
Article -
15
-
16
Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff
Published 2011“…The objective is to verify and compare the effectiveness of both algorithms in finding the optimal robot path in different types of global map environments. …”
Get full text
Get full text
Thesis -
17
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 -
18
Solving traveling salesman problem on cluster compute nodes
Published 2009“…Initially a sequential algorithm is fabricated from scratch and written in C language. …”
Get full text
Get full text
Article -
19
-
20
Robot path planning using family of SOR iterative methods with laplacian behaviour-based control
Published 2015“…In addition, the newly proposed LBBC overcomes the drawback of the existing GDS that face difficulty when handling complex environment. Finally, the path planning problem is solved by combining the fast iterative method with the robust path searching LBBC technique, so that the path planning algorithm is capable of handling large and complex environment.…”
Get full text
Get full text
Get full text
Thesis
