Search Results - (( based application path algorithm ) OR ( using optimization search algorithm ))

Search alternatives:

Refine Results
  1. 1
    Modelling of multi-robot system for search and rescue

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…One of the key aspects in multi-robot systems is the path planning problem, which involves finding collision-free paths for each robot to reach their respective destinations while optimizing various performance metrics. 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:
  2. 2
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…Finally, an adaptive neuro-fuzzy inference system (ANFIS) was designed which constructs and optimizes a fuzzy logic controller using a given dataset of input/output variables in order to increase the optimality and stability rates of the proposed path planning algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Mobile robot path planning using hybrid genetic algorithm and traversability vectors method

    Mobile robot path planning using hybrid genetic algorithm and traversability vectors method by Loo, C.K., Rajeswari, M., Wong, E.K., RaoTask, M.V.C.

    Published 2004
    “…Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…The African buffalo algorithm evolved from an understanding of the animal's survival instincts and the search techniques they utilize in the African forests and savannahs; the search for the optimal path to pasture is aligned to their cooperative, intelligent, and social nature. …”
    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
    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:
  8. 8
    The Hybrid of WOABAT-IFDO Optimization Algorithm and Its Application in Crowd Evacuation Simulation

    The Hybrid of WOABAT-IFDO Optimization Algorithm and Its Application in Crowd Evacuation Simulation by Hamizan, Sharbini, Roselina, Sallehuddin, Habibollah, Haron

    Published 2023
    “…This paper proposes a new hybrid of nature inspired optimization algorithm (IFDO-WOABAT) based on the latest optimization algorithm namely Improved Fitness Dependent Optimization (IFDO) with Whale-Bat Optimization algorithm (WOABAT). …”
    Get full text
    Get full text
    Get full text
    Proceeding
    Save to List
    Saved in:
  9. 9
    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…The second contribution of this thesis is developing an accurate search-based test data generator for generating automatically optimal test data to satisfy the whole constraints in the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman

    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman by Isman, Muhammad Iskandar

    Published 2017
    “…Therefore, in this research, will be use Ant Colony Optimization (ACO) algorithm as an optimize technique that provide a shortest path of defining a successor that is their highest value of criteria. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
    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
    “…Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system

    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar, Weria, Tang, Sai Hong, Mohamed Sahari, Khairul Salleh, Khaksar, Mansoor, Toressen, Jim

    Published 2019
    “…Furthermore, a heuristic dataset generator is implemented to provide enough data for the ANFIS using a randomized procedure. The performance of the proposed algorithm is evaluated through simulation in different motion planning queries. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    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:
  15. 15
    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system

    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar W., Hong T.S., Sahari K.S.M., Khaksar M., Torresen J.

    Published 2023
    Article
    Save to List
    Saved in:
  16. 16
    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution

    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

    Published 2017
    “…Objectives: Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    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 purpose of this study is to carry out a comparative evaluation study on Simulated Annealing (SA) and several variation of Tabu Search (TS).Materials and Method: This study considers four heuristic methods, i.e., Simulated Annealing (SA), conventional Tabu Search (TS), Improved Tabu Search (ITS) and modified Reactive Tabu Search (RTS) to solve symmetric TSPs.The algorithms were tested on five chosen benchmark problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Time series data intelligent clustering algorithm for landslide displacement prediction

    Time series data intelligent clustering algorithm for landslide displacement prediction by Han, Liu, Shang, Tao, Shu, Jisen, Khan Chowdhury, Ahmed Jalal

    Published 2018
    “…Clustering calculation of time series data set is carried out by using hierarchical clustering algorithm according to bending path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Articulated robots motion planning using foraging ant strategy

    Articulated robots motion planning using foraging ant strategy by Mohamad, Mohd. Murtadha

    Published 2008
    “…Hence, a new method of configuration generation along with a novel searching style is devised. An alternative search approach using ant behaviour in a robotics application is applied. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm

    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

    Published 2016
    “…Thus the proposed model trained with the CS algorithm provides a high convergence rate to the true global minimum and a better optimal solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: