An Evolutionary Traveling Salesman Approach for Multi-Robot Task Allocation

Muhammad Usman Arif, Sajjad Haider

2017

Abstract

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.

Paper Citation

in Harvard Style

Arif M. and Haider S. (2017). An Evolutionary Traveling Salesman Approach for Multi-Robot Task Allocation . In Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-220-2, pages 567-574. DOI: 10.5220/0006197305670574

in Bibtex Style

@conference{icaart17,
author={Muhammad Usman Arif and Sajjad Haider},
title={An Evolutionary Traveling Salesman Approach for Multi-Robot Task Allocation},
booktitle={Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2017},
pages={567-574},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006197305670574},
isbn={978-989-758-220-2},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 9th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - An Evolutionary Traveling Salesman Approach for Multi-Robot Task Allocation
SN - 978-989-758-220-2
AU - Arif M.
AU - Haider S.
PY - 2017
SP - 567
EP - 574
DO - 10.5220/0006197305670574