Poster Abstract: Model-Free Reinforcement Learning for Symbolic Automata-encoded Objectives

DOI10.1145/3501710.3524734OpenAlexW4225014288MaRDI QIDQ6120727

Anand Balakrishnan, Stefan Jakšić, Jyotirmoy V. Deshmukh, Dejan Ničković, Unnamed Author

Publication date: 21 February 2024

Published in: 25th ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3501710.3524734

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Cites Work

• \({\mathcal Q}\)-learning
• The power of symbolic automata and transducers
• On compatible linear connections with totally anti-symmetric torsion tensor of three-dimensional generalized Berwald manifolds
• Unnamed Item