Search Results - optimal ((((window algorithm) OR (bees algorithm))) OR (path algorithm))

Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

“…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
Get full text
Get full text
Get full text

Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

“…The main finding of the study is that the Bees Algorithm found optimal drill path length and minimum machining time comparable to the results of the other algorithms for the 5 × 5, 7 × 7 and 9 × 9 problems. …”
Get full text
Get full text
Get full text
Get full text

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

“…This paper proposes a multi-robot path planning algorithm that integrates the improved nutcracker optimization algorithm with the improved dynamic window approach. …”
Get full text
Get full text
Get full text

Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows by Sankor, Salah Mortada Shahen

“…The Artificial Bee Colony (ABC) is a popular swarm intelligence algorithm for COP. …”
Get full text
Get full text

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

“…To reduce the optimization time of the tours created by the artificial bee colony algorithm, the fixed-radius near neighbor 2-opt algorithm was used as well. …”
Get full text
Get full text
Get full text

Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

“…A research is proposed based on Ant Colony Optimization for solving the shortest path problem in library.This is a research that the algorithm is aim to implement on a robot. …”
Get full text
Get full text

Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators by Nor Maniha, Abdul Ghani, Nizaruddin, M. Nasir, Azrul Azim, Abdullah Hashim

“…This study aims to evaluate the effectiveness of two optimization algorithms, artificial bee colony (ABC) and spiral dynamic algorithm (SDA), in controlling the position of a flexible-link manipulator. …”
Get full text
Get full text
Get full text

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

“…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

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

“…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

A review on path planning and obstacle avoidance algorithms for autonomous mobile robots by Anis Naema Atiyah, Rafai, Noraziah, Adzhar, Nor Izzati, Jaini

“…This paper reviews the mobile robot navigation approaches and obstacle avoidance used so far in various environmental conditions to recognize the improvement of path planning strategists. Taking into consideration commonly used classical approaches such as Dijkstra algorithm (DA), artificial potential field (APF), probabilistic road map (PRM), cell decomposition (CD), and meta-heuristic techniques such as fuzzy logic (FL), neutral network (NN), particle swarm optimization (PSO), genetic algorithm (GA), cuckoo search algorithm (CSO), and artificial bee colony (ABC). …”
Get full text
Get full text
Get full text
Get full text

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

“…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

A review : On intelligent mobile robot path planning techniques by Muhammad, Aisha, Ali, Mohammad A.H., Shanono, Ibrahim Haruna

“…The artificial intelligence methods such as genetic algorithm (GA), fuzzy logic (FL), ant colony optimization (ACO), neural network (NN), firefly algorithm (FA), particle swarm optimization (PSO), bacterial foraging optimization (BFO), artificial bee colony (ABC), and other miscellaneous algorithms are reviewed. …”
Get full text
Get full text
Get full text
Get full text

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

“…This signifies that the training was successful based on the fitted values of the window size. 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

Artificial Bee Colony for Minimizing the Energy Consumption in Mobile Ad Hoc Network by Tareq, M., Abed, S.A., Sundararajan, E.A.

“…The aim of this paper is to find the best possible route from the source to the destination based on a method inspired by the searching behaviour of bee colonies, i.e. artificial bee colony (ABC) algorithm. …”
Get full text
Get full text

Intelligent motion planning of a mobile robot by using convolutional neural network / Siti Asmah Abdullah by Siti Asmah, Abdullah

“…It trains by using labelled data which comes by eight different folders represent the eight different movements; up, up-right, right, right-down, down-left, left, and left-up. By the path reference created by A* algorithm the robot is capable in optimizing its path to reach the designated destination. …”
Get full text
Get full text
Get full text

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

“…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

A novel swarm-based optimisation algorithm inspired by artificial neural glial network for autonomous robots by Ismail, Amelia Ritahani, Tumian, Afidalina

“…The main idea in this algorithm is the indirect communication between the ants which is established by the means of pheromones in finding the shortest path between their nest and food [14]. …”
Get full text
Get full text

Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks by Muftah, Shalghum Khaled

“…The second part proposes an optimized flexible window-overlapping scheduling (OFWOS) algorithm that optimizes the offset difference ( ) between the samepriority TT windows in the adjacent nodes. …”
Get full text
Get full text

Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

“…Those two algorithms are combined together due to the strong possibilities of being unable to achieve the optimal results when implemented separately. …”
Get full text
Get full text
Get full text

Object tracing from synthetic fluid spray through instance segmentation by Md Refat Khan, Pathan

“…The resulting objects were then analyzed using a customized nearest neighbor algorithm to calculate their correspondence between frames and a BFS algorithm was used to trace their movement path. …”
Get full text
Get full text