Search Results - (( developing study path algorithm ) OR ( java implication based algorithm ))

Refine Results
  1. 1

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Thus, a new algorithm known as infection evolution (IE) was developed in this study. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…The shortest path problem has been widely studied for decades. …”
    Get full text
    Get full text
    Thesis
  3. 3

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    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
  4. 4

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…The objective is to design and develop an evacuation route using shortest path algorithm based on the evacuation map of the building. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

    Published 2012
    “…This study discussed the emphasis on the single source shortest path at the location of specific studies. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Meta-Heuristic Algorithms for Learning Path Recommender at MOOC by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N.

    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
  7. 7

    Dynamic path planning algorithm in mobile robot navigation by Yun, S.C., Parasuraman, S., Ganapathy, V.

    Published 2011
    “…This study is focused on exploring the algorithm that avoids acute obstacles in the environment. …”
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Path planning algorithm for a car like robot based on Coronoi Diagram Method by Inun, Haidie

    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
  9. 9

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    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
  10. 10

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…Thus, a comparison of path planning algorithm in simulated robot will be conducted in this study. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  11. 11

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

    Published 2021
    “…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

    Published 2006
    “…This study is based on Dijkstra's algorithm as the algorithm finds the most effective way to traverse an entire graph. …”
    Get full text
    Get full text
    Final Year Project
  13. 13

    Novel algorithm for mobile robot path planning in constrained environment by Aisha, Muhammad, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi Faiz, ., Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi, Faiz, Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…This paper presents a development of a novel path planning algorithm, called Generalized Laser simulator (GLS), for solving the mobile robot path planning problem in a two-dimensional map with the presence of constraints. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Repetitive mutations in genetic algorithm for software test data generations by Kadhim, Mohammed Majid

    Published 2022
    “…One of the white box testing techniques is path coverage testing. Genetic Algorithm (GA) has proven to be an important method in generating test data for automatic path coverage testing. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

    Published 2012
    “…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
    Get full text
    Get full text
    Student Project
  17. 17

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Modeling of cardiovascular diseases (CVDs) and development of predictive heart risk score by Mirza Rizwan, Sajid

    Published 2021
    “…Cardiovascular diseases (CVDs) are the leading cause of death, with 31% of global mortality. The purpose of this study is two folds such as the development of a statistically valid path model which considered the possible non-linear paths, mediators, and binary endogenous feature of CVDs status. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Development of robust control scheme for wheeled mobile robot in restricted environment by Muhammad Sawal, A Radzak

    Published 2021
    “…The proposed LSL is then integrated with existing Active Force Control (AFC) and PD to ensure good closed loop performance and reject the noise and disturbances. A simulation study of WMR control in pre-planned paths in two environments namely, zigzag and highly curved terrains, has been conducted to verify the proposed algorithm and compare it with other existed algorithms. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

    Published 2018
    “…It is one of the vital aspects in enhancing an autonomy of a robot. Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis