Search Results - (( developing function method algorithm ) OR ( based 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. …”
    Get full text
    Thesis
  2. 2

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

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

    Published 2023
    “…This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  4. 4

    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 second contribution of this thesis is developing an accurate search-based test data generator for generating automatically optimal test data to satisfy the whole constraints in the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Improvement and application of particle swarm optimization algorithm by Deevi, Durga Praveen, Kodadi, Sharadha, Allur, Naga Sushma, Dondapati, Koteswararao, Chetlapalli, Himabindu, Perumal, Thinagaran

    Published 2025
    “…This method combines CPTD with the Genetic Algorithm and PSO (GAPSO), resulting in an effective strategy for dynamic formation reconfiguration and path optimization. …”
    Get full text
    Get full text
    Article
  6. 6

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

    Published 2024
    “…Particle swarm optimization (PSO) outperforms conventional methods like artificial potential fields (APF), the Dijkstra algorithm, and the A* algorithm in path planning for mobile robots. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  7. 7
  8. 8

    Metaheuristic optimization techniques for localization in outdoor wireless sensor networks: a comprehensive review by Gumaida, Bassam, Ibrahim, Adamu Abubakar

    Published 2025
    “…The primary objective of this paper isto review localization algorithms based on metaheuristic optimization techniques to improve localization accuracy. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…In order to achieve this objective, each net need to be routed as shortest as possible. Therefore, developing a shortest path based routing algorithm is in need. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…In order to achieve this objective, each net need to be routed as shortest as possible. Therefore, developing a shortest path based routing algorithm is in need. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Adaptive model predictive control based on wavelet network and online sequential extreme learning machine for nonlinear systems by Salih, Dhiadeen Mohammed

    Published 2015
    “…The WNMPC is developed by a proposed algorithm named adaptive updating rule (AUR) used with gradient descent optimization method to minimize a constrained cost function over the prediction and control horizons and to offer a robust control performances. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Controller placement problem in the optimization of 5G based SDN and NFV architecture by Ibrahim, Abeer Abdalla Zakaria

    Published 2021
    “…A heuristic called dynamic mapping and multi-stage CPP algorithm (DMMCPP) was developed to solve CPP as resource allocation in a distributed 5G-SDN-NFV-based network. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…It is based on Ant Colony Optimization (ACO) meta heuristic, which is adopted to enhance the paths with the best-quality function. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…In order to achieve this objective, each net need to be routed as shortest as possible. Therefore, developing a shortest path based routing algorithm is in need. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    A Compromise Programming to Task Assignment Problem in Software Development Project by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N., Binh, H.D., Aftab, M.U.

    Published 2021
    “…This study aims to propose an approach based on multi-objective combinatorial optimization to do this automatically. …”
    Get full text
    Get full text
    Article
  16. 16

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

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

    Enhanced recognition methods for text and slider CAPTCHA vulnerability assessment by Xing, Wan

    Published 2025
    “…For slider CAPTCHA detection, mean Relative Offset (mRO) has been proposed as a specific metric for slider CAPTCHA recognition, and Offset-based Intersection over Union (OIoU) loss is developed to improve the loss function, effectively reducing the mRO to below 1% on the Geetest dataset. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The objective is to verify and compare the effectiveness of both algorithms in finding the optimal robot path in different types of global map environments. …”
    Get full text
    Get full text
    Thesis
  20. 20

    MULTIPLE DRONES PATH OPTIMIZATION ALGORITHM FOR 3D SPACE PERFORMANCE USING CENTRALIZED VISUALIZATION PLATFORM by Teng, Chu Yao

    Published 2019
    “…The existing methods aim for planning optimal path of drone flight. In this report, a variant of A*, Theta* algorithm is proposed to find the optimal path within a grid-based environment. …”
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD