Comparative Study on Collaboration Algorithms for Swarm Robots Dediated to Hostile Environment Application

Authors

  • Hanafi Wissam Bechar University
  • Tamali Mohammed Bechar University

DOI:

https://doi.org/10.59287/as-proceedings.617

Keywords:

Multi-Robots, Swarm Intelligence Algorithms, Path Planning, Cooperative Algorithms, Collaboration

Abstract

Recently, multipurpose robotic-oriented applications are being greatly developed, especially when collaborative capability for robots is mainly required. These areas and techniques have retained increasing attention from researchers due to the advances reached in mathematical development and their superior performance regarding single robot cases. These robots can be programmed to acquire new intelligence abilities as a result of collaborative and participatory competencies. The success of these algorithms lies in the cooperation between these robots to achieve specific goals while accomplishing different tasks, as well as the need to explore unknown environments and hostile areas. Because of the importance of this topic in research, much research is conducted to reduce the gap and minimize the difficulties observed in combining a low-cost algorithm for optimistic collaboration while working with swarm robots. Many strategies were being developed as a solution for supervising collaboration. This paper provides an overview and case study of algorithms dedicated to swarm robot collaboration. The comparison study aims to produce an additive point of view and provides a strategy for optimal collaboration among swarm robots in hostile environments.

Author Biographies

Hanafi Wissam, Bechar University

ENERGARID Lab. - SimulIA Team, Po Box 277, Kenadsa street, Bechar, Algeria

Tamali Mohammed, Bechar University

ENERGARID Lab. - SimulIA Team, Po Box 277, Kenadsa street, Bechar, Algeria

Downloads

Published

2023-12-25

How to Cite

Wissam, H., & Mohammed, T. (2023). Comparative Study on Collaboration Algorithms for Swarm Robots Dediated to Hostile Environment Application. AS-Proceedings, 1(7), 142–149. https://doi.org/10.59287/as-proceedings.617