Search Results - (( its applications _ algorithm ) OR ( its application ((cell algorithm) OR (path algorithm)) ))*

Refine Results
  1. 1

    A Collision Detection Algorithm For Virtual Robot-Centered Flexible Manufacturing Cell by Arshad, Haslina

    Published 2008
    “…This thesis presents a collision detection algorithm for accurate simulation of a virtual flexible manufacturing cell. …”
    Get full text
    Get full text
    Thesis
  2. 2

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…Thus, the A* algorithm is implemented in a small mobile robot, this is to see its effectiveness in real world application. …”
    Get full text
    Get full text
    Final Year Project
  3. 3

    The evolution and trend of chain code scheme by Wulandhari, Lily Ayu, Haron, Habibollah

    Published 2008
    “…This paper explains some chain code concepts and their applications that are be the background of the development of vertex chain code cells algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5
  6. 6

    Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios by Yusuf, Zakariah, Mohamad, Sufian, Wan Ibrahim, Wan Suhaifiza

    Published 2025
    “…On the other hand, Dijkstra's algorithm, though robust and optimal, exhibited longer runtimes and produced paths with more turns due to its exhaustive search approach. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Backhaul load and performance optimality of partial joint processing schemes in LTE-A networks by Kousha, Mohammad

    Published 2014
    “…The utility of PJP schemes for three different traffic types shows that DPS is preferred over JT for elastic and adaptive applications. The significance of the proposed algorithm is also proven in comparison with previous approach by maintaining the same performance while reducing the backhaul load up to 30%. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Recent Advances and Applications of Spiral Dynamics Optimization Algorithm: A Review by Omar, M.B., Bingi, K., Rajanarayan Prusty, B., Ibrahim, R.

    Published 2022
    “…The growth of the SDO algorithm and its application in various areas, theoretical analysis, and comparison with its preceding and other algorithms are also described in detail. …”
    Get full text
    Get full text
    Article
  9. 9

    Recent Advances and Applications of Spiral Dynamics Optimization Algorithm: A Review by Omar, M.B., Bingi, K., Rajanarayan Prusty, B., Ibrahim, R.

    Published 2022
    “…The growth of the SDO algorithm and its application in various areas, theoretical analysis, and comparison with its preceding and other algorithms are also described in detail. …”
    Get full text
    Get full text
    Article
  10. 10

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…This is because each path planning algorithm has its own applicable domain, performance, advantages and disadvantages in various situations. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  11. 11

    Modeling dynamic weight for 3D navigation routing by Musliman, Ivin Amri, Abdul Rahman, Alias, Coors, Volker

    Published 2007
    “…Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in time-critical applications such as emergency response applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…This thesis also provides an explanation about the advantages. functions, characteristics. the degree of complexity in A • algorithm and its implementation in real-world application. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14
  15. 15
  16. 16

    Link utilization of GA-based QoS routing algorithm by Yussof S., See O.H.

    Published 2023
    “…In the previous work, a GA-based QoS routing algorithm has been proposed and the performance of the algorithm with respect to its ability to a find a feasible path has been evaluated. …”
    Conference paper
  17. 17

    Three-dimensional coverage control for multi-unmanned aerial vehicle by Siow, Wen Hao

    Published 2024
    “…Objectives of this project are achieved by reviewing existing coverage control methods, developing, and evaluating the proposed 3D coverage control algorithm, demonstrating its effectiveness, and potential applicability in real-life scenarios.…”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  18. 18

    All-pass filtered x least mean square algorithm for narrowband active noise control by Mondal (Das), Kuheli, Das, Saurav, Abu, Aminudin, Hamada, Nozomu, Toh, Hoong Thiam, Das, Saikat, Faris, Waleed Fekry

    Published 2018
    “…The results also show that the proposed method outperforms other LMS algorithm without secondary path modelling. The proposed narrowband LMS algorithm would benefit in the design of efficient feedforward ANC system that can realize noise control in air intake duct applications.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. Using ACO, a Railway Shortest Path Planner (RSPP) application will be developed to help user determine their shortest path from one station to another. …”
    Get full text
    Get full text
    Thesis