Search Results - (( loading optimisation based algorithm ) OR ( using simulation path algorithm ))

Refine Results
  1. 1

    Optimising cloud computing performance with an enhanced dynamic load balancing algorithm for superior task allocation by Zhanuzak, Raiymbek, Ala'anzy, Mohammed Alaa, Othman, Mohamed, Algarni, Abdulmohsen

    Published 2024
    “…This paper presents an Enhanced Dynamic Load Balancing (EDLB) algorithm designed to optimise task scheduling and resource allocation in cloud environments. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

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

    Published 2020
    “…Thus, a comparison of path planning algorithm in simulated robot will be conducted in this study. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  3. 3

    Implementation of laser simulator in robot path determination by Zenas, Chung Han Yuan

    Published 2016
    “…In addition, one of the classical path planning approach which is A* algorithm will be used to compare the result generated by laser simulator. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  4. 4

    Performance evaluation of load balancing algorithm for virtual machine in data centre in cloud computing by Parmesivan, Yuganes, Hasan, Sazlinah, Muhammed, Abdullah

    Published 2018
    “…Cloud computing has become biggest buzz in the computer era these days.It runs entire operating systems on the cloud and doeverything on cloud to store data off-site.Cloud computing is primarily based on grid computing, but it’s a new computational model.Cloud computing has emerged into a new opportunity to further enhance way of hosting data centre and provide services.The primary substance of cloud computing is to deal the computing power,storage,different sort of stages and services which assigned tothe external users on demand through the internet.Task scheduling in cloud computing is vital role optimisation and effective dynamic resource allocation for load balancing.In cloud, the issue focused is under utilisation and over utilisation of the resources to distribute workload of multiple network links for example,when cloud clients try to access and send request tothe same cloud server while the other cloud server remain idle at that moment, leads to the unbalanced of workload on cloud data centers.Thus, load balancing is to assign tasks to the individual cloud data centers of the shared system so that no single cloud data centers is overloaded or under loaded.A Hybrid approach of Honey Bee (HB) and Particle Swarm Optimisation (PSO) load balancing algorithm is combined in order to get effective response time.The proposed hybrid algorithm has been experimented by using CloudSim simulator.The result shows that the hybrid load balancing algorithm improves the cloud system performance by reducing the response time compared to the Honey Bee (HB) and Particle Swarm Optimisation (PSO) load balancing algorithm.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Modelling of optimal placement and sizing of battery energy storage system using hybrid whale optimization algorithm and artificial immune system for total system losses reduct... by Wong Ling Ai

    Published 2023
    “…Lastly, the effectiveness of WOA and WOA-AIS in attaining optimal solutions was validated with other well-known optimisation algorithms, including particle swarm optimisation (PSO) and firefly algorithm (FA). …”
    text::Thesis
  6. 6

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

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Global Mobile Robot Path Planning using Laser Simulator by Ali, Mohammed A. H., Wan Azhar, Wan Yusoff, Zamzuri, Hamedon, Zulkifli, Md. Yusof, Musa, Mailah

    Published 2017
    “…From the results, the laser simulator has advantages in computational time and low collision possibility in comparison with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Firefly analytical hierarchy algorithm for optimal allocation and sizing of distributed generation in radial distribution network by Bujal, Noor Ropidah

    Published 2022
    “…Finally, an AHP was integrated with FA to form Firefly Analytical Hierarchy Algorithm (FAHA) to automatically calculate the weight of each objective function based on the load flow outputs followed by the optimisation process. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

    Published 2008
    “…The development of the path planning algorithm is initially presented by the geometrical analysis and it is then analyzed by simulation using Matlab. …”
    Get full text
    Learning Object
  10. 10

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

    Published 2022
    “…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
    Get full text
    Thesis
  11. 11

    Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

    Published 2015
    “…A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

    Published 2017
    “…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
    Get full text
    Get full text
    Final Year Project
  13. 13

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

    Published 2016
    “…All simulations were performed using MATLAB with visualization of UAV path planning. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Path planning for constant speed robot by Abdullah @ Idris, Ahmad Takiyuddin

    Published 2006
    “…The development of the path planning algorithm is initially presented by the geometrical analysis and it is then analyzed by simulation using Matlab. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16
  17. 17

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

    Published 2023
    “…However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. …”
    Article
  20. 20

    Dynamic path planning algorithm in mobile robot navigation by Yun, S.C., Parasuraman, S., Ganapathy, V.

    Published 2011
    “…MATLAB simulation is developed to verify and validate the algorithm before they are real time implemented on Team AmigoBotTM robot. …”
    Get full text
    Get full text
    Conference or Workshop Item