Answer set programming for non-stationary Markov decision processes

Nenhuma Miniatura disponível
Citações na Scopus
10
Tipo de produção
Artigo
Data
2017
Autores
Ferreira L.A.
C. Bianchi R.A.
Santos P.E.
de Mantaras R.L.
Orientador
Periódico
Applied Intelligence
Título da Revista
ISSN da Revista
Título de Volume
Citação
Anjoletto, L.; Bianchi; Santos, Paulo; De MANTARAS, R. L.. Answer Set Programming for Non-Stationary Markov Decision Processes. APPLIED INTELLIGENCE, v. 1, p. 1, 2017.
Texto completo (DOI)
Palavras-chave
Resumo
© 2017, Springer Science+Business Media New York.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.

Coleções