Search Results - (( simulation optimization path algorithm ) OR ( system implementation based algorithm ))

Refine Results
  1. 1

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…A research is proposed based on Ant Colony Optimization for solving the shortest path problem in library.This is a research that the algorithm is aim to implement on a robot. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  2. 2

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This algorithm has been tested and implemented successfully via a dual beam optical scanning system.…”
    Get full text
    Get full text
    Thesis
  3. 3

    Autonomous mobile robots path planning with integrative edge cloud-based ant colony optimization by Nor Azmi, Siti Nur Lyana Karmila, Anwar Apandi, Nur Ilyana, Rafique, Majid, Muhammad, Nor Aishah

    Published 2025
    “…In recent years, Automated Mobile Robots (AMRs) have gained significant attention in industry and research applications, requiring efficient path-planning algorithms to optimize task performance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…The proposed embedded system has achieved positive outcomes in comparison to the current system and the traditional algorithm with regards to the shortest path. …”
    Get full text
    Get full text
    Thesis
  5. 5

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…The main objectives of this project is to design the DNA sequence generator module using the Eulerian Path algorithm. This project is designed based on speed optimization. …”
    Get full text
    Get full text
    Student Project
  7. 7

    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar, Weria, Tang, Sai Hong, Mohamed Sahari, Khairul Salleh, Khaksar, Mansoor, Toressen, Jim

    Published 2019
    “…In this paper, a novel sampling-based algorithm is proposed which is able to plan in an unknown environment and provides solutions with lower cost in terms of path length, runtime and stability of the results. …”
    Get full text
    Get full text
    Article
  8. 8

    A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree by Yincong Ma, Kit Guan Lim, Min Keng Tan, Helen Sin Ee Chuo, Lorita Angeline, Kenneth Tze Kin Teo

    Published 2022
    “…The rough path is optimized by applying the cubic spline interpolation method to solve the problem that the path cannot be applied to the actual vehicle driving task. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  9. 9

    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Lastly, a single-agent variant of SKF and a multi-objective SKF were introduced. SKF algorithms and its variants have been implemented in at least nine areas of applications: drill path optimization, airport gate allocation problem (AGAP), assembly sequence planning (ASP), system identification, feature selection, image template matching, controller tuning, wireless sensor network, and engineering design problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10
  11. 11

    Detection of black hole nodes in mobile ad hoc network using hybrid trustworthiness and energy consumption techniques by Mustafa, Ahmed Sudad

    Published 2017
    “…An empirical testing approach was utilized here where several scenarios have been implemented and investigated in order to find the optimal settings. Network simulator (NS2) simulation findings demonstrate that the trust based algorithm achieves an average packet delivery ratio (PDR) of 87.3%, end to end delay (EED) of 7.47 ms and black hole detection accuracy of 90%. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Enhanced Mobility Solution In Mobile Ipv6 Network by David, Adeniji Oluwashola

    Published 2008
    “…The interface selection algorithm was based on NEMO implementation structure using a technique of mutihoming which was extended to MIPv6 concepts The outcome of this research work are: a designed policy protocol for policy messages communication between the Mobile Router and the Home Agent, the framework is simulated using Network Simulator (NS2) with an extension of mobiwan, the result shows the end to end delay, average end to end delay, overhead, optimal routing path, average inter-packet latency and throughput of the developed system. …”
    Get full text
    Get full text
    Thesis
  14. 14

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

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

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
  16. 16

    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

    Published 2017
    “…The method proposed is to design DNA assembly algorithms in Verilog HDL and implemented it in ASIC design flow. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

    Published 2016
    “…Therefore, the IE algorithm exhibits significant potential for UAV path planning optimization…”
    Get full text
    Get full text
    Thesis
  18. 18

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

    Published 2025
    “…Each algorithm was tested to compute the shortest path, with results indicating that while all algorithms arrive at the same optimal route, their efficiency differs. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    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