mlsanityData to 14 Oct 2026

Logically-Constrained Neural Fitted Q-Iteration

arXiv 1809.07823 ↗First posted 20 Sep 2018cs.LG cs.FL cs.LOcited by 17

Not on the map. Why?

Abstract (arXiv)

We propose a method for efficient training of Q-functions for continuous-state Markov Decision Processes (MDPs) such that the traces of the resulting policies satisfy a given Linear Temporal Logic (LTL) property. LTL, a modal logic, can express a wide range of time-dependent logical properties (including "safety") that are quite similar to patterns in natural language. We convert the LTL property into a limit deterministic Buchi automaton and construct an on-the-fly synchronised product MDP. The control policy is then synthesised by defining an adaptive reward function and by applying a modified neural fitted Q-iteration algorithm to the synchronised structure, assuming that no prior knowledge is available from the original MDP. The proposed method is evaluated in a numerical study to test the quality of the generated control policy and is compared with conventional methods for policy synthesis such as MDP abstraction (Voronoi quantizer) and approximate dynamic programming (fitted value iteration).

Key facts. Cited by 17 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Sep 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2020: 2; 2021: 3; 2022: 5; 2023: 4; 2024: 2; 2025: 0; 2026: 1.

17 papers.

Sort:

By area: