Search Results - (( spatial visualization based algorithm ) OR ( program implementation path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

    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
    Save to List
    Saved in:
  2. 2
    Development Of Distributed Grid-Based Hydrological Model And Floodplain Inundation Management System

    Development Of Distributed Grid-Based Hydrological Model And Floodplain Inundation Management System by Al_Fugara, A’kif Mohammed Salem

    Published 2008
    “…The system has integrated GIS, RS, DEM, data management capability and a dynamic basin model within a common Windows environment. The simulation algorithms of the rainfall-runoff model have operated on grid bases compatible with the MATLAB programming language, which has been used to write instructions to many grid-based operations. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Vision-based robot indoor navigation

    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
    Save to List
    Saved in:
  4. 4
    Implementation of Autonomous Vehicle Navigation Algorithms Using Event-Driven Programming

    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
    Save to List
    Saved in:
  5. 5
    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms

    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
    Save to List
    Saved in:
  6. 6
    Lightweight spatial attentive network for vehicular visual odometry estimation in urban environments

    Lightweight spatial attentive network for vehicular visual odometry estimation in urban environments by Gadipudi, N., Elamvazuthi, I., Lu, C.-K., Paramasivam, S., Su, S.

    Published 2022
    “…Traditional visual odometry algorithms require the careful fabrication of state-of-the-art building blocks based on geometry. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Lightweight spatial attentive network for vehicular visual odometry estimation in urban environments

    Lightweight spatial attentive network for vehicular visual odometry estimation in urban environments by Gadipudi, N., Elamvazuthi, I., Lu, C.-K., Paramasivam, S., Su, S.

    Published 2022
    “…Traditional visual odometry algorithms require the careful fabrication of state-of-the-art building blocks based on geometry. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Implementation of an autonomous mobile robot navigation algorithm using C language

    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
    Save to List
    Saved in:
  9. 9
    Implementation of autonomous vehicle navigation algorithms using event-driven programming

    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
    Save to List
    Saved in:
  10. 10
    GPS boundary navigation of DrosoBots using MATLAB simulation

    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
    Save to List
    Saved in:
  11. 11
    Compacted dither pattern codes over MPEG-7 dominant colour descriptor in video visual depiction

    Compacted dither pattern codes over MPEG-7 dominant colour descriptor in video visual depiction by Ranathunga, L., Zainuddin, R., Abdullah, N.A.

    Published 2010
    “…Visual description experiments were conducted for ten irregular shapes-based visual concepts in videos with three setups namely CDPC with Bhattacharyya classifier, DCD without spatial coherency and DCD with spatial coherency. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    An improved algorithm in test case generation from UML activity diagram using activity path

    An improved algorithm in test case generation from UML activity diagram using activity path by Hashim, Nor Laily, Salman, Yasir D.

    Published 2011
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Rain streak removal using emboss and spatial-temporal depth filtering technique in video keyframes

    Rain streak removal using emboss and spatial-temporal depth filtering technique in video keyframes by Shariah, Sawsan Kamel

    Published 2012
    “…The filter algorithm is based on an enhanced harmonic mean filter algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  16. 16
    Development of obstacle avoidance technique in web-based geographic information system for traffic management using open source software

    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
    Save to List
    Saved in:
  17. 17
    Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment

    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
    Save to List
    Saved in:
  18. 18
    Development of saliency metric for autonomous landmark selection in cognitive robot navigation / Gao Hanyang

    Development of saliency metric for autonomous landmark selection in cognitive robot navigation / Gao Hanyang by Gao , Hanyang

    Published 2022
    “…This dissertation proposes an algorithm to quantify urban landmarks based on visual salience indicators for cognitive robot navigation. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim

    Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim by Che Ibrahim, Mohd Erman Safawie

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

    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
    Save to List
    Saved in:

Search Tools: