Search Results - (( wave optimization path algorithm ) OR ( based interactive data 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

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…It is noted that active user intervention increases the acceleration of Genetic Algorithm towards an optimal solution. In proposed research work, the user is aided by a visualization based on the representation of multidimensional Genetic Algorithm data on 2-0 space. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    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
  13. 13
  14. 14
  15. 15

    Whale optimization algorithm strategies for higher interaction strength t-way testing by Ali Abdullah, Hassan, Salwani, Abdullah, Kamal Z., Zamli, Rozilawati, Razali

    Published 2022
    “…However, the number of interaction strengths considered must be higher in the case of interactions that generate large amounts of data. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    A random search based effective algorithm for pairwise test data generation by Sabira, Khatun, K. F., Rabbi, Che Yahaya, Yaakub, Klaib, Mohammad F. J.

    Published 2011
    “…Pairwise (2-way or t = 2) interaction can find most of the software faults. This paper proposes an effective random search based pairwise test data generation algorithm named R2Way to optimize the number of test cases. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    A Modified ACO-based Search Algorithm for Detecting Protein Functional Module From Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Roslina, Abd Hamid

    Published 2015
    “…Recent high-throughput experiments have generated protein-protein interaction data on a genomic scale, yielding the complete protein-protein interaction network for several organisms. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

    Published 2010
    “…As response to the above-mentioned challenges, this study is devoted towards developing an interactive mining method based on prime number and its special characteristic “uniqueness” by which the content of the relevant data is transformed into a compact layout. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm by Mohammed Abdullah, Abdullah Nasser

    Published 2018
    “…If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. …”
    Get full text
    Get full text
    Thesis
  20. 20

    T-way testing : a test case generator based on melody search algorithm by Toh, Shu Yuen

    Published 2015
    “…First, Inputs will be written into a text file and TTT-MS will read the inputs which are the number of Parameters, number of values for each Parameter, Parameter Names, Parameter Values Name and the Interaction Strength (t) up to t=4. Next, TTT-MS will be executed through main algorithms to generate Parameters Interaction List, Parameter Values Interaction List, and finally generate final Test Cases based on Melody Search Algorithm. …”
    Get full text
    Get full text
    Undergraduates Project Papers