Search Results - (( problem solving path algorithm ) OR ( java application system algorithm ))
Search alternatives:
- java application »
- system algorithm »
- path algorithm »
- solving path »
-
1
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…Dijkstra's Algorithm is one of them. This approach solves the single-source shortest path problem with nonnegative edge weights. …”
Get full text
Get full text
Thesis -
2
Search algorithms for path planning problems in harsh wireless sensor network environment
Published 2017“…This dissertation presents three heuristic search algorithms which all of them descended from the origin Dijkstra’s algorithm that solve multiple different problems arise from path planning in WSN environment. …”
Get full text
Get full text
Thesis -
3
An experiment on the performance of shortest path algorithm
Published 2016“…The analysis of result shows the performance of each algorithm in order to suggest the most efficient algorithm in solving the shortest path problem…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
4
Path Optimization For Cooperative Multi-Head 3d Printing
Published 2020“…Previous authors have shown that the LPOP can be defined in terms of the Undirected Rural Postman Problem (URPP), a known problem in graph theory. Two well-known algorithms for solving a closely related graph theory problem known as the Travelling Salesman Problem (TSP) are the Ant System (AS) and Ant Colony System (ACS) algorithms. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
5
A robust GA-based QoS routing algorithm for solving multi-constrained path problem
Published 2023“…This paper presents a GAbased QoS routing algorithm for solving the general kconstrained problem which has the capability to return multiple feasible paths in a single run. …”
Article -
6
Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria
Published 2018“…In order to achieve the objective, Weighted Sum-Dijkstra’s Algorithm (WSDA), a combination method between WSM and Dijkstra’s Algorithm is applied to solve multiple criteria network problems. …”
Get full text
Get full text
Get full text
Article -
7
-
8
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“…This paper proposes an improved Jellyfish Search algorithm, namely TLDW-JS, for solving the problem of optimal path planning of multi-robot collaboration in the multi-tasking of complex vertical farming environments. …”
Get full text
Get full text
Get full text
Article -
9
Simulation of identifying shortest path walkway in library by using ant colony optimization
Published 2012“…The system is used to be error free and the algorithm can effectively solve the shortest path problem.…”
Get full text
Get full text
Undergraduates Project Papers -
10
A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments
Published 2013“…In this research, a sampling-based path planning algorithm was proposed which employs several heuristic and intelligent techniques to improve the performance of the planner in terms of quality of the resulted paths, runtimes of the planner, stability of the results in different executions, ability to solve difficult problems effectively and capability of planning in unknown environment. …”
Get full text
Get full text
Thesis -
11
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
Get full text
Get full text
Thesis -
12
Finding multi-constrained path using genetic algorithm
Published 2023“…As such, various heuristics and approximation algorithms have been proposed to solve the MCP problem. …”
Conference paper -
13
Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm
Published 2023“…As such, various heuristics and approximation algorithms have been proposed to solve the MCP problem. …”
Article -
14
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
Get full text
Get full text
Get full text
Article -
15
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 -
16
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 -
17
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 -
18
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 -
19
Path planning algorithm for a car like robot based on MILP method
Published 2013“…The findings of this research have shown that the MILP method can be used in the path planning problem in terms of finding a safe and shortest path. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town
Published 2005“…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
Get full text
Get full text
Get full text
Thesis
