Search Results - (( using simulation modified algorithm ) OR ( basic optimization path algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Particle swarm optimization (PSO) for CNC route problem

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm

    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

    Published 2021
    “…To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm

    Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah A., Parman S., Abbasi A., Solihin M.I., Manan T.S.A., Beddu S., Ahmad A., Rasdi N.W.

    Published 2023
    Article
    Save to List
    Saved in:
  7. 7
    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim

    Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

    Published 2007
    “…It makes use of three basic operations in order to optimize this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Path planning algorithm for a car like robot based on MILP method

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…This study shows that Basic Theta* is able to produce the true shortest path compared to A* which produced slightly longer path. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Genetic algorithm optimization for coefficient of FFT processor

    Genetic algorithm optimization for coefficient of FFT processor by Pang, Jia Hong, Sulaiman, Nasri

    Published 2010
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Robotic path planning using rapidly-exploring random trees

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    Published 2013
    “…However, the planned path by using basic RRT structure might not always be optimal in terms of path length. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Adaptive beamforming algorithm based on Simulated Kalman Filter

    Adaptive beamforming algorithm based on Simulated Kalman Filter by Kelvin Lazarus, Lazarus

    Published 2017
    “…Some of the metaheuristic algorithms have been modified from the original algorithms to improve the algorithms performance in adaptive beamforming application. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Optimized clustering with modified K-means algorithm

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Testing on real data sets showed consistency results as the simulated ones. Generally, the proposed modified k-means algorithm is able to determine the optimum number of clusters for huge data.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Improving on the network lifetime of clustered-based wireless sensor network using modified leach algorithm

    Improving on the network lifetime of clustered-based wireless sensor network using modified leach algorithm by Zeni, Saltihie

    Published 2012
    “…This document is a study about LEACH algorithm where the implementation was done using OMNeT++ network simulator to study the performance of this algorithm in term of network lifetime. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Embedding Malaysian House Red Ant Behavior into an Ant Colony System

    Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2008
    “…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  16. 16
    Ant system with heuristics for capacitated vehicle routing problem

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…As a route improvement strategy, two heuristics which are the swap among routes procedure and 3-opt algorithm are also employed within the ASH algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…The proposed algorithm has been better than basic ABC in all tested problems with average of 0.570%.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    A Modified Simulated Kalman Filter Optimizer with State Measurement, Substitution Mutation, Hamming Distance Calculation, and Swap Operator

    A Modified Simulated Kalman Filter Optimizer with State Measurement, Substitution Mutation, Hamming Distance Calculation, and Swap Operator by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2021
    “…The simulated Kalman filter (SKF) is an algorithm for population-based optimization based on the Kalman filter framework. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    1D Multigrid Solver For Finite Element Method

    1D Multigrid Solver For Finite Element Method by Azhar, Mohamad Amiruddin

    Published 2022
    “…The new algorithm also has been tested using time simulation. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  20. 20
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: