Search Results - (( program implementation path algorithm ) OR ( basic optimization based algorithm ))

Refine Results
  1. 1

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

    Vision-based robot indoor navigation by Teo, Zhin Hang

    Published 2022
    “…A navigation robot is built to test the workability and efficiency of the algorithms. In general, the algorithm can provide the nearest path to navigate around the environment without manual assistance. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

    Implementation of Autonomous Vehicle Navigation Algorithms Using Event-Driven Programming by Saman, Abu Bakar Sayuti, Sebastian , Patrick, Malek, Nadhira, Hasidin, Nurul Zahidah

    Published 2012
    “…By using FSM to describe the behaviour of a navigating mobile robot, an equivalent algorithm can be developed. The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

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

    Implementation of an autonomous mobile robot navigation algorithm using C language by Subra Mullisi, Shafeq Marwan

    Published 2009
    “…The problem can basically be divided into positioning and path planning. This report basically discusses the study and also work that has been done from previous of the chosen topic, which is Implementation of an Autonomous Mobile Robot Navigation Algorithm using 'C' language. …”
    Get full text
    Get full text
    Final Year Project
  6. 6

    Implementation of autonomous vehicle navigation algorithms using event-driven programming by Saman, Abu Bakar Sayuti, Sebastian , Patrick, Malek, Nadhira, Hasidin, Nurul Zahidah

    Published 2012
    “…By using FSM to describe the behaviour of a navigating mobile robot, an equivalent algorithm can be developed. The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    GPS boundary navigation of DrosoBots using MATLAB simulation by Zainal Abidin, Zulkifli, Ngah , Vmi Kalthum, Arshad, Mohd Rizal, Kok , Chee Hou

    Published 2010
    “…To implement this, region recognition and several path planning algorithms have been utilized. …”
    Get full text
    Get full text
    Proceeding Paper
  8. 8
  9. 9

    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

    Published 2017
    “…In the proposed novel QOJaya algorithm, an intelligence strategy, namely, quasi-oppositional based learning (QOBL) is incorporated into the basic Jaya algorithm to enhance its convergence speed and solution optimality. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems by Din, Fakhrud, Khalid, Shah, Fayaz, Muhammad, Gwak, Jeonghwan, Kamal Z., Zamli, Mashwani, Wali Khan

    Published 2022
    “…The performance of the fuzzy adaptive teaching learning-based optimization is evaluated against other metaheuristic algorithms including basic teaching learning-based optimization on 23 unconstrained global test functions. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

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

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Development of obstacle avoidance technique in web-based geographic information system for traffic management using open source software by Nik Yusoff, Nik Mohd Ramli, Mohd Shafri, Helmi Zulhaidi, Muniandy, Ratnasamy, Mohammad Wali, Islam

    Published 2014
    “…Pg Routing as an extension of Postgre SQL/Post GIS database is an open source library that implements the Dijkstra shortest path algorithm. However, the functionality to avoid obstacles in that analysis is still limited. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment by Wong, Peng Kiong

    Published 2004
    “…This program consists of four algorithms which are conversion formulas, smooth terrain, single convex surface terrain and double convex surfaces terrain.…”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16
  17. 17

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

    Published 2017
    “…While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Solving a Reconfigurable Maze using Hybrid Wall Follower Algorithm by Saman, Abu Bakar Sayuti, Abdramane, Issa

    Published 2013
    “…A wall follower algorithm with combined left-hand and right-hand rules is implemented upon several different maze configurations. …”
    Get full text
    Get full text
    Citation Index Journal
  19. 19

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
  20. 20