Search Results - (( time optimization path algorithm ) OR ( based optimization modified algorithm ))

Refine Results
  1. 1

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…In conclusion, the integration of the two techniques has successfully produce an optimal shortest path with minimum execution time especially for environment with many obstacles. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

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

    A modified Q-learning path planning approach using distortion concept and optimization in dynamic environment for autonomous mobile robot by Low, Ee Soong, Ong, Pauline, Low, Cheng Yee

    Published 2023
    “…This study proposes an improved Q-learning (IQL) algorithm to address the challenges of path planning in such environments. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5

    A Review of Multi-holes Drilling Path Optimization Using Soft Computing Approaches by Najwa Wahida, Zainal Abidin, M. F. F., Ab Rashid, N. M. Zuki, N. M.

    Published 2017
    “…However, the existing researches were limited to implement, modify and hybridized the well-established optimization algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks by Ghathwan, Khalil Ibrahim

    Published 2016
    “…The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Route optimization security in mobile IPv6 wireless networks: a test-bed experience by Mehdizadeh, Abbas, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir, Kurup, Gopakumar

    Published 2008
    “…This algorithm is able to detect and prevent the attacker from modifying the data with using an encryption algorithm by cost of little bit increase but tolerable delay. …”
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…Metaheuristic is one of the “approximation methods” that is able to find practically acceptable solutions especially for large-scale problems within a limited amount of time. Genetic Algorithms (GA) which is based on biological evolution is one of the metaheuristics that has been successfully applied to JSSP. …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Security enhancement of route optimization in mobile IPv6 networks by Mehdizadeh, Abbas, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir, Kurup, Gopakumar

    Published 2008
    “…This algorithm is able to detect and prevent the attacker from modifying the data with using an encryption algorithm by cost of little bit increase but tolerable delay. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

    Published 2020
    “…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm by Arezoumand, Reza

    Published 2015
    “…Developing an exploration algorithm based on spanning tree is the main contribution. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Potential field methods and their inherent approaches for path planning by Omar, Rosli, Sabudin, E. N, C. K., Che Ku Melor, A., N. H

    Published 2016
    “…Moreover, there are important aspects that need to be addressed in path planning; computational time, optimal path and completeness. …”
    Get full text
    Get full text
    Article
  16. 16

    Dealing with Routing Hole Problem in Multi-hop Hierarchical Routing Protocol in Wireless Sensor Network by Sama, Najm Us

    Published 2019
    “…In the proposed work, the focused problem is how to reduce the communication energy consumption and to avoid the routing hole problem by optimized routing algorithms. First, a routing hole detection algorithm is proposed prior to designing the routing protocol which decreases about 30 percent energy consumption rate, detection time and detection overhead. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin, M. F. F., Ab Rashid, N. M. Zuki, N. M.

    Published 2018
    “…PSO algorithm gives the minimum value of fitness path and their CPU time compared to other algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
  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

    SNR-Based OLSR Routing Protocol for Wireless Mesh Networks by Elobaid, Mohamed Elshaikh

    Published 2009
    “…Unfortunately the routing protocols used such as AODV and Dynamic source routing (DSR) are hop count-based; where the routing algorithm uses the number of nodes to determine the optimum path to the destination. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

    Published 2025
    “…The results reveal that our proposed method reduces the mobile robot's travel time by up to 69%, 67%, 72%, and 79% compared to these algorithms, while consistently achieving optimal path lengths. …”
    Get full text
    Get full text
    Get full text
    Article