Skip to content
Open access

Reward Generation for Model-Free Reinforcement Learning from Formal Specifications

Jul 2026 · Journal of Artificial Intelligence Research · Vol 86 · 0 citations
Computer Science

TL;DR

This work proposes a new quantitative semantics for STL having several desirable properties, making it suitable for reward generation, and establishes the new semantics to be the most suitable for synthesizing feedback controllers for complex continuous dynamical systems through reinforcement learning.

Abstract

Deep Reinforcement Learning (DRL) has the potential to be used for synthesizing feedback controllers (agents) for various complex systems with unknown dynamics. These systems are expected to satisfy diverse safety and liveness properties best captured using temporal logic. In RL, the reward function plays a crucial role in specifying the desired behaviour of these agents. However, the problem of designing the reward function for an RL agent to satisfy complex temporal logic specifications has received limited attention in the literature. To address this, we provide a systematic way of generating rewards in real-time by using the quantitative semantics of Signal Temporal Logic (STL), a widely used temporal logic to specify the behaviour of cyber-physical systems. We propose a new quantitative semantics for STL having several desirable properties, making it suitable for reward generation. We evaluate our STL-based reinforcement learning mechanism on several complex continuous control benchmarks and compare our STL semantics with those available in the literature in terms of their efficacy in synthesizing the controller agent. Experimental results establish our new semantics to be the most suitable for synthesizing feedback controllers for complex continuous dynamical systems through reinforcement learning.

Read PDF

Similar papers

Declarative Specifications for Efficient and Safe Reinforcement Learning

This dissertation presents a work in safe RL, where agents must also respect safety constraints using pure-past linear-time temporal logic (PPLTL), and presents how to enforce safety constraints using pure-past linear-time temporal logic (PPLTL).

Giovanni Varricchione · 0 citations
Preprint Jul 2026

Safe Reinforcement Learning using Ideas from Model Predictive Control

A generalized framework that combines the adaptive, high-performance nature of deep reinforcement learning (DRL) with the formal safety guarantees of model predictive control (MPC) is proposed, demonstrating successful exploration and stable policy convergence on physical hardware.

George Schafer, Jakob Rehrl, Stefan Huber et al. · 0 citations
Preprint Aug 2026

Reward Machines for Signal Temporal Logic

This work introduces a novel automata-based approach that provides an efficient memory mechanism and associated Markovian rewards suitable for RL frameworks and empirically demonstrates that this approach learns policies that achieve higher robustness scores and satisfaction rates than those learned by existing approac...

A. Bozkurt, Shang-Tong Zhang, Yuichi Motai · 0 citations
Jul 2026

Constrained Reinforcement Learning Using Successor Representations

The Safe Deep Successor Representation is proposed, a novel method that allows quick retraining of policies towards new cost structures and is competitive on a simple navigation task while being considerably more flexible.

Michaela Girstl, Alexander Mattick, Christopher Mutschler · 0 citations
#artificial intelligence Preprint Aug 2026

Policy-Invariant Reward Shaping from LLM Feedback: A Framework for Hybrid RL Agents

This work formalizes the hybrid LLM-planner and RL-controller architecture as a Goal-Augmented Markov Decision Process and shows that when the LLM per-state progress score is used as a bounded potential function, the resulting shaping term preserves the optimal policy set even when the LLM scores are inaccurate.

Christophe D. Hounwanou, John Emeka Eze, Yaé Ulrich Gaba · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.