Search Results - using optimization ((method algorithm) OR (((path algorithm) OR (search algorithm))))

Search alternatives:

Refine Results
  1. 1
    A generalized laser simulator algorithm for optimal path planning in constraints environment

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    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
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Adaptive route optimization for mobile robot navigation using evolutionary algorithm

    Adaptive route optimization for mobile robot navigation using evolutionary algorithm by Kit Guan Lim, Guan Lim, Yoong Hean Lee, Hean Lee, Min Keng Tan, Keng Tan, Hou, Pin Yoong, Tienlei, Wang, Tze, Kenneth Kin Teo

    Published 2021
    “…For example, Ant Colony Optimization (ACO) is an optimization algorithm based on swarm intelligence which is widely used to solve path planning problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
    Save to List
    Saved in:
  5. 5
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…This means A • algorithm only calculates and consider the next node m path that has the lowest value of G and F, plus searching the shortest route by using heuristic estimation in Manhattan method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm

    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

    Published 2025
    “…The results reveal that our proposed method reduces the mobile robot's travel time by up to 69%, 67%, 72%, and 79% compared to these algorithms, while consistently achieving optimal path lengths. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Particle swarm optimization (PSO) for CNC route problem

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

    Published 2002
    “…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  9. 9
    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming

    Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

    Published 2016
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment

    An Integrated RRT*SMART-A* Algorithm for solving the Global Path Planning Problem in a Static Environment by Suwoyo, Heru, Adriansyah, Andi, Andika, Julpri, Ubaidillah, Abu

    Published 2023
    “…The use of sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, ANDIKA, JULFRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by Suwayo, Heri, Adrishah, Andi, Andika, Juleri, Shamdudin, Abu Ubaidah, Zakaria, Mohamad Fauzi

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSHAH, ANDI, ANDIKA, JULPRI, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    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
    “…In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    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:
  16. 16
    Using artificial intelligence search in solving the camera placement problem

    Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

    Published 2022
    “…The chapter also carries out an analytical review of three main searching algorithms namely, generate and test, uninformed search, and hill climbing search algorithms. …”
    Get full text
    Get full text
    Book
    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
    “…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:
  18. 18
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by HERU SUWOYO, HERU SUWOYO, ANDI ADRIANSYAH, ANDI ADRIANSYAH, JULPRI ANDIKA, JULPRI ANDIKA, SHAMSUDIN, A LT UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by Heru Sowoyo, Heru Sowoyo, Andi Adrianshah, Andi Adrianshah, Julpri Andika, Julpri Andika, Shamsuddin, Abu Ubaidah, Zakaria, Mohamad Fauzi

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUWOYO, HERU, ADRIANSYAH, ANDI, JULI RI ANDIKA, JULI RI ANDIKA, SHAMSUDIN, ABU UBAIDAH, ZAKARIA, MOHAMAD FAUZI

    Published 2023
    “…The use o = sampling-based algorithms such as Rapidly-Exploring Random Tree Star (RRT*) has been widely applied in robot path planning. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: