Search Results - (( problem using ((task algorithm) OR (path algorithm)) ) OR ( java application using algorithm ))
Search alternatives:
- java application »
- using algorithm »
- task algorithm »
- path algorithm »
-
1
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 -
2
Batch mode heuristic approaches for efficient task scheduling in grid computing system
Published 2016“…We simulate our proposed algorithms using a Java based simulator that is purposedly built for Grid computing simulations. …”
Get full text
Get full text
Get full text
Thesis -
3
-
4
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the scanning tasks need to be segregated and assigned for each scanner head, and path planning where the best combinatorial paths for each scanner are determined in order to minimize the total motion of scanning time. …”
Get full text
Get full text
Thesis -
5
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Offloading heavy data size to a remote node introduces the problem of additional delay due to transmission. Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text
Article -
6
Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site
Published 2017“…Path planning is described as the ability of the mobile robot to navigate without collision within the generated map from the starting point to the goal point using the shortest path and this enables autonomous navigation robots to perform many useful tasks. …”
Get full text
Get full text
Final Year Project -
7
-
8
Ant colony optimization (ACO) algorithm for CNC route problem
Published 2012“…This project is about to develop a software which applying ACO algorithm in order to calculate the shortest path available that can reduce the time taken to drill the entire hole of PCB. …”
Get full text
Get full text
Undergraduates Project Papers -
9
The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement
Published 2025“…SGA is used in the process of solving optimization test problems by neural networks. …”
Article -
10
-
11
-
12
A review on autonomous mobile robot path planning algorithms
Published 2020“…The purpose of this paper is to review the mobile robots path planning problem, optimization criteria and various methodologies reported in the literature for global and local mobile robot path planning. …”
Get full text
Get full text
Get full text
Article -
13
A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree
Published 2022“…The rough path is optimized by applying the cubic spline interpolation method to solve the problem that the path cannot be applied to the actual vehicle driving task. …”
Get full text
Get full text
Get full text
Get full text
Proceedings -
14
Deadline guarantee for scientific workflow using dynamic scheduling algorithms on IaaS clouds
Published 2018“…Specifically, we enhance two scheduling algorithms Proportional Deadline Constrained (PDC) and Deadline Constrained Critical Path (DCCP) that address the workflow scheduling problem in Infrastructure as a Service (IaaS) Cloud. …”
Get full text
Get full text
Thesis -
15
Token based path allocation approach for mobile robots in sorting centre for achieving high throughput
Published 2024“…This project proposes an improved path-finding algorithm that implements token-based path finding while a robot wants to access a grid cell. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
16
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2023“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Article -
17
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2023“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Article -
18
-
19
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2006“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Get full text
Get full text
Get full text
Article -
20
Input-output based relation combinatorial testing using whale optimization algorithm for generating near optimum number of test suite
Published 2025“…Software testing is necessary to verify that the employed system is confident enough to be used in a specific task according to the required demand. …”
Get full text
Get full text
Get full text
Article
