Multi-robot systems (MRSss) face several challenges, but the most typical problem is the multi-robot tasks allocation (MRTA). It consists in finding the efficient allocation mechanism in order to assign different tasks to the set of available robots. Toward this objective, robots will work as cooperative agents. MRTA aims at ensuring an efficient execution of tasks under consideration and thus minimizing the overall system cost. Various research works have solved the MRTA problem using the multiple traveling salesman problem (MTSP) formulation. In this context, an overview on MRTA and MTSP is given in this chapter. Furthermore, a summary of the related works is presented.
CITATION STYLE
Koubaa, A., Bennaceur, H., Chaari, I., Trigui, S., Ammar, A., Sriti, M. F., … Javed, Y. (2018). General background on multi-robot task allocation. In Studies in Computational Intelligence (Vol. 772, pp. 129–144). Springer Verlag. https://doi.org/10.1007/978-3-319-77042-0_6
Mendeley helps you to discover research relevant for your work.