WFA-IRL: Inverse Reinforcement Learning of Autonomous Behaviors Encoded as Weighted Finite Automata
Tianyu Wang, Nikolay Atanasov

TL;DR
This paper introduces WFA-IRL, a novel method that learns task specifications and cost functions from demonstrations by inferring weighted finite automata, enabling autonomous systems to generalize complex behaviors.
Contribution
The paper proposes a spectral learning approach to infer weighted finite automata from demonstrations and integrates it with IRL for autonomous behavior modeling.
Findings
Successfully infers task logic from demonstrations.
Enables generalization of behaviors in MiniGrid environments.
Combines WFA with IRL for autonomous control.
Abstract
This paper presents a method for learning logical task specifications and cost functions from demonstrations. Constructing specifications by hand is challenging for complex objectives and constraints in autonomous systems. Instead, we consider demonstrated task executions, whose logic structure and transition costs need to be inferred by an autonomous agent. We employ a spectral learning approach to extract a weighted finite automaton (WFA), approximating the unknown task logic. Thereafter, we define a product between the WFA for high-level task guidance and a labeled Markov decision process for low-level control. An inverse reinforcement learning (IRL) problem is considered to learn a cost function by backpropagating the loss between agent and expert behaviors through the planning algorithm. Our proposed model, termed WFA-IRL, is capable of generalizing the execution of the inferred…
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
TopicsReinforcement Learning in Robotics · Optimization and Search Problems · Formal Methods in Verification
