An evolutionary traveling salesman approach for Multi-robot task allocation

Department

Department of Computer Science

Was this content written or created while at IBA?

Yes

Document Type

Conference Paper

Publication Date

1-1-2017

Author Affiliation

  • Muhammad Usman Arif is PhD Scholar at the Department of Computer Science, Institute of Business Administration, Karachi
  • Sajjad Haider is Professor at Institute of Business Administration, Karachi

Conference Name

9th International Conference on Agents and Artificial Intelligence

Conference Location

Porto, Portugal

Conference Dates

24-26 February 2017

ISBN/ISSN

85053114801 (Scopus)

First Page

567

Last Page

574

Publisher

SciTePress, Science and Technology Publications, Lda

Abstract / Description

Multi-Robot Task Allocation (MRTA) addresses the problems related to an efficient job assignment in a team of robots. This paper expresses MRTA as a generalization of the Multiple Traveling Salesman Problem (MTSP) and utilizes evolutionary algorithms (EA) for optimal task assignment. The MTSP version of the problem is also solved using combinatorial optimization techniques and results are compared to demonstrate that EA can be effectively used for providing solutions to such problems.

Citation/Publisher Attribution

Arif, M. U., & Haider, S. (2017). An Evolutionary Traveling Salesman Approach for Multi-Robot Task Allocation. In ICAART (2) (pp. 567-574).

Link to Full Text

Find in your library

Share

COinS