Ahmet Semi Asarkaya

Probabilistically Guaranteed Satisfaction of Temporal Logic Constraints During Reinforcement Learning

We propose a novel constrained reinforcement learning method for finding optimal policies in Markov Decision Processes while satisfying temporal logic constraints with a desired probability throughout the learning process. An automata-theoretic approach is proposed to ensure the probabilistic satisf…