Fast Task-Sequence Allocation for Heterogeneous Robot Teams with a Human in the Loop
2013 (English)In: Proc. of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013), IEEE , 2013, 1648-1655 p.Conference paper (Refereed)
Efficient task allocation with timing constraints to a team of possibly heterogeneous robots is a challenging problem with application, e.g., in search and rescue. In this paper a mixed-integer linear programming (MILP) approach is proposed for assigning heterogeneous robot teams to the simultaneous completion of sequences of tasks with specific requirements such as completion deadlines. For this purpose our approach efficiently combines the strength of state of the art Mixed Integer Linear Programming (MILP) solvers with human expertise in mission scheduling. We experimentally show that simple and intuitive inputs by a human user have substantial impact on both computation time and quality of the solution. The presented approach can in principle be applied to quite general missions for robot teams with human supervision.
Place, publisher, year, edition, pages
IEEE , 2013. 1648-1655 p.
IEEE International Conference on Intelligent Robots and Systems. Proceedings, ISSN 2153-0858
Robotics Computer Systems
IdentifiersURN: urn:nbn:se:liu:diva-95886DOI: 10.1109/IROS.2013.6696570ISI: 000331367401111OAI: oai:DiVA.org:liu-95886DiVA: diva2:639335
IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2013), November 3-8, 2013, Tokyo, Japan
ProjectsELLIIT; CADICS; CUAS; SHERPA
FunderELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications, 1025