Search Results - ((((path algorithm) OR (drops algorithm))) OR (based algorithm))

Search alternatives:

Refine Results
  1. 1
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm

    Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm by Enshaei, Mehdi

    Published 2015
    “…In this study, a new defence mechanism is proposed based on modification of the packet forwarding process, using Neighborhood Information (NI) and PT algorithm, and known as NIPT algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    AntNet: a robust routing algorithm for data networks

    AntNet: a robust routing algorithm for data networks by Haseeb, Shariq, Sidek, Khairul Azami, Ismail, Ahmad Faris, Weng Kin, Lai, Yit Mei, Aw

    Published 2004
    “…The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Optimized topology control in mobile IP networks using a new parametric routing algorithm

    Optimized topology control in mobile IP networks using a new parametric routing algorithm by Gholizadeh, Somayyeh, Abdullah, Azizol, Othman, Mohamed, Mohd Hanapi, Zurina

    Published 2018
    “…For this purpose, an Optimal Parametric Topology Control Routing (OPTCR) algorithm is introduced based on parametric linear programming formulation (LPF). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Token based path allocation approach for mobile robots in sorting centre for achieving high throughput

    Token based path allocation approach for mobile robots in sorting centre for achieving high throughput by Khoo, Zong Zheng

    Published 2024
    “…This project proposes an improved path-finding algorithm that implements token-based path finding while a robot wants to access a grid cell. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  6. 6
    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks

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

    Published 2012
    “…Finally, we propose Self-Decision Route Selection scheme which is an improvement of the Hop-based Spanning Tree (HST) algorithm that is used in some routing protocols such as AODV and DSR. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Improving Network Consistency and Data Availability Using Fuzzy C Mean Clustering Algorithm in Wireless Sensor Networks

    Improving Network Consistency and Data Availability Using Fuzzy C Mean Clustering Algorithm in Wireless Sensor Networks by Mujahid Tabassum

    Published 2024
    thesis::doctoral thesis
    Save to List
    Saved in:
  8. 8
    Identification and mitigation of non-line-of-sight path effect using repeater for hybrid ultra-wideband positioning and networking system

    Identification and mitigation of non-line-of-sight path effect using repeater for hybrid ultra-wideband positioning and networking system by Chung, Gwo Chin, Mohd. Aqmal Syafiq Kamarudin, Lee, It Ee, Tan, Soo Fun

    Published 2021
    “…A switching algorithm is written to identify the existence of NLOS paths based on received signal strength (RSS) and unique channel characteristics such as mean excess delay (MED) and root mean square (RMS). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system

    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
    Save to List
    Saved in:
  10. 10
    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions

    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions by Ting Kien Hua, Noraini Abdullah

    Published 2020
    “…All Possible Path Algorithm (APPA) was another algorithm that was also used to rank all the alternatives path based on multiple criteria. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION

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

    Published 2018
    “…In which the obstacles, start node and target node will be known in advance of starting the path planning algorithms. Based on the results of MATLAB simulation, the A* algorithm is the best algorithm in finding the shortest path with the least time taken. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  12. 12
    Modelling of multi-robot system for search and rescue

    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
    Save to List
    Saved in:
  13. 13
    Analysis of Dijkstra’s and A* algorithm to find the shortest path

    Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

    Published 2015
    “…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Intelligent Examination Timetabling System Using Hybrid Intelligent Water Drops Algorithm

    Intelligent Examination Timetabling System Using Hybrid Intelligent Water Drops Algorithm by AlDeeb, BA, Norwawi, NM, Al-Betar, MA, Jali, MZ

    Published 2024
    Subjects:
    Proceedings Paper
    Save to List
    Saved in:
  15. 15
    Path planning for unmanned aerial vehicles using visibility line-based methods

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

    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
    Save to List
    Saved in:
  17. 17
    Path planning algorithm for a car like robot based on Coronoi Diagram Method

    Path planning algorithm for a car like robot based on Coronoi Diagram Method by Inun, Haidie

    Published 2013
    “…The algorithm is based on Voronoi diagram method for the environment representation combined with Dijkstra’s algorithm to find the shortest path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment

    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
    Save to List
    Saved in:
  20. 20
    Indoor global path planning based on critical cells using dijkstra algorithm

    Indoor global path planning based on critical cells using dijkstra algorithm by Azrul Amri, Jamal, Engku Fadzli Hasan, Syed Abdullah, Fatma Susilawati, Mohamad

    Published 2015
    “…This paper proposes global path planning based on grids representation in an indoor environment using Dijkstra algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: