Search Results - (( developing cost path algorithm ) OR ( java application using algorithm ))
Search alternatives:
- java application »
- developing cost »
- using algorithm »
- path algorithm »
-
1
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Thus, a new algorithm known as infection evolution (IE) was developed in this study. …”
Get full text
Get full text
Thesis -
2
Automated path testing using the negative selection algorithm
Published 2017“…Software testing is an important step in the software development process, accounting for more than 50% of software development cost as it is laborious and time-consuming. …”
Get full text
Get full text
Indexed Article -
3
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
Get full text
Thesis -
4
Implementation of laser simulator in robot path determination
Published 2016“…From this research, the laser simulator has advantages in computational time and low collision possibility compare with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
Get full text
Get full text
Undergraduates Project Papers -
5
Path planning algorithm for a car like robot based on Coronoi Diagram Method
Published 2013“…The purpose of this study is to develop an efficient offline path planning algorithm that is capable of finding optimal collision-free paths from a starting point to a goal point. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
6
Optimum Time-Cost Trade-Off Strategies on Critical Path Method for Project Management
Published 2010“…Crashing in CPM means crashing one time unit from critical activity that has smallest cost slope while ensuring that the critical path is still the longest path in the project network. …”
Get full text
Get full text
Thesis -
7
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…The major objective of this project is to develop a computerize system using Dijkstra’s algorithm to find the shortest path for heavy transportation to deliver the goods in more efficient way to save cost and fast delivery. …”
Get full text
Get full text
Thesis -
8
Meta-Heuristic Algorithms for Learning Path Recommender at MOOC
Published 2021“…We have developed Metaheuristic algorithms includes the Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), to solve the proposed model. …”
Get full text
Get full text
Article -
9
Global Mobile Robot Path Planning using Laser Simulator
Published 2017“…From the results, the laser simulator has advantages in computational time and low collision possibility in comparison with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…Software testing consumes half of the entire software development cost where test case generation is the most cost consuming activity in the whole process. …”
Get full text
Get full text
Get full text
Thesis -
11
RSA Encryption & Decryption using JAVA
Published 2006“…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
Get full text
Get full text
Final Year Project -
12
-
13
-
14
Particle swarm optimization approach in route navigation for PoSVI-Cane
Published 2023“…The cost of path at the optimal route is 823 at 40 iterations. …”
Get full text
Get full text
Get full text
Article -
15
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
16
UiTM Malaysia route planner / Mohamad Yunus Mohamed Nasir
Published 2008“…The shortest route is most appropriate than others because it can save time, cost and effort. The Route Planner's core is Dijkstra's shortest-path-finding algorithm, with extensions for time dependent delays and paths constrained by travel mode. …”
Get full text
Get full text
Thesis -
17
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 -
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
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
