Search Results - between ((space algorithm) OR (path algorithm))

Refine Results
  1. 1

    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin by Sariff, Nohaidda, Buniyamin, Norlida

    Published 2010
    “…These nodes generally represent the free space extracted from the robot map. Performances between both algorithms were compared and evaluated in terms of speed and number of iterations that each algorithm takes to find an optimal path within several selected environments. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries by Fadzli, S.A., Abdulkadir, S.I., Makhtar, M., Jamal, A.A.

    Published 2016
    “…Dijkstra's algorithm is a classic algorithm for finding the shortest path between two points due to its optimisation capability. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…Classical algorithms have been used to search over some space for finding the shortest paths problem between two points in a network and a minimal weight spanning tree for routing. …”
    Get full text
    Article
  4. 4

    Energy efficient path-planning for unmanned aerial vehicle by Debnath, Sanjoy Kumar

    Published 2022
    “…The proposed path planning algorithm is called Iterative Elliptical- Convex Visibility Graph (IECoVG) which is based on visibility graph (VG) and Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
    Get full text
    Get full text
    Article
  6. 6

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

    Published 2016
    “…From this research, the laser simulator has advantages in computational time and low collision possibility compare 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
    Undergraduates Project Papers
  7. 7

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
    Get full text
    Get full text
    Student Project
  8. 8

    Time series data intelligent clustering algorithm for landslide displacement prediction by Han, Liu, Shang, Tao, Shu, Jisen, Khan Chowdhury, Ahmed Jalal

    Published 2018
    “…The local optimal solution is obtained by recursive search, and the whole curve path is obtained. Clustering calculation of time series data set is carried out by using hierarchical clustering algorithm according to bending path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Development of the propagation paths and deriving observer of feedforward active noise control system by using state-space formulation by Muhssin, Mazin T., Raja Ahmad, Raja Mohd Kamil, Marhaban, Mohammad Hamiruce, Bafti, Payam Shafiei

    Published 2010
    “…This observer will be used to estimate the states along the propagation path which can not be estimated using LMS algorithm because LMS based on the FIR models. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Development of a State-Space Observer for Active Noise Control Systems by Muhssin, Mazin T.

    Published 2009
    “…The secondary path of the ANC system is modeled by using the LMS algorithm to complete the design of the Filtered-X Least Mean Square (FXLMS) controller. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…The new proposed hybrid GA is able to produce 10 better or comparable solutions when compared to similar GA algorithms that employ two-parent crossover. In general this algorithm produces less than 6% deviation when compared to the best known solutions, especially in larger problems consisting of 20 jobs and 15 machines.…”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    A Novel Path Prediction Strategy for Tracking Intelligent Travelers by Motlagh, Omid Reza Esmaeili

    Published 2009
    “…The reactive motion of robots and path planning strategies of the blinds are similar in that both of them locally acquire knowledge and explore the space based on route-like spatial cognition. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Robot path planning using family of SOR iterative methods with laplacian behaviour-based control by Azali Saudi

    Published 2015
    “…Due to its robustness, the LBBC successfully generated smooth path even in a more complex configuration space. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Articulated robots motion planning using foraging ant strategy by Mohamad, Mohd. Murtadha

    Published 2008
    “…This paper proposes a novel search technique, the F-Ant algorithm, in order to find a reliable path between the initial configuration and the goal configuration of the articulated robot. …”
    Get full text
    Get full text
    Article
  15. 15

    Development of an automatics parallel parking system for nonholonomic mobile robot by Mohd Fairuz , Abdollah, Syed Najib , Syed Salim, Irma Wani , Jamaludin, Muhammad Nizam , Kamarudin

    Published 2011
    “…The configuration of the system consists of ultrasonic sensor, rotary encoder, controller, and actuators. The path planning algorithm is developed based on the data acquired from the sensor. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16
  17. 17

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

    Performance comparison of MVDR and LCMV beamforming algorithm in 2.3 GHz adaptive antenna system by Salem B., Tiong S.K., Koh S.P., Hock G.C.

    Published 2023
    “…This paper presents two methods of beamforming algorithm; Minimum Variance Distortionless Response (MVDR) and Linear Constraint Minimum Variance (LCMV). …”
    Article
  19. 19

    Development of a motion planning and obstacle avoidance algorithm using adaptive neuro fuzzy inference system for mobile robot navigation by Muslim, Farah Kamil Abid

    Published 2017
    “…These come from high dimensions of the exploration of space, geometrical and kinematic features of the obstacles. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20