Search Results - (( variable operation using algorithm ) OR ( wave optimization path algorithm ))

Refine Results
  1. 1

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

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
  2. 2

    A generalized laser simulator algorithm for mobile robot path planning with obstacle avoidance by Muhammad, Aisha, Ali, Mohammed A.H., Turaev, Sherzod, Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Shanono, Ibrahim Haruna, Alzaid, Zaid, Alruban, Abdulrahman, Alabdan, Rana, Dutta, Ashit Kumar, Almotairi, Sultan

    Published 2022
    “…An optimal path between the start and target point is found by forming a wave of points in all directions towards the target position considering target minimum and border maximum distance principles. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

    Published 2021
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Novel algorithm for mobile robot path planning in constrained environment by Aisha, Muhammad, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi Faiz, ., Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Nashrul, Mohd Zubir, Muhammad Khairi, Faiz, Erma Rahayu, Mohd Faizal, Abdulghafor, Rawad

    Published 2022
    “…The results demonstrated that the proposed method is able to generate efficiently an optimal collision-free path. Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

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

    Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

    Published 2022
    “…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Efficient and scalable ant colony optimization based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2020
    “…For this reason, many intelligent systems have been utilized to design routing algorithms to handle the network's dynamic state. In this paper, an ant colony optimization (ACO) based WSN routing algorithm for IoT has been proposed and analyzed to enhance scalability, to accommodate node mobility and to minimize initialization delay for time critical applications in the context of IoT to find the optimal path of data transmission, improvising efficient IoT communications. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10
  11. 11

    Variable Global Optimization min-sum (VGOMS) algorithm of decode-and forward-protocol for the relay node in the cooperative channel by Hushairi, Zen, Al-Khalid, Hj Othman, Khairuddin, Abdul Hamid, Jamaah, Suut

    Published 2020
    “…The proposed VGOMS algorithm apply the optimization scaling factor at the bit node processing of the variable node operation which have significantly less complexity as compared with the check node operation or both variable node and check node operation. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Variable Global Optimization min-sum (VGOMS) algorithm of decodeand-forward protocol for the relay node in the cooperative channel by Hushairi, Zen, Jamaah, Suut, Al-Khalid, Bin Hj Othman, Khairuddin, Bin Ab Hamid

    Published 2019
    “…The proposed VGOMS algorithm apply the optimization scaling factor at the bit node processing of the variable node operation which have significantly less complexity as compared with the check node operation or both variable node and check node operation. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Efficient relay placement algorithm using landscape aware routing (erpalar) by Onabajo, Olawale Olusegun

    Published 2011
    “…ERP ALAR was implemented in Matlab R2009a using Genetic Algorithm (GA) with multi-objectives. GA is an optimization algorithm that simulates natural selection process as found in nature. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Fault diagnostic algorithm for precut fractionation column by Heng, H. Y., Ali, Mohamad Wijayanuddin, Kamsah, Mohd. Zaki

    Published 2004
    “…This paper presents an algorithm which can be used to detect and diagnose unexpected process faults in the operation of fatty acid precut fractionation column. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Forecasting hydrological parameters for reservoir system utilizing artificial intelligent models and exploring their influence on operation performance by Allawi, Mohammed Falah, Jaafar, Othman, Mohamad Hamzah, Firdaus, Koting, Suhana, Mohd, Nuruol Syuhadaa, El-Shafie, Ahmed

    Published 2019
    “…The three different optimization algorithms used in this study are the genetic algorithm (GA), particle swarm optimization (PSO) algorithm and shark machine learning algorithm (SMLA). …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18
  19. 19

    Enhanced scalar multiplication algorithm over prime field using elliptic net by Muslim, Norliana, Yunos, Faridah, Razali, Zuren, Norddin, Nur Idalisa

    Published 2024
    “…At the field operational level, in comparison to the binary method, the eight-block elliptic net method, and the elliptic net method with ten temporary variables for the 384 bits scenario, the developed scalar multiplication algorithm obtained cost reductions of 57.6%, 31.3%, and 13.2%, respectively. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Study on numerical solution of a variable order fractional differential equation based on symmetric algorithm by Liu, Jingrui, Pan, Dongyang

    Published 2019
    “…A fully symmetric classification of the boundary value problem for a class of fractional differential equations with variable sequences is determined by using a fully symmetric differential sequence sorting algorithm. …”
    Get full text
    Get full text
    Get full text
    Article