Search Results - (( based optimization path algorithm ) OR ( project 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

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
    Get full text
    Get full text
    Thesis
  3. 3

    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. …”
    Get full text
    Get full text
    Thesis
  4. 4

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…For the result, shortest path for the order pickers in iterations. The algorithm used can help the order picker to have the shortest path, but it have no direct path. …”
    Get full text
    Get full text
    Student Project
  5. 5

    Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

    Published 1997
    “…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
    Get full text
    Get full text
    Thesis
  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
    “…This project is to design and analysis the sequence generator module using Eulerian Path algorithm for DNA fragment assembly. …”
    Get full text
    Get full text
    Student Project
  7. 7

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
  8. 8

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Article
  9. 9

    Dam haji game using A* search algorithm / Siti Farah Najwa Mukhlis by Mukhlis, Siti Farah Najwa

    Published 2017
    “…The results of this project is a Dam Haji game using A* algorithm which it is able to make legal movements based on the game’s rules and a matchup with a computer-based player that have gone through a process of computer learning to make movement based on the A* shortest path technique. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
  12. 12

    A Development Of An Internet Of Things Equipped Unmanned Ground Vehicle For Surveilance Purpose by Azizan, Anis Natasha

    Published 2019
    “…Therefore, controller is used for navigation before and after approaching obstacles. Path planning algorithm in this project provides the best path to avoid the obstacle and create temporary new waypoints within split seconds. …”
    Get full text
    Get full text
    Monograph
  13. 13

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The objective is to verify and compare the effectiveness of both algorithms in finding the optimal robot path in different types of global map environments. …”
    Get full text
    Get full text
    Thesis
  16. 16

    MULTIPLE DRONES PATH OPTIMIZATION ALGORITHM FOR 3D SPACE PERFORMANCE USING CENTRALIZED VISUALIZATION PLATFORM by Teng, Chu Yao

    Published 2019
    “…The existing methods aim for planning optimal path of drone flight. In this report, a variant of A*, Theta* algorithm is proposed to find the optimal path within a grid-based environment. …”
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  17. 17
  18. 18

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

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…The environment design for mobile robots' path planning based on industry environment shows excellent combinations with the GA method that generate the optimal path for the mobile robot with a semi-dynamic obstacle.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis