Search Results - (( motion optimization path algorithm ) OR ( evolution optimization search algorithm ))

Refine Results
  1. 1

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

    Published 2013
    “…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Runtime reduction in optimal multi-query sampling-based motion planning by Khaksar W., Sahari K.S.B.M., Ismail F.B., Yousefi M., Ali M.A.

    Published 2023
    “…Algorithms; Dispersions; Manufacture; Query processing; Robotics; High-dimensional; Low dispersions; Optimal solutions; Path length; Planning tasks; Sampling-based; Sampling-based algorithms; Sampling-based motion planning; Motion planning…”
    Conference Paper
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13

    Crossover-first differential evolution for improved global optimization in non-uniform search landscapes by Teo, Jason Tze Wi, Mohd Hanafi Ahmad Hijazi, Hui, Keng Lau, Salmah Fattah, Aslina Baharum

    Published 2015
    “…The differential evolution (DE) algorithm is currently one of the most widely used evolutionary-based optimizers for global optimization due to its simplicity, robustness and efficiency. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Hybrid algorithm for NARX network parameters' determination using differential evolution and genetic algorithm by Salami, Momoh Jimoh Eyiomika, Tijani, Ismaila, Isqeel , Abdullateef Ayodele, Aibinu, Abiodun Musa

    Published 2013
    “…The proposed algorithm involves a two level optimization scheme to search for both optimal network architecture and weights. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Improved chemotaxis differential evolution optimization algorithm by Yıldız, Y. Emre, Altun, Oğuz, Topal, A. Osman

    Published 2015
    “…The social foraging behavior of Escherichia coli has recently received great attention and it has been employed to solve complex search optimization problems.This paper presents a modified bacterial foraging optimization BFO algorithm, ICDEOA (Improved Chemotaxis Differential Evolution Optimization Algorithm), to cope with premature convergence of reproduction operator.In ICDEOA, reproduction operator of BFOA is replaced with probabilistic reposition operator to enhance the intensification and the diversification of the search space.ICDEOA was compared with state-of-the-art DE and non-DE variants on 7 numerical functions of the 2014 Congress on Evolutionary Computation (CEC 2014). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16
  17. 17

    Application of swarm intelligence optimization on bio-process problems / Mohamad Zihin Mohd Zain by Mohamad Zihin , Mohd Zain

    Published 2018
    “…An improved version of Differential Evolution (DE) namely Backtracking Search Algorithm (BSA) is applied to several fed batch fermentation problems and its performance is compared with recent emerging metaheuristics such as Artificial Algae Algorithm (AAA), Artificial Bee Colony (ABC), Covariance Matrix Adaptation Evolution Strategy (CMAES) and DE. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Two level Differential Evolution algorithms for ARMA parameters estimatio by Salami, Momoh Jimoh Emiyoka, Tijani, Ismaila, Aibinu, Abiodun Musa

    Published 2013
    “…The first level searches for the appropriate model order while the second level computes the optimal/sub-optimal corresponding parameters. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  20. 20

    Comparison between Lamarckian Evolution and Baldwin Evolution of neural network by Taha, Imad, Inazy, Qabas

    Published 2006
    “…Genetic Algorithms are very efficient at exploring the entire search space; however, they are relatively poor at finding the precise local optimal solution in the region at which the algorithm converges. …”
    Get full text
    Get full text
    Get full text
    Article