no code implementations • 29 Jun 2023 • Kevin Leahy, Makai Mann, Zachary Serlin
We advance the state of the art in Boolean composition of learned tasks with three contributions: i) introduce two distinct notions of safety in this framework; ii) show how to enforce either safety semantics, prove correctness (under some assumptions), and analyze the trade-offs between the two safety notions; and iii) extend Boolean composition from discrete action spaces to continuous action spaces.
no code implementations • 30 Nov 2022 • Wenliang Liu, Kevin Leahy, Zachary Serlin, Calin Belta
In this paper, we propose a learning-based framework to simultaneously learn the communication and distributed control policies for a heterogeneous multi-agent system (MAS) under complex mission requirements from Capability Temporal Logic plus (CaTL+) specifications.
no code implementations • 4 Oct 2022 • Wenliang Liu, Kevin Leahy, Zachary Serlin, Calin Belta
We consider the problem of controlling a heterogeneous multi-agent system required to satisfy temporal logic requirements.
no code implementations • 3 Oct 2022 • Mingyu Cai, Makai Mann, Zachary Serlin, Kevin Leahy, Cristian-Ioan Vasile
This is achieved by decomposing an infeasible LTL formula into several reach-avoid sub-tasks with shorter horizons, which can be trained in a modular DRL architecture.
no code implementations • 29 Oct 2019 • Zachary Serlin, Guang Yang, Brandon Sookraj, Calin Belta, Roberto Tron
The centralized QuickMatch algorithm is compared to other standard matching algorithms, while the Distributed QuickMatch algorithm is compared to the centralized algorithm in terms of preservation of match consistency.