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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2017 ACM IEEE 8th International Conference on Cyber Physical Systems (ICCPS) s. 249 - 258
Hlavní autoři: Sahin, Yunus Emre, Nilsson, Petter, Ozay, Necmiye
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 18.04.2017
Edice:ACM Other Conferences
Témata:
Computer science
Computer systems organization > Embedded and cyber-physical systems > Robotics > Robotic autonomy
Computing methodologies > Artificial intelligence > Control methods > Motion path planning
Computing methodologies > Artificial intelligence > Planning and scheduling > Multi-agent planning
Computing methodologies > Artificial intelligence > Planning and scheduling > Planning for deterministic actions
Correct-by-construction synthesis
Cyber-physical systems
Electrical engineering
Planning
Robot kinematics
Theory of computation > Logic > Abstraction
Theory of computation > Logic > Modal and temporal logics
Vehicle dynamics
correct-by-construction synthesis
ISBN:9781450349659, 145034965X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
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