Search Results - (( developing one path algorithm ) OR ( java applications using algorithm ))
Search alternatives:
- applications using »
- java applications »
- using algorithm »
- developing one »
- path algorithm »
-
1
Smart appointment organizer for mobile application / Mohd Syafiq Adam
Published 2009“…In creating this application, NetBeans IDE 6.5and Java Micro Edition (Java ME) are used. …”
Get full text
Get full text
Thesis -
2
Visdom: Smart guide robot for visually impaired people
Published 2025“…The system architecture integrates ROS 2 on a Raspberry Pi, with TCP/IP connectivity enabling remote operation. An Android mobile application, developed using Java and the java.net.Socket library, provides an intuitive and accessible user interface for seamless interaction with the robot. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
3
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 -
4
-
5
-
6
Provider independent cryptographic tools
Published 2003Get full text
Get full text
Get full text
Monograph -
7
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…The development process for this simulation is using programming language of Microsoft Visual C I t 6.0 and the coding creation depends on the algorithm flowchart and the formula pseudocode. …”
Get full text
Get full text
Thesis -
8
Adaptive path finding algorithm in dynamic environment for warehouse robot
Published 2020“…For example, A* path finding algorithm is developed to obtain the shortest path, while D* obtains a complete coverage path from source to destination. …”
Get full text
Get full text
Get full text
Article -
9
-
10
Automated path testing using the negative selection algorithm
Published 2017Get full text
Get full text
Indexed Article -
11
-
12
-
13
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 -
14
Modelling of multi-robot system for search and rescue
Published 2023“…This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
15
A generalized laser simulator algorithm for optimal path planning in constraints environment
Published 2022“…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
Get full text
Thesis -
16
Comparison of path planning in simulated robot
Published 2020“…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
17
Dynamic path planning algorithm in mobile robot navigation
Published 2011Get full text
Get full text
Conference or Workshop Item -
18
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text
Thesis -
19
Meta-Heuristic Algorithms for Learning Path Recommender at MOOC
Published 2021Get full text
Get full text
Article -
20
Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia
Published 2005“…There are many algorithms have been designed to find these paths. The algorithms such as Djikstra, Bellman-Ford or Floyd- Warshall are difference from one to another due to the simplicity, effectiveness and duration of processing the nodes. …”
Get full text
Get full text
Monograph
