Search Results - (( based optimization modified algorithm ) OR ( two 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
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    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
    “…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    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
    Get full text
    Get full text
    Get full text
    Article
    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
    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
    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:
  7. 7
    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
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  8. 8
    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
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    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:
  10. 10
    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:
  11. 11
    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
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    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 chromosomes are decoded into active schedules thus increasing the probability of obtaining near or optimal solution significantly. Crossover between two parents is traditionally adopted in GA while multiparents crossover (more than two parents) technique is still lacking. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    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:
  14. 14
    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:
  15. 15
    Potential field methods and their inherent approaches for path planning

    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
    Save to List
    Saved in:
  16. 16
    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:
  17. 17
    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks

    A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

    Published 2016
    “…This research was aimed at the investigation of a new degree six chordal ring, the optimised degree six 3-modified chordal ring CHR6o3. A tree visualisation was constructed based on its connectivity to enable the generation of formulae for optimal diameter and average optimal path lengths. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    SNR-Based OLSR Routing Protocol for Wireless Mesh Networks

    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
    Save to List
    Saved in:
  19. 19
    Optimization of multi-holes drilling path using particle swarm optimization

    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
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  20. 20
    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
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: