Abstract
In this paper, we consider the problem of allocating human operator assistance in a system with multiple autonomous robots. Each robot is required to complete independent missions, each defined as a sequence of tasks. While executing a task, a robot can either operate autonomously or be teleoperated by the human operator to complete the task at a faster rate. We formulate our problem as a Mixed Integer Linear Program, which can be used to optimally solve small to moderate sized problem instances. We also develop an anytime algorithm that makes use of the problem structure to provide a fast and high-quality solution of the operator scheduling problem, even for larger problem instances. Our key insight is to identify blocking tasks in greedily-created schedules and iteratively remove those blocks to improve the quality of the solution. Through numerical simulations, we demonstrate the benefits of the proposed algorithm as an efficient and scalable approach that outperforms other greedy methods.
Original language | English |
---|---|
Title of host publication | Proceedings of the IEEE 61st Conference on Decision and Control (CDC 2022) |
Publisher | IEEE |
Pages | 3997-4003 |
ISBN (Print) | 978-1-6654-6761-2 |
DOIs | |
Publication status | Published - 2022 |
Event | IEEE 61st Conference on Decision and Control (CDC 2022) - Cancún, Mexico Duration: 6 Dec 2022 → 9 Dec 2022 |
Conference
Conference | IEEE 61st Conference on Decision and Control (CDC 2022) |
---|---|
Country/Territory | Mexico |
City | Cancún |
Period | 6/12/22 → 9/12/22 |
Bibliographical note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-careOtherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Keywords
- Schedules
- Numerical simulation
- Scheduling
- Task analysis
- Autonomous robots