Inductive Synthesis of Finite-State Controllers for POMDPs
Not on the map. Why?
Abstract (arXiv)
We present a novel learning framework to obtain finite-state controllers (FSCs) for partially observable Markov decision processes and illustrate its applicability for indefinite-horizon specifications. Our framework builds on oracle-guided inductive synthesis to explore a design space compactly representing available FSCs. The inductive synthesis approach consists of two stages: The outer stage determines the design space, i.e., the set of FSC candidates, while the inner stage efficiently explores the design space. This framework is easily generalisable and shows promising results when compared to existing approaches. Experiments indicate that our technique is (i) competitive to state-of-the-art belief-based approaches for indefinite-horizon properties, (ii) yields smaller FSCs than existing methods for several models, and (iii) naturally treats multi-objective specifications.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 21 Mar 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 4; 2025: 1; 2026: 3.
9 papers.
- 2024Learning Logic Specifications for Policy Guidance in POMDPs: an Inductive Logic Programming Approachcited by 7
- 2024Learning Explainable and Better Performing Representations of POMDP Strategiescited by 4
- 2024Sound Heuristic Search Value Iteration for Undiscounted POMDPs with Reachability Objectivescited by 2
- 2025A Finite-State Controller Based Offline Solver for Deterministic POMDPscited by 2
- 2023Deductive Controller Synthesis for Probabilistic Hyperpropertiescited by 1
- 2024Explainable Representation of Finite-Memory Policies for POMDPs using Decision Treescited by 0
- 2026Scaling Observation-aware Planning in Uncertain Domainscited by 0
- 2026dtControl2+varepsilon: Trading Optimality for Explainability in MDPs via Decision Treescited by 0
- 2026Revealing After Overwriting: An Exponential POMDP OPE Lower Bound under History-Dependent Loggingcited by 0
- 2026Revealing After Overwriting: An Exponential POMDP OPE Lower Bound under History-Dependent Logging4 Oct 2026
- 2026dtControl2+varepsilon: Trading Optimality for Explainability in MDPs via Decision Trees28 Jul 2026
- 2026Scaling Observation-aware Planning in Uncertain Domains21 May 2026
- 2025A Finite-State Controller Based Offline Solver for Deterministic POMDPs1 May 2025
- 2024Explainable Representation of Finite-Memory Policies for POMDPs using Decision Trees20 Nov 2024
- 2024Sound Heuristic Search Value Iteration for Undiscounted POMDPs with Reachability Objectives5 Jun 2024
- 2024Learning Logic Specifications for Policy Guidance in POMDPs: an Inductive Logic Programming Approach29 Feb 2024
- 2024Learning Explainable and Better Performing Representations of POMDP Strategies15 Jan 2024
- 2023Deductive Controller Synthesis for Probabilistic Hyperproperties10 Jul 2023