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

Search alternatives:

Refine Results
  1. 1
    A modified Q-learning path planning approach using distortion concept and optimization in dynamic environment for autonomous mobile robot

    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
    Save to List
    Saved in:
  2. 2
    A modified Q-learning path planning approach using distortion concept and optimization in dynamic environment for autonomous mobile robot

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

    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
    Save to List
    Saved in:
  3. 3
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    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
    “…However, despite of JPS advantage in using less memory, it does not consider the shape of obstacles when finding the shortest path from start to goal point. We demonstrate our framework; the integration of enhanced Jump Point Search algorithm with modified Bresenham for heuristic computation in virtual grid-based environment. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    A modified Q-learning path planning approach using distortion concept and optimization in dynamic environment for autonomous mobile robot

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

    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
    Save to List
    Saved in:
  5. 5
    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:
  6. 6
    A Review of Multi-holes Drilling Path Optimization Using Soft Computing Approaches

    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
    Save to List
    Saved in:
  7. 7
    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion

    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
    Save to List
    Saved in:
  8. 8
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Most metaheuristic algorithms are designed for continuous optimization problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Logical effort base adder circuits transistor sizing using constriction factor and mutative variants of particle swarm optimization algorithm / Muhammad Aiman Johari

    Logical effort base adder circuits transistor sizing using constriction factor and mutative variants of particle swarm optimization algorithm / Muhammad Aiman Johari by Johari, Muhammad Aiman

    Published 2015
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks

    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 mechanism is developed to find the shortest secure path and to reduce overhead using the information that is available in the routing tables as an input to propose a more complex nature-inspired algorithm. 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
    Save to List
    Saved in:
  11. 11
    Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network

    Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network by Halim, Nurul Hamimi

    Published 2018
    “…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Optimization of fast fourier transform based on twiddle factor using genetic algorithm on raspberry pi

    Optimization of fast fourier transform based on twiddle factor using genetic algorithm on raspberry pi by Ghazi, Firas Faisal

    Published 2019
    “…Over the years the Genetic Algorithms (GA) proved to be one of the best methods for optimization. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…There were also attempts to hybridize SKF with other famous algorithms such as Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Sine Cosine Algorithm (SCA) to improve its performance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Route optimization security in mobile IPv6 wireless networks: a test-bed experience

    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
    Save to List
    Saved in:
  15. 15
    Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network

    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
    Save to List
    Saved in:
  16. 16
    Security enhancement of route optimization in mobile IPv6 networks

    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
    Save to List
    Saved in:
  17. 17
    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin

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

    Published 2013
    “…The problem was initially tackled by “exact methods” such as the branch and bound method, which is based on the exhaustive enumeration of a restricted region of solutions containing exact optimal solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems

    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

    Published 2016
    “…The modified RTS algorithm also performed better compared to the existing heuristic methods. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Electricity distribution network for low and medium voltages based on evolutionary approach optimization

    Electricity distribution network for low and medium voltages based on evolutionary approach optimization by Hasan, Ihsan Jabbar

    Published 2015
    “…This thesis proposes an algorithm to find the optimum distribution substation placement and sizing by utilizing the PSO algorithm and optimum feeder routing using modified Minimum Spanning Tree (MST). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm

    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
    Save to List
    Saved in:

Search Tools: