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...
Uložené v:
| Vydané v: | 2017 ACM IEEE 8th International Conference on Cyber Physical Systems (ICCPS) s. 249 - 258 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY, USA
ACM
18.04.2017
|
| Edícia: | ACM Other Conferences |
| Predmet: | |
| ISBN: | 9781450349659, 145034965X |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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 |

