Path planning of mobile robot using improved artificial bee colony algorithm

عدد الاستشهادات بقاعدة ارسيف : 
1

المؤلفون المشاركون

Ulaywi, Bushra Kazim
Kamil, Rka T.
Muhammad, Muhammad J.

المصدر

Engineering and Technology Journal

العدد

المجلد 38، العدد 9A (30 سبتمبر/أيلول 2020)، ص ص. 1384-1395، 12ص.

الناشر

الجامعة التكنولوجية

تاريخ النشر

2020-09-30

دولة النشر

العراق

عدد الصفحات

12

التخصصات الرئيسية

الهندسة الميكانيكية

الموضوعات

الملخص EN

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 excludesunnecessary 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 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 excludesunnecessary 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% .

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

Kamil, Rka T.& Muhammad, Muhammad J.& Ulaywi, Bushra Kazim. 2020. Path planning of mobile robot using improved artificial bee colony algorithm. Engineering and Technology Journal،Vol. 38, no. 9A, pp.1384-1395.
https://search.emarefa.net/detail/BIM-1236320

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

Kamil, Rka T.…[et al.]. Path planning of mobile robot using improved artificial bee colony algorithm. Engineering and Technology Journal Vol. 38, no. 9A (2020), pp.1384-1395.
https://search.emarefa.net/detail/BIM-1236320

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

Kamil, Rka T.& Muhammad, Muhammad J.& Ulaywi, Bushra Kazim. Path planning of mobile robot using improved artificial bee colony algorithm. Engineering and Technology Journal. 2020. Vol. 38, no. 9A, pp.1384-1395.
https://search.emarefa.net/detail/BIM-1236320

نوع البيانات

مقالات

لغة النص

الإنجليزية

الملاحظات

Includes bibliographical references : p. 1394-1395

رقم السجل

BIM-1236320