Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints

9 Jul 2018 • Yagiz Savas • Melkior Ornik • Murat Cubuktepe • Mustafa O. Karabag • Ufuk Topcu

We study the problem of synthesizing a policy that maximizes the entropy of a Markov decision process (MDP) subject to a temporal logic constraint. Such a policy minimizes the predictability of the paths it generates, or dually, maximizes the exploration of different paths in an MDP while ensuring the satisfaction of a temporal logic specification... (read more)

PDF Abstract

Code
Add Remove Mark official

No code implementations yet. Submit your code now

Tasks
Add Remove

Datasets

  Add Datasets introduced or used in this paper

Results from the Paper
Add Remove

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

Methods used in the Paper
Add Remove

METHOD TYPE
🤖 No Methods Found Help the community by adding them if they're not listed; e.g. Deep Residual Learning for Image Recognition uses ResNet
Contact us on: hello@paperswithcode.com. Papers With Code is a free resource with all data licensed under CC-BY-SA.
Terms Privacy Cookies policy