Vazquez Flores, Gricel, Calinescu, Radu orcid.org/0000-0002-2678-9260 and Camara, Javier (2022) Scheduling of Missions with Constrained Tasks for Heterogeneous Robot Systems. In: Proceedings Fourth International Workshop on Formal Methods for Autonomous Systems (FMAS) and Fourth International Workshop on Automated and verifiable Software sYstem DEvelopment (ASYDE). Electronic proceedings in theoretical computer science. , pp. 156-174.
Abstract
We present a formal task allocation and scheduling approach for multi-robot missions (KANOA). KANOA supports two important types of task constraints: task ordering, which requires the execution of several tasks in a specified order; and joint tasks, which indicates tasks that must be performed by more than one robot. To mitigate the complexity of robotic mission planning, KANOA handles the allocation of the mission tasks to robots, and the scheduling of the allocated tasks separately. To that end, the task allocation problem is formalised in first-order logic and resolved using the Alloy model analyzer, and the task scheduling problem is encoded as a Markov decision process and resolved using the PRISM probabilistic model checker. We illustrate the application of KANOA through a case study in which a heterogeneous robotic team is assigned a hospital maintenance mission.
Metadata
| Item Type: | Proceedings Paper |
|---|---|
| Authors/Creators: |
|
| Dates: |
|
| Institution: | The University of York |
| Academic Units: | The University of York > Faculty of Sciences (York) > Computer Science (York) |
| Date Deposited: | 20 Sep 2022 10:30 |
| Last Modified: | 17 Nov 2025 16:00 |
| Published Version: | https://doi.org/10.48550/arXiv.2209.14040 |
| Status: | Published |
| Series Name: | Electronic proceedings in theoretical computer science |
| Identification Number: | 10.48550/arXiv.2209.14040 |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:191117 |

CORE (COnnecting REpositories)
CORE (COnnecting REpositories)