Search Results - (( different simulation based algorithm ) OR ( using optimization path algorithm ))

Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

“…The proposed method is validated in simulations and proven to work effectively in different environments for different obstacle percentages of each investigation conducted to replicate a semi-dynamic obstacle environment. …”
Get full text
Get full text
Get full text
Get full text

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

“…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
Get full text

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

“…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
Get full text
Get full text

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

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

Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

“…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
Get full text
Get full text

Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

“…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
Get full text
Get full text

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

“…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text

An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

“…The algorithms are used to generate test cases for nine different Boolean expressions of different size and complexities. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Transmission path optimization Based on Efficiency Communication System by Jin Fan, Kit, Guan Lim, Sin, Helen Ee Chuo, Min, Keng Tan, Ali Farzamnia, Tze, Kenneth Kin Teo

“…In this paper, routing attribute table that is maintained by the nodes, the density and relative distance of node distribution, is used to determine the clustering method. At the same time, the developed algorithm combines the relative position of the cluster and the base station to further improve the routing method of the sub-cluster head, Finally, the algorithm analyzes the influence of different parameters on the transmission path, and use the simulation experiments to evaluate the conclusions.…”
Get full text
Get full text
Get full text
Get full text

Hierarchical gaussian reinforcement learning for path planning in uncertain environments by AlDahoul, Nouar, Htike@Muhammad Yusof, Zaw Zaw, Akmeliawati, Rini, Shafie, Amir Akramin

“…The simulation experimental results seem suggest the efficiency of the proposed algorithm in finding optimal paths of autonomous agents.…”
Get full text
Get full text
Get full text

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

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

Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…As a multi-agent algorithm, every agent in the population acts as a Kalman filter by using a standard Kalman filter framework, which includes a simulated measurement process and a best-so-far solution as a reference. …”
Get full text
Get full text
Get full text
Get full text

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

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

Efficient and scalable ant colony optimization based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

“…The proposed routing algorithm is simulated using MATLAB for performance evaluations. …”
Get full text
Get full text
Get full text
Get full text

Path Planning Optimization For Solar-Powered Perpetual Flight Across The World by Lim, Guang Ming

“…The successful flight pattern done by (Tan) which has covered latitude of ±66 ºat various longitude is used in this research with the attempt to reach the global coverage. Different combination of launching location and date time are simulated and studied based on the solar irradiance available from different regions. …”
Get full text
Get full text

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

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

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.

A mating technique for various crossover in genetic algorithm for optimum system identification by Abd Samad @ Mahmood, Md Fahmi, Zainuddin, Farah Ayiesya

“…Four discrete-time systems of linear and nonlinear types are simulated and identified. The results show that GA with single parent mating can speed up the search for optimal models and avoid premature convergence even with different types of crossover.…”
Get full text
Get full text
Get full text

Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

“…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
Get full text
Get full text