Search Results - (( same path algorithm ) OR ( same based algorithm ))*

Search alternatives:

Refine Results
  1. 1
    Analysis of Dijkstra’s and A* algorithm to find the shortest path

    Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

    Published 2015
    “…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm

    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

    Published 2023
    “…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”
    Article
    Save to List
    Saved in:
  3. 3
    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm

    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

    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
    Save to List
    Saved in:
  4. 4
    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm

    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah A., Parman S., Abbasi A., Solihin M.I., Manan T.S.A., Beddu S., Ahmad A., Rasdi N.W.

    Published 2023
    Article
    Save to List
    Saved in:
  5. 5
    Path planning algorithm for a car like robot based on MILP method

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Range sensor based local path planning algorithm for mobile robot in unknown static environment with beacon / Wan Ahmad Jailani Wan Ngah

    Range sensor based local path planning algorithm for mobile robot in unknown static environment with beacon / Wan Ahmad Jailani Wan Ngah by Wan Ngah, Wan Ahmad Jailani

    Published 2013
    “…The Bug algorithm is a local path planning methodology for mobile robot which detects the nearest obstacle as the robot moves towards a target with no or very limited information about the environment. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Token based path allocation approach for mobile robots in sorting centre for achieving high throughput

    Token based path allocation approach for mobile robots in sorting centre for achieving high throughput by Khoo, Zong Zheng

    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
    Save to List
    Saved in:
  8. 8
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…The algorithm which consider the error value, e to increment pixels is the crucial part of the line generation applies the same concept in the second approach, where the error value, e is used as indicator to determine the heuristic cost of the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…Results show that for the same network load, DLBR outperforms the shortest path in terms of the average delay and packet loss. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…Results show that for the same network load, DLBR outperforms the shortest path in terms of the average delay and packet loss. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Transmission path optimization Based on Efficiency Communication System

    Transmission path optimization Based on Efficiency Communication System by Jin Fan, Kit, Guan Lim, Sin, Helen Ee Chuo, Min, Keng Tan, Ali Farzamnia, Tze, Kenneth Kin Teo

    Published 2022
    “…In this paper, routing attribute table that is maintained by the nodes, the density and relative distance of node distribution, is used to determine the clustering method. At the same time, the developed algorithm combines the relative position of the cluster and the base station to further improve the routing method of the sub-cluster head, Finally, the algorithm analyzes the influence of different parameters on the transmission path, and use the simulation experiments to evaluate the conclusions.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    UAV collision detection algorithm design based on circle overlapping test

    UAV collision detection algorithm design based on circle overlapping test by Radzi, N.F.M., Mubin, M., Rahim, N.A., Mokhtar, N.

    Published 2012
    “…This paper proposes a design of collision avoidance algorithm for unmanned aerial vehicle based on circle overlapping test. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Hybrid optimal path traceback system development for optimization DNA sequences alignment

    Hybrid optimal path traceback system development for optimization DNA sequences alignment by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…In theoretical design, the proved of concept for the proposed design is calculated based on mathematical equation which defined by Smith-Waterman algorithm. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  15. 15
    Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article

    Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…In theoretical design, the proved of concept for the proposed design is calculated based on mathematical equation which defined by Smith-Waterman algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    General Algorithm of n-Multiple Coil Shape for Variable Links Hyper-Redundant Robotic Manipulator

    General Algorithm of n-Multiple Coil Shape for Variable Links Hyper-Redundant Robotic Manipulator by Jamali, Annisa, Khan, Md. Raisuddin, Rahman , Md Mozasser

    Published 2011
    “…An algorithm is then developed to control the links of the robot along the path so that the robot will travel in such a way that each of the follower links will take place of the earlier link‘s position. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  17. 17
    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm

    Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm by Enshaei, Mehdi

    Published 2015
    “…In this study, a new defence mechanism is proposed based on modification of the packet forwarding process, using Neighborhood Information (NI) and PT algorithm, and known as NIPT algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi

    The shortest route of the potential companies for internship using Dijkstra’s Algorithm / Mohamad Khairul Ikhwan Mohd Radzi by Mohd Radzi, Mohamad Khairul Ikhwan

    Published 2017
    “…However, for optimum distance, dijkstra algorithm has been used. This algorithm is one of the algorithms used for getting the lowest cost search path. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    NSGA-III algorithm for optimizing robot collaborative task allocation in the internet of things environment

    NSGA-III algorithm for optimizing robot collaborative task allocation in the internet of things environment by Shen, jiazheng, Tang, Sai Hong, Mohd Ariffin, Mohd Khairol Anuar, As’arry, Azizan, Wang, Xinming

    Published 2024
    “…By comparing the total distance and maximum deviation of multiple robot systems, it is proven that this algorithm can effectively balance the path length of each robot in task allocation. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: