Path Planning for a Mobile Robot using Genetic Algorithm and Artificial Bee Colony

Author(s):  
Emori Alain Servulo Carballo ◽  
Lluvia Morales ◽  
Felipe Trujillo-Romero
2015 ◽  
Vol 30 ◽  
pp. 319-328 ◽  
Author(s):  
Marco A. Contreras-Cruz ◽  
Victor Ayala-Ramirez ◽  
Uriel H. Hernandez-Belmonte

Actuators ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 4
Author(s):  
Haoting Liu ◽  
Jianyue Ge ◽  
Yuan Wang ◽  
Jiacheng Li ◽  
Kai Ding ◽  
...  

An optimal mission assignment and path planning method of multiple unmanned aerial vehicles (UAVs) for disaster rescue is proposed. In this application, the UAVs include the drug delivery UAV, image collection UAV, and communication relay UAV. When implementing the modeling and simulation, first, three threat sources are built: the weather threat source, transmission tower threat source, and upland threat source. Second, a cost-revenue function is constructed. The flight distance, oil consumption, function descriptions of UAV, and threat source factors above are considered. The analytic hierarchy process (AHP) method is utilized to estimate the weights of cost-revenue function. Third, an adaptive genetic algorithm (AGA) is designed to solve the mission allocation task. A fitness function which considers the current and maximum iteration numbers is proposed to improve the AGA convergence performance. Finally, an optimal path plan between the neighboring mission points is computed by an improved artificial bee colony (IABC) method. A balanced searching strategy is developed to modify the IABC computational effect. Extensive simulation experiments have shown the effectiveness of our method.


2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi

A modified version of the artificial Bee Colony Algorithm (ABC) was suggested namely Adaptive Dimension Limit- Artificial Bee Colony Algorithm (ADL-ABC). To determine the optimum global path for mobile robot that satisfies the chosen criteria for shortest distance and collision–free with circular shaped static obstacles on robot environment. The cubic polynomial connects the start point to the end point through three via points used, so the generated paths are smooth and achievable by the robot. Two case studies (or scenarios) are presented in this task and comparative research (or study) is adopted between two algorithm’s results in order to evaluate the performance of the suggested algorithm. The results of the simulation showed that modified parameter (dynamic control limit) is avoiding static number of limit which excludes unnecessary Iteration, so it can find solution with minimum number of iterations and less computational time. From tables of result if there is an equal distance along the path such as in case A (14.490, 14.459) unit, there will be a reduction in time approximately to halve at percentage 5%.


Sign in / Sign up

Export Citation Format

Share Document