Search Results - (( using simulation path algorithm ) OR ( data optimization modified algorithm ))

Refine Results
  1. 1

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…Although useful, the existing algorithms does not provide any comparative data to select an algorithm based on the problem size and difficulty and the use of other neighborhood algorithms (including Great Deluge and Late Acceptance Hill Climbing) has not been sufficiently explored as well. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

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

    Implementation of laser simulator in robot path determination by Zenas, Chung Han Yuan

    Published 2016
    “…In addition, one of the classical path planning approach which is A* algorithm will be used to compare the result generated by laser simulator. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  6. 6

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

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Generally, the proposed modified k-means algorithm is able to determine the optimum number of clusters for huge data.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Global Mobile Robot Path Planning using Laser Simulator by Ali, Mohammed A. H., Wan Azhar, Wan Yusoff, Zamzuri, Hamedon, Zulkifli, Md. Yusof, Musa, Mailah

    Published 2017
    “…From the results, the laser simulator has advantages in computational time and low collision possibility in comparison with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

    Published 2008
    “…The development of the path planning algorithm is initially presented by the geometrical analysis and it is then analyzed by simulation using Matlab. …”
    Get full text
    Learning Object
  10. 10

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

    Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

    Published 2015
    “…A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

    Published 2017
    “…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
    Get full text
    Get full text
    Final Year Project
  13. 13

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

    Published 2016
    “…All simulations were performed using MATLAB with visualization of UAV path planning. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Path planning for constant speed robot by Abdullah @ Idris, Ahmad Takiyuddin

    Published 2006
    “…The development of the path planning algorithm is initially presented by the geometrical analysis and it is then analyzed by simulation using Matlab. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16
  17. 17

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

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

    Published 2023
    “…However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. …”
    Article
  20. 20

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

    Published 2011
    “…MATLAB simulation is developed to verify and validate the algorithm before they are real time implemented on Team AmigoBotTM robot. …”
    Get full text
    Get full text
    Conference or Workshop Item