Answer Set Programming for Non-Stationary Markov Decision Processes

2017-05-03 · Leonardo A. Ferreira, Reinaldo A. C. Bianchi, Paulo E. Santos, Ramon Lopez de Mantaras

Non-stationary domains, where unforeseen changes happen, present a challenge for agents to find an optimal policy for a sequential decision making problem. This work investigates a solution to this problem that combines Markov Decision Processes (MDP) and Reinforcement Learning (RL) with Answer Set Programming (ASP) in a method we call ASP(RL). In this method, Answer Set Programming is used to find the possible trajectories of an MDP, from where Reinforcement Learning is applied to learn the optimal policy of the problem. Results show that ASP(RL) is capable of efficiently finding the optimal solution of an MDP representing non-stationary domains.

📄 PDF Abstract BibTeX arXiv:1705.01399

Code (0)

등록된 구현이 없습니다.

Tasks

Decision Making reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)Sequential Decision Making

A method for the online construction of the set of states of a Markov Decision Process using Answer Set Programming

2017-06-05 · Leonardo A. Ferreira, Reinaldo A. C. Bianchi, Paulo E. Santos, Ramon Lopez de Mantaras

Non-stationary domains, that change in unpredicted ways, are a challenge for agents searching for optimal policies in sequential decision-making problems. This paper presents a combination of Markov Decision Processes (M…

Decision Making Reinforcement Learning Reinforcement Learning (RL)Sequential Decision Making

Heuristics, Answer Set Programming and Markov Decision Process for Solving a Set of Spatial Puzzles

2019-02-16 · Thiago Freitas dos Santos, Paulo E. Santos, Leonardo A. Ferreira, Reinaldo A. C. Bianchi 외

Spatial puzzles composed of rigid objects, flexible strings and holes offer interesting domains for reasoning about spatial entities that are common in the human daily-life's activities. The goal of this work is to inves…

Q-Learning Reinforcement Learning Reinforcement Learning (RL)

Beyond Average Return in Markov Decision Processes

2023-10-31 · NeurIPS 2023 11 · Alexandre Marthe, Aurélien Garivier, Claire Vernade

What are the functionals of the reward that can be computed and optimized exactly in Markov Decision Processes?In the finite-horizon, undiscounted setting, Dynamic Programming (DP) can only handle these operations effici…

Distributional Reinforcement Learning

On the Use of Non-Stationary Policies for Stationary Infinite-Horizon Markov Decision Processes

2012-12-01 · NeurIPS 2012 12 · Bruno Scherrer, Boris Lesner

We consider infinite-horizon stationary $\gamma$-discounted Markov Decision Processes, for which it is known that there exists a stationary optimal policy. Using Value and Policy Iteration with some error $\epsilon…

Tight Performance Bounds for Approximate Modified Policy Iteration with Non-Stationary Policies

2013-04-20 · Boris Lesner, Bruno Scherrer

We consider approximate dynamic programming for the infinite-horizon stationary $\gamma$-discounted optimal control problem formalized by Markov Decision Processes. While in the exact case it is known that there always e…