Search Results - (( using iterative ((method algorithm) OR (path algorithm)) ) OR ( java implications _ algorithm ))
Search alternatives:
- java implications »
- method algorithm »
- using iterative »
- path algorithm »
-
1
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
Published 2021“…In the past, fast iterative methods that apply the use of full-sweep iteration were suggested. …”
Get full text
Get full text
Get full text
Get full text
Article -
2
Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group
Published 2014“…Consequently, the gradient of the potential functions would be used by the searching algorithm to generate path from starting to goal location. …”
Get full text
Get full text
Get full text
Article -
3
Repetitive mutations in genetic algorithm for software test data generations
Published 2022“…One of the white box testing techniques is path coverage testing. Genetic Algorithm (GA) has proven to be an important method in generating test data for automatic path coverage testing. …”
Get full text
Get full text
Thesis -
4
Modelling of multi-robot system for search and rescue
Published 2023“…Moreover, to cope with dynamic environments, a combination of global and local path planning methods is introduced. The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
5
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 -
6
-
7
Image Fusion for Travel Time Tomography Inversion
Published 2015“…Firstly, the shortest path method and the linear travel time interpolation were used for forward calculation; then combined the improved Wilkinson iteration method with super relaxation precondition method to reduce the condition number of matrix and accelerate iterative speed, the precise integration method was used to solve the inverse matrix more precisely in tomography inversion process; finally, use wavelet transform for image fusion, obtain the final image. …”
Get full text
Get full text
Article -
8
Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation
Published 2011“…An ordinary differential equation based on Newton homotopy is used for following the solution path. Our homotop algorithm is much more efficient than the conventional iterations type algorithms. …”
Get full text
Get full text
Get full text
Article -
9
An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman
Published 2019“…For the result, shortest path for the order pickers in iterations. The algorithm used can help the order picker to have the shortest path, but it have no direct path. …”
Get full text
Get full text
Student Project -
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
SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing
Published 2019“…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
Get full text
Get full text
Thesis -
15
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 -
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
Optimised multi-robot path planning via smooth trajectory generation
Published 2024“…A MPSO algorithm, without path smoothening, is used for comparison. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
19
Autonomous path planning through application of rotated two-parameter overrelaxation 9-point Laplacian iteration technique
Published 2020“…The harmonic functions are an appropriate method to be used on autonomous path planning because it satisfies the min-max principle, therefore avoiding the occurrence of local minima which traps robot’s movements, and that it offers complete path planning algorithm. …”
Get full text
Get full text
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
