Search Results - same ((growth algorithm) OR (((path algorithm) OR (search 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
    “…It needs the appropriate algorithm to search the shortest path. Therefore, the purpose of this research is to explore which is the best shortest path algorithm by comparing the two types of algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Comparison of path planning in simulated robot

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

    Published 2020
    “…If all the robots use the same path planning algorithm, it is possible that they may not bring the greatest benefit. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    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
    “…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    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:
  6. 6
    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:
  7. 7
    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:
  8. 8
    Test case minimization applying firefly algorithm

    Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

    Published 2018
    “…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement

    The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement by Hosseini E., Al-Ghaili A.M., Kadir D.H., Daneshfar F., Gunasekaran S.S., Deveci M.

    Published 2025
    “…In this study, a new idea centered on seed growth, Seed Growth Algorithm (SGA), as a conditional convergent evolutionary algorithm is proposed for optimizing several discrete and continuous optimization problems. …”
    Article
    Save to List
    Saved in:
  10. 10
    Application of Genetic Algorithm in solving Tourist Routing Problem

    Application of Genetic Algorithm in solving Tourist Routing Problem by Yusof, Siti Sarah

    Published 2013
    “…TRP is a variance of Travelling Salesman Problem (TSP) which can defined by finding the optimal path to travel from point A to point B by going through the same place not more than twice at a shortest distance. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  11. 11
    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:
  12. 12
    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution

    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

    Published 2017
    “…For the purpose of testing the algorithm’s capability and reliability, it was applied to solve the same problem online validated and it achieved success in finding a shorter route. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network

    Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network by Halim, Nurul Hamimi

    Published 2018
    “…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Efficient multi-UAV coordination via rl: joint path planning and task scheduling for post-disaster UAV-assisted MEC systems

    Efficient multi-UAV coordination via rl: joint path planning and task scheduling for post-disaster UAV-assisted MEC systems by Adnan, Mohd Hirzi, Ahmad Zukarnain, Zuriati, Subramaniam, Shamala K.

    Published 2025
    “…In this paper, we propose the Geometric Reinforcement Learning Algorithm (GRLA), a unified framework for joint path planning and task scheduling in multi-UAV MEC systems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Genetic algorithm based network coding in wireless ad hoc networks

    Genetic algorithm based network coding in wireless ad hoc networks by Tan, Shee Eng

    Published 2013
    “…Therefore, coding-aware routing is important to explore the data traffic flows with more network coding opportunities. Genetic algorithm based coding-aware routing (GACAR) is embedded in the wireless ad hoc network with network coding capabilities to search for coding opportunities for unicast sessions. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Route optimization using shortest path method / Muhamad Faisal Amin Shakri

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Dynamic interactive 3D mobile navigation aid

    Dynamic interactive 3D mobile navigation aid by Adamu, Abubakar Ibrahim, Mantoro, Teddy, SHAFI’I, M.A.

    Published 2012
    “…The use of bi-A* Algorithm is to establish a forward and backward search for a destination or a position of users, while the use of voronoi diagram is to establish points and region within the navigation environment. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Straight projection conflict detection and cooperative avoidance for autonomous unmanned aircraft systems

    Straight projection conflict detection and cooperative avoidance for autonomous unmanned aircraft systems by Albaker, B.M., Rahim, N.A.

    Published 2009
    “…Flying multiple unmanned aircraft in the same airspace and instances or operating these aircraft in commercial airspace increases the likelihood of collisions. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Performance Analysis of Hexagon-Diamond Search Algorithm for Motion Estimation using MATLAB

    Performance Analysis of Hexagon-Diamond Search Algorithm for Motion Estimation using MATLAB by Abdul Manap, Redzuan, Ranjit, S.S.S.

    Published 2010
    “…In recent years, many of these BMAs have been developed with similar intention of reducing the computational costs while at the same time maintaining the video signal quality. In this paper, an algorithm called Hexagon-Diamond Search (HDS) is proposed for ME where the algorithm and several fast BMAs, namely Three Step Search (TSS), New Three Step Search (NTSS), Four Step Search (4SS) as well as Diamond Search (DS), are first selected to be implemented onto various type of standard test video sequence using MATLAB before their performances are compared and analyzed in terms of peak signal-to-noise ratio (PSNR), number of search points needed as well as their computational complexity. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Performance analysis of hexagon-diamond search algorithm for motion estimation

    Performance analysis of hexagon-diamond search algorithm for motion estimation by Abdul Manap, Redzuan, Ranjit, S.S.S., Basari, Amat Amir, Ahmad, Badrul Hisham

    Published 2010
    “…In recent years, many of these BMAs have been developed with similar intention of reducing the computational costs while at the same time maintaining the video signal quality. In this paper, an algorithm called Hexagon-Diamond Search (HDS) is proposed for ME where the algorithm and several fast BMAs, namely Three Step Search (TSS), New Three Step Search (NTSS), Four Step Search (4SS) as well as Diamond Search (DS), are first selected to be implemented onto various type of standard test video sequence using MATLAB before their performances are compared and analyzed in terms of peak signal-to-noise ratio (PSNR), number of search points needed as well as their computational complexity. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: