Provably-correct coordination of large collections of agents with counting temporal logic constraints
In this paper, we consider the problem of coordinating a large collection of homogeneous agents subject to a novel class of constraints: counting temporal logic constraints. Counting constraints arise naturally in many multi-agent planning problems where the identity of the agents is not important f...
Gespeichert in:
| Veröffentlicht in: | 2017 ACM IEEE 8th International Conference on Cyber Physical Systems (ICCPS) S. 249 - 258 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
New York, NY, USA
ACM
18.04.2017
|
| Schriftenreihe: | ACM Other Conferences |
| Schlagworte: | |
| ISBN: | 9781450349659, 145034965X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In this paper, we consider the problem of coordinating a large collection of homogeneous agents subject to a novel class of constraints: counting temporal logic constraints. Counting constraints arise naturally in many multi-agent planning problems where the identity of the agents is not important for the task to be completed. We introduce a formal language to capture such tasks and present an optimization-based technique to synthesize plans for large collections of agents in a way to guarantee the satisfaction of tasks specified in this formalism. |
|---|---|
| ISBN: | 9781450349659 145034965X |
| DOI: | 10.1145/3055004.3055021 |

