Search Results - (( based constructive path algorithm ) OR ( evolution classification _ algorithm ))

Refine Results
  1. 1

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

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

    Published 2022
    “…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
    Get full text
    Thesis
  4. 4
  5. 5
  6. 6

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

    Published 2017
    “…A model-driven approach was used for generating abstract test cases from the feasible paths. This model driven approach was integrated with the proposed infeasible path detection method which based on analyzing various OCL constructs and operations. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…The objectives of this study are to construct the distance matrix and sequence matrix based on the network layout and to find the shortest path to collect the item in the warehouse. …”
    Get full text
    Get full text
    Student Project
  8. 8

    AUTOMATED GUIDED ROBOT (AGR) by Abd Rahim, Mohd Azlan Shah

    Published 2007
    “…Algorithm conversion to C code programming has been done throughout the project for the obstacle avoidance and path planning algorithms based upon the GA platform ofAI.…”
    Get full text
    Get full text
    Final Year Project
  9. 9
  10. 10

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Multi-Objective Hybrid Algorithm For The Classification Of Imbalanced Datasets by Saeed, Sana

    Published 2019
    “…The proposed algorithm is grounded on the two famous metaheuristic algorithms: cuckoo search (CS) and covariance matrix adaptation evolution strategy (CMA-es). …”
    Get full text
    Get full text
    Thesis
  12. 12

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…The GUT will be display the shortest path that should be taken by user and give user authority to manipulate the coordinate based on the requirement.…”
    Get full text
    Get full text
    Undergraduates Project Papers
  15. 15

    Algorithmic design issues in adaptive differential evolution schemes: Review and taxonomy by Al-Dabbagh, Rawaa Dawoud, Neri, Ferrante, Idris, Norisma, Baba, Mohd Sapiyan

    Published 2018
    “…DE is very sensitive to its parameter settings and mutation strategy; thus, this study aims to investigate these settings with the diverse versions of adaptive DE algorithms. This study has two main objectives: (1) to present an extension for the original taxonomy of evolutionary algorithms (EAs) parameter settings that has been overlooked by prior research and therefore minimize any confusion that might arise from the former taxonomy and (2) to investigate the various algorithmic design schemes that have been used in the different variants of adaptive DE and convey them in a new classification style. …”
    Get full text
    Get full text
    Article
  16. 16

    Differential evolution for neural networks learning enhancement by Ismail Wdaa, Abdul Sttar

    Published 2008
    “…Evolutionary computation is the name given to a collection of algorithms based on the evolution of a population toward a solution of a certain problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Design Of Feature Selection Methods For Hand Movement Classification Based On Electromyography Signals by Too, Jing Wei

    Published 2020
    “…In this regard, this thesis proposes five FS methods for efficient EMG signals classification. The first method is the Binary Tree Growth Algorithm (BTGA), which implements a hyperbolic tangent function to convert the Tree Growth Algorithm into the binary version. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

    Published 2010
    “…This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Effective EEG channels for emotion identification over the brain regions using differential evolution algorithm by Al-Qazzaz, Noor Kamal, Sabir, Mohannad K., Md. Ali, Sawal Hamid, Ahmad, Siti Anom, Grammer, Karl

    Published 2019
    “…The spectral features were performed by employing the relative spectral powers of delta (δRP), theta (θRP), alpha (αRP), beta (βRP), and gamma (γRP). The differential evolution-based channel selection algorithm (DEFS_Ch) was computed to find the most suitable EEG channels that have the greatest efficacy for identifying the various emotional states of the brain regions. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    Ant Colony Optimization for Tourist Route by Meeplat, Nopparat

    Published 2005
    “…The second part of this research involves formulating and applying the ACO algorithms to find the shortest path based on the distance calculated from source to destination cities. …”
    Get full text
    Get full text
    Get full text
    Thesis