Search Results - (( using function ((method algorithm) OR (path algorithm)) ) OR ( a simulation methods algorithm ))

Refine Results
  1. 1

    Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm by Krishnan P.S., Paw J.K.S., Kiong T.S.

    Published 2023
    “…This paper describes the evolutionary planning strategies for mobile robot to move along the streamlined collision-free paths in a known static environment. The Cognitive Map method is combined with genetic algorithm to derive the mobile robot optimal moving path towards its goal functions. …”
    Conference Paper
  2. 2

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

    Published 2022
    “…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
    Get full text
    Thesis
  3. 3

    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 Aalgorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

    Published 2016
    “…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  7. 7

    Nonlinear FXLMS algorithm for active noise control systems with saturation nonlinearity by Sahib, Mouayad A., Raja Ahmad, Raja Mohd Kamil, Marhaban, Mohammad Hamiruce

    Published 2012
    “…However, NLFXLMS cannot be implemented in real time because the modeling of the SEF cannot be realized. In this paper, a new method to model the secondary path using the Hammerstein model structure and tangential hyperbolic function (THF) is proposed. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Indoor path planning using harmonic functions via half-sweep arithmetic mean method by Azali Saudi, Jumat Sulaiman

    Published 2019
    “…Several path planning simulations in a known indoor environment were conducted to examine the effectiveness of the proposed method. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Real time nonlinear filtered-x lms algorithm for active noise control by Sahib, Mouayad Abdulredha

    Published 2012
    “…The developed THF-NLFXLMS algorithm is tested by means of simulation and implemented experimentally using FPGA-based real time controller for a nonlinear ANC application. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Development of low power viterbi decoder on complex programmable logic device platform by Abu, Mohd Azlan

    Published 2018
    “…For the path metric updater unit (PMU), the traditional method of Viterbi algorithm is to store the selected minimum value of branch metric in the memory unit. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

    Published 2025
    “…The results reveal that our proposed method reduces the mobile robot's travel time by up to 69%, 67%, 72%, and 79% compared to these algorithms, while consistently achieving optimal path lengths. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

    Published 2016
    “…Results: The analysis of computational results showed that the modified RTS algorithm provided a better solution quality in terms of minimizing the objective function of TSPs, while the SA algorithm was useful for obtaining instant solutions for TSPs with a large number of cities. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…The whole constraint analyzer and the fitness function were combined with four SBTs (genetic algorithm, evolutionary algorithm, simulating annealing, and quantum genetic algorithm). …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

    Published 2024
    “…A MPSO algorithm, without path smoothening, is used for comparison. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  15. 15
  16. 16

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

    Development of obstable avoidance system for 3D robot navigation by Er, Kai Sheng

    Published 2024
    “…Additionally, the planner and controller modules from Nav2 were employed for path planning and obstacle avoidance. Once the algorithm was fully tested and proven functional in simulation, it would be implemented on the physical robot. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  18. 18

    Path finding of indoor mobile robot using harmonic potentials via explicit decoupled group modified accelerated over relaxation method by A'qilah Ahmad Dahalan, Ruzanna Mat Jusoh, Azali Saudi, Jumat Sulaiman

    Published 2020
    “…The outcomes show the advantages of the proposed algorithm. In the end, the research indicates that the proposed method in computing harmonic functions is appealing and attainable for solving path planning problems.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Comparison Of Crossover In Genetic Algorithm For Discrete-Time System Identification by Zainuddin, Farah Ayiesya, Abd Samad, Md Fahmi

    Published 2021
    “…Genetic algorithm (GA), a method known for optimisation is used for selecting a model structure. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Enhancing Autonomous Guided Vehicles with Red-Black TOR Iterative Method by A’Qilah Ahmad Dahalan, Azali Saudi, Jumat Sulaiman

    Published 2023
    “…The experiment also shows that, by applying a finite difference method, the mobile robot is capable of producing a collision-free path from any start to a given target point. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article