Environment-Independent Task Specifications via GLTL

04/14/2017
by   Michael L. Littman, et al.
0

We propose a new task-specification language for Markov decision processes that is designed to be an improvement over reward functions by being environment independent. The language is a variant of Linear Temporal Logic (LTL) that is extended to probabilistic specifications in a way that permits approximations to be learned in finite time. We provide several small environments that demonstrate the advantages of our geometric LTL (GLTL) language and illustrate how it can be used to specify standard reinforcement-learning tasks straightforwardly.

READ FULL TEXT
research
04/01/2020

Statistically Model Checking PCTL Specifications on Markov Decision Processes via Reinforcement Learning

Probabilistic Computation Tree Logic (PCTL) is frequently used to formal...
research
09/07/2016

Unifying task specification in reinforcement learning

Reinforcement learning tasks are typically specified as Markov decision ...
research
11/05/2021

Regular Decision Processes for Grid Worlds

Markov decision processes are typically used for sequential decision mak...
research
06/07/2019

Planning With Uncertain Specifications (PUnS)

Reward engineering is crucial to high performance in reinforcement learn...
research
11/03/2022

lilGym: Natural Language Visual Reasoning with Reinforcement Learning

We present lilGym, a new benchmark for language-conditioned reinforcemen...
research
06/21/2021

Automatic Synthesis of Experiment Designs from Probabilistic Environment Specifications

This paper presents an extension to the probabilistic programming langua...
research
10/28/2017

Interpretable Apprenticeship Learning with Temporal Logic Specifications

Recent work has addressed using formulas in linear temporal logic (LTL) ...

Please sign up or login with your details

Forgot password? Click here to reset