We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
We present a reinforcement learning (RL) framework to synthesize a control policy from a given linear temporal logic (LTL) specification in an unknown stochastic environment that can be modeled as a Markov Decision Process (MDP). Specifically, we learn a policy that maximizes the probability of satisfying the LTL formula without learning the transition probabilities. We introduce a novel rewarding and path-dependent discounting mechanism based on the LTL formula such that (i) an optimal policy maximizing the total discounted reward effectively maximizes the probabilities of satisfying LTL objectives, and (ii) a model-free RL algorithm using these rewards and discount factors is guaranteed to converge to such policy. Finally, we illustrate the applicability of our RL-based synthesis approach on two motion planning case studies.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1909.07299")
get_code_for_paper("1909.07299")
have("1909.07299")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1909.07299.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1909.07299)
Connect an agent — have() is free.