Efficient and Safe Exploration in Deterministic Markov Decision Processes with Unknown Transition Models

1 Apr 2019Erdem BıyıkJonathan MargoliashShahrouz Ryan AlimoDorsa Sadigh

We propose a safe exploration algorithm for deterministic Markov Decision Processes with unknown transition models. Our algorithm guarantees safety by leveraging Lipschitz-continuity to ensure that no unsafe states are visited during exploration... (read more)

PDF Abstract


No code implementations yet. Submit your code now

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.