Search Results - (( initial solution path algorithm ) OR ( variable selection based algorithm ))

Refine Results
  1. 1

    Multi-robot path planning based on the improved nutcracker optimization algorithm and the dynamic window approach by Zhao, Jiangrong, Ding, Hongwei, Zhu, Yuanjing, Yang, Zhijun, Hu, Peng, Wang, Zongshan

    Published 2024
    “…To address the nutcracker algorithm’s sensitivity to initial conditions and slow convergence, a population initialization strategy is introduced for more diverse initial populations. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    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
    “…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    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
    “…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    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
    “…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    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
    “…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    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
    “…Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8
  9. 9
  10. 10

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

    Published 2019
    “…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Solving the optimal path planning of a mobile robot using improved Q-learning by Low, Ee Soong, Ong, Pauline, Cheah, Kah Chun

    Published 2019
    “…Yet, despite such advantage, Q-learning exhibits slow convergence to the optimal solution. In order to address this limitation, the concept of partially guided Q-learning is introduced wherein, the flower pollination algorithm (FPA) is utilized to improve the initialization of Q-learning. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUW, HERU, MI ATILTIANSYAH, AN, ANDIKA, JULI RI, SHAVISUDIN, UBAIDAH, AUZI ZAICARIX, M °H MAD

    Published 2023
    “…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    AN INTEGRATED RRT*SMART-A* ALGORITHM FOR SOLVING THE GLOBAL PATH PLANNING PROBLEM IN A STATIC ENVIRONMENT by SUW, HERU, AtiltIANSYAH, AN- MI, RI ANDIKA, JULI, SHAVISUDIN, UBAIDAH, AUZI ZAICARIX, M °H MAD

    Published 2023
    “…Unlike RRT*, RRT*-Smart applies a path optimization by removing the redundant nodes from the initial path when it is gained. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Variable block based motion estimation using hexagon diamond full search algorithm (HDFSA) via block subtraction technique by Hardev Singh, Jitvinder Dev Singh

    Published 2015
    “…The variable block matching developed based on four stages which is the video and frame selection, threshold calculation, block size selection and search pattern. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Taguchi?s T-method with Normalization-Based Binary Bat Algorithm by Marlan Z.M., Jamaludin K.R., Harudin N.

    Published 2025
    “…Therefore, a variable selection technique using a swarm-based Binary Bat algorithm is proposed. …”
    Conference paper
  17. 17

    A meta-heuristics based input variable selection technique for hybrid electrical energy demand prediction models by ul Islam, B., Baharudin, Z.

    Published 2017
    “…The focus of the paper is to propose a hybrid approach for the selection of the most influential input variables for the training and testing of neural network based hybrid models. …”
    Get full text
    Get full text
    Article
  18. 18

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…This mechanism is restricted to search the possible solutions in a critical path. 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
  19. 19

    Robust variable selection methods for large- scale data in the presence of multicollinearity, autocorrelated errors and outliers by Uraibi, Hassan S.

    Published 2016
    “…We develop Robust Forward Selection algorithm based on RFCH correlation coefficient (RFS.RFCH) because FS.Winso is not robust to multivariate outliers. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Solving traveling salesman problem on cluster compute nodes by I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P.

    Published 2009
    “…Initially a sequential algorithm is fabricated from scratch and written in C language. …”
    Get full text
    Get full text
    Article