Search Results - (( based optimization path algorithm ) OR ( program evaluation using algorithm ))

Refine Results
  1. 1

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…Also, this research involves in developing a machine-learning system and program via genetic algorithm that is capable of performing independent learning capability and optimization for scanning sequence using novel GA operators. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman by Isman, Muhammad Iskandar

    Published 2017
    “…ACO algorithm is the best solution because it included the optimization technique to optimized the result based on the data criteria needs. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Dam haji game using A* search algorithm / Siti Farah Najwa Mukhlis by Mukhlis, Siti Farah Najwa

    Published 2017
    “…The results of this project is a Dam Haji game using A* algorithm which it is able to make legal movements based on the game’s rules and a matchup with a computer-based player that have gone through a process of computer learning to make movement based on the A* shortest path technique. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
  6. 6

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Article
  7. 7
  8. 8

    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
    “…To support the decision-maker to evaluate different decision strategies, we use compromise programming to transform multiobjective optimization (MOP) into a single-objective problem. …”
    Get full text
    Get full text
    Article
  9. 9

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

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

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

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

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…The environment design for mobile robots' path planning based on industry environment shows excellent combinations with the GA method that generate the optimal path for the mobile robot with a semi-dynamic obstacle.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Mobile robot path planning using hybrid genetic algorithm and traversability vectors method by Loo, C.K., Rajeswari, M., Wong, E.K., RaoTask, M.V.C.

    Published 2004
    “…Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

    Published 2021
    “…To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
    Get full text
    Get full text
    Thesis