Learning specifications for reactive synthesis with safety constraints
Kandai Watanabe, Nicholas Renninger, Sriram Sankaranarayanan, Morteza Lahijanian

TL;DR
This paper introduces a safety-aware learning framework for reactive synthesis that infers probabilistic task specifications and generates strategies balancing safety, user preferences, and robot costs in dynamic environments.
Contribution
It presents a novel safety-constrained learning method that infers PDFA specifications and synthesizes strategies optimizing multiple objectives in reactive environments.
Findings
Learned PDFA never includes unsafe behaviors.
Synthesized strategies satisfy safety constraints and optimize preferences.
Effective across various robots and tasks.
Abstract
This paper presents a novel approach to learning from demonstration that enables robots to autonomously execute complex tasks in dynamic environments. We model latent tasks as probabilistic formal languages and introduce a tailored reactive synthesis framework that balances robot costs with user task preferences. Our methodology focuses on safety-constrained learning and inferring formal task specifications as Probabilistic Deterministic Finite Automata (PDFA). We adapt existing evidence-driven state merging algorithms and incorporate safety requirements throughout the learning process to ensure that the learned PDFA always complies with safety constraints. Furthermore, we introduce a multi-objective reactive synthesis algorithm that generates deterministic strategies that are guaranteed to satisfy the PDFA task while optimizing the trade-offs between user preferences and robot costs,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · Robot Manipulation and Learning · Machine Learning and Algorithms
