Search Results - (( using optimization modified algorithm ) OR ( _ optimization path algorithm ))*

Search alternatives:

Refine Results
  1. 1
    Path Optimization For Cooperative Multi-Head 3d Printing

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…Therefore, to solve the LPOP, two algorithms are proposed, the modified AS algorithm and the modified ACS algorithm. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  2. 2
    New algorithm for autonomous dynamic path planning in real-time intelligent robot car

    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
    Save to List
    Saved in:
  3. 3
    An intelligent path planning for autonomous mobile robot using modified A* algorithm with hybrid particle swarm optimization-artificial neural network (Not for loan)

    An intelligent path planning for autonomous mobile robot using modified A* algorithm with hybrid particle swarm optimization-artificial neural network (Not for loan) by Mohammed, Aqeel Abdulazeez

    Published 2019
    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 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:
  5. 5
    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:
  6. 6
    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:
  7. 7
    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:
  8. 8
    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:
  9. 9
    Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm

    Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm by Abu Samah, Khyrina Airin Fariza

    Published 2016
    “…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    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:
  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
    “…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:
  12. 12
    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:
  13. 13
    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:
  14. 14
    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    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:
  16. 16
    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 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:
  17. 17
    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
    “…The research work revolves around the 16-point Radix-4 Single Path Delay Feedback (R4SDF) for optimizing the pipelined Fast Fourier Transform (FFT) processor, which can be done by using both Single Objective Genetic Algorithm and Multi-Objective Genetic Algorithm , Nowadays in many areas of engineering and science are widely using FFT processors in most of their applications, thus, the modern science requires continuously new optimizations which includes the FFT processor to have a lower power consumption and a smaller size. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    PLANNING OF MULTIPLE FEEDERS ELECTRICAL DISTRIBUTION SYSTEM

    PLANNING OF MULTIPLE FEEDERS ELECTRICAL DISTRIBUTION SYSTEM by NORDIN, AHMAD SOLLEHIN

    Published 2011
    “…In this project, several algorithms are implemented to design an electrical distribution system which are (1) Optimal Feeder Path Algorithm, (2) Modified Load Flow Algorithm, (3) Optimal Branch Conductor Selection Algorithm, and ( 4) Optimal Location of Substation Algorithm. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  19. 19
    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:
  20. 20
    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:

Search Tools: