Advanced Multi-Robot Path Planning Based on Grey Wolf and Teaching-Learning Based Optimisation

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Akıllı Ulaşım Sistemleri ve Uygulamaları Dergisi
Cilt: 8 Sayı: 1
Advanced Multi-Robot Path Planning Based on Grey Wolf and Teaching-Learning Based Optimisation

Advanced Multi-Robot Path Planning Based on Grey Wolf and Teaching-Learning Based Optimisation

Pages : 204-222

View : 90 | Download : 39

Publication Date : 2025-03-25

Article Type : Research Paper

Abstract :Multi-robots stand out for their flexibility, scalability, and robustness in complex tasks by collaborating. Rather than a single robot undertaking a task, many robots can perform one or more tasks, which increases the task efficiency. Mobile robots require path planning to reach the targeted locations while working in areas such as service, logistics, agriculture, and production. This situation is also valid for multi-robots. In this study, an advanced multi-robot path planning method adapted to the path planning of multi-robots is proposed by combining the advantageous aspects of the Grey Wolf Optimization algorithm and the Teaching and Learning Based Optimization algorithm for the path planning of multi-robots. The proposed method was compared with other algorithms. Simulations containing combinations of population numbers, robot numbers, and different environments were applied. The proposed method shows high performance compared to other methods in simulations applied to the multi-robot path-planning problem. According to the comparison results, the proposed method showed high performance in terms of parameter results, such as reaching a faster solution, closing to the target, and total fitness values used in the evaluation of the robot team.
Keywords : Çoklu robot, Yol planlama, Öğretme-öğrenme, Gri kurt optimizasyonu

ORIGINAL ARTICLE URL

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.