Cover Image

Active Reward Machine Inference From Raw State Trajectories

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shehab, Mohamad Louai, Aspeel, Antoine, Ozay, Necmiye
Format:	Preprint
Published:	2026
Subjects:	Robotics Artificial Intelligence Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning Reward Machines from Partially Observed Policies
by: Shehab, Mohamad Louai, et al.
Published: (2025)

Simultaneous Task Allocation and Planning for Multi-Robots under Hierarchical Temporal Logic Specifications
by: Luo, Xusheng, et al.
Published: (2024)

Adaptive Bi-Level Multi-Robot Task Allocation and Learning under Uncertainty with Temporal Logic Constraints
by: Lin, Xiaoshan, et al.
Published: (2025)

Behavior Trees vs Executable Ontologies: a Comparative Analysis of Robot Control Paradigms
by: Boldachev, Alexander
Published: (2025)

Joint Verification and Refinement of Language Models for Safety-Constrained Planning
by: Yang, Yunhao, et al.
Published: (2024)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

Fine-Tuning Language Models Using Formal Methods Feedback
by: Yang, Yunhao, et al.
Published: (2023)

RepV: Safety-Separable Latent Spaces for Scalable Neurosymbolic Plan Verification
by: Yang, Yunhao, et al.
Published: (2025)

SELP: Generating Safe and Efficient Task Plans for Robot Agents with Large Language Models
by: Wu, Yi, et al.
Published: (2024)

Inference of Deterministic Finite Automata via Q-Learning
by: Hosseinkhani, Elaheh, et al.
Published: (2025)

Stochastic Directly-Follows Process Discovery Using Grammatical Inference
by: Alkhammash, Hanan, et al.
Published: (2023)

TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching
by: Meng, Yue, et al.
Published: (2025)

INPROVF: Leveraging Large Language Models to Repair High-level Robot Controllers from Assumption Violations
by: Meng, Qian, et al.
Published: (2025)

Preference-Based Planning in Stochastic Environments: From Partially-Ordered Temporal Goals to Most Preferred Policies
by: Rahmani, Hazhar, et al.
Published: (2024)

The Sparse Tsetlin Machine: Sparse Representation with Active Literals
by: Østby, Sebastian, et al.
Published: (2024)

Learning specifications for reactive synthesis with safety constraints
by: Watanabe, Kandai, et al.
Published: (2026)

Resource-Constrained Robotic Planning in the face of Mixed Uncertainty
by: Yin, Yihao, et al.
Published: (2026)

The Trembling-Hand Problem for LTLf Planning
by: Yu, Pian, et al.
Published: (2024)

LAD-VF: LLM-Automatic Differentiation Enables Fine-Tuning-Free Robot Planning from Formal Methods Feedback
by: Yang, Yunhao, et al.
Published: (2025)

Motion Planning for Automata-based Objectives using Efficient Gradient-based Methods
by: Balakrishnan, Anand, et al.
Published: (2024)

LTL-D*: Incrementally Optimal Replanning for Feasible and Infeasible Tasks in Linear Temporal Logic Specifications
by: Ren, Jiming, et al.
Published: (2024)

Autonomous Task Planning for Heterogeneous Multi-Agent Systems
by: Tziola, Anatoli A., et al.
Published: (2022)

An Iterative Approach for Heterogeneous Multi-Agent Route Planning with Resource Transportation Uncertainty and Temporal Logic Goals
by: Cardona, Gustavo A., et al.
Published: (2025)

Neuro-Symbolic Generation of Explanations for Robot Policies with Weighted Signal Temporal Logic
by: Yuasa, Mikihisa, et al.
Published: (2025)

AS2FM: Enabling Statistical Model Checking of ROS 2 Systems for Robust Autonomy
by: Henkel, Christian, et al.
Published: (2025)

Planning with Linear Temporal Logic Specifications: Handling Quantifiable and Unquantifiable Uncertainty
by: Yu, Pian, et al.
Published: (2025)

Optimization-based Task and Motion Planning under Signal Temporal Logic Specifications using Logic Network Flow
by: Lin, Xuan, et al.
Published: (2024)

Robust MITL planning under uncertain navigation times
by: Linard, Alexis, et al.
Published: (2024)

About Time: Model-free Reinforcement Learning with Timed Reward Machines
by: Roy, Rajarshi, et al.
Published: (2025)

Expressive Reward Synthesis with the Runtime Monitoring Language
by: Donnelly, Daniel, et al.
Published: (2025)

Robust Probabilistic Model Checking with Continuous Reward Domains
by: Ji, Xiaotong, et al.
Published: (2025)

Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
by: Dhayalkar, Sahil Rajesh
Published: (2025)

Computing the Reachability Value of Posterior-Deterministic POMDPs
by: Fijalkow, Nathanaël, et al.
Published: (2026)

Logic-Gated Time-Shared Feedforward Networks for Alternating Finite Automata: Exact Simulation and Learnability
by: Dhayalkar, Sahil Rajesh
Published: (2026)

Probabilistic Modeling of Spiking Neural Networks with Contract-Based Verification
by: Yao, Zhen, et al.
Published: (2025)

BEAVER: An Efficient Deterministic LLM Verifier
by: Suresh, Tarun, et al.
Published: (2025)

HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs
by: Ospanov, Azim, et al.
Published: (2025)

LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning
by: Chen, Lekai, et al.
Published: (2024)

Congruence-based Learning of Probabilistic Deterministic Finite Automata
by: Carrasco, Matías, et al.
Published: (2024)

Large Language Models and the Extended Church-Turing Thesis
by: Wiedermann, Jiří, et al.
Published: (2024)