Search Results - (( basic complex path algorithm ) OR ( java optimisation based algorithm ))
Search alternatives:
- optimisation based »
- java optimisation »
- path algorithm »
- basic complex »
- complex path »
-
1
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2021“…This paper develops a path planning algorithm of hyper-redundant manipulators to achieve a cyclic property. …”
Get full text
Get full text
Get full text
Article -
2
Particle swarm optimization (PSO) for CNC route problem
Published 2002“…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
Get full text
Get full text
Undergraduates Project Papers -
3
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
4
IMPLEMENTATION OF BEHAVIOUR BASED NAVIGATION IN A PHYSICALLY CONFINED SITE
Published 2017“…Selected basic behaviour-based algorithms such as wallfollower, obstacle avoidance, escape route and target detection are to be combined and its efficiency is measured. …”
Get full text
Get full text
Final Year Project -
5
Web-based expert system for material selection of natural fiber- reinforced polymer composites
Published 2015“…Finally, the developed expert system was deployed over the internet with central interactive interface from the server as a web-based application. As Java is platform independent and easy to be deployed in web based application and accessible through the World Wide Web (www), this expert system can be one stop application for materials selection.…”
Get full text
Get full text
Thesis -
6
-
7
A framework of test case prioritisation in regression testing using particle swarm-artificial bee colony algorithm
Published 2024“…The developed framework, grounded in fault-based testing theory, comprises three key components: inputs, prioritization factors, and a prioritization algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
8
Unconstraint assignment problem : a molecular computing approach
Published 2006“…On the other hand, for the computational phase, itis discovered that the complexity of the unconstraint assignment problem can be reduced to a path problem of a graph, and thepossibility to solve the unconstraint assignment problem by DNA computing approach is shown in detail.…”
Get full text
Get full text
Article -
9
Enhanced Mobility Solution In Mobile Ipv6 Network
Published 2008“…Enhanced Mobility Solution in Mobile IPv6 Network is extremely complex; the study addressed the multihoming issues of MIPV6 Networks on the basis of NEMO Basic Support, analyzes the benefits of multihoming and discusses implementation issues of all classes of multihoming possibilities. …”
Get full text
Get full text
Thesis
