๐ฎ
๐ฎ
The Ethereal
Scheduling of Missions with Constrained Tasks for Heterogeneous Robot Systems
September 28, 2022 ยท The Ethereal ยท ๐ FMAS/ASYDE@SEFM
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Gricel Vรกzquez, Radu Calinescu, Javier Cรกmara
arXiv ID
2209.14040
Category
cs.LO: Logic in CS
Cross-listed
cs.MA,
cs.RO
Citations
7
Venue
FMAS/ASYDE@SEFM
Last Checked
5 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal