Counterexample-Guided Strategy Improvement for POMDPs Using Recurrent Neural Networks

The temporal logic of programs

Amir Pnueli · 1977

Earlier work this paper cites.

The complexity of Markov decision processes

Christos H. Papadimitriou and John N. Tsitsiklis · 1987

Earlier work this paper cites.

Long short-term memory

Sepp Hochreiter and Jürgen Schmidhuber · 1997

Earlier work this paper cites.

Planning and acting in partially observable stochastic domains

Leslie Pack Kaelbling, Michael L. Littman, and Anthony R. Cassandra · 1998

Earlier work this paper cites.

On the undecidability of probabilistic planning and infinite-horizon partially observable Markov decision problems

Omid Madani, Steve Hanks, and Anne Condon · 1999

Earlier work this paper cites.

Learning finite-state controllers for partially observable environments

Nicolas Meuleau, Leonid Peshkin, Kee-Eung Kim, and Leslie Pack Kaelbling · 1999

Earlier work this paper cites.

Value-function approximations for partially observable Markov decision processes

Milos Hauskrecht · 2000

Earlier work this paper cites.

Approximate planning in large POMDPs via reusable trajectories

Michael J Kearns, Yishay Mansour, and Andrew Y Ng · 2000

Earlier work this paper cites.

Policy gradient methods for reinforcement learning with function approximation

Richard S. Sutton, David A. McAllester, Satinder P. Singh, and Yishay Mansour · 2000

Earlier work this paper cites.

Point-based value iteration: An anytime algorithm for POMDPs

Joelle Pineau, Geoff Gordon, and Sebastian Thrun · 2003

Earlier work this paper cites.

Solving deep memory POMDPs with recurrent policy gradients

Daan Wierstra, Alexander Förster, Jan Peters, and Jürgen Schmidhuber · 2007

Cited alongside, same era.

Principles of Model Checking

Christel Baier and Joost-Pieter Katoen · 2008

Cited alongside, same era.

Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs

Christopher Amato, Daniel S Bernstein, and Shlomo Zilberstein · 2010

Cited alongside, same era.

Monte-carlo planning in large POMDPs

David Silver and Joel Veness · 2010

Cited alongside, same era.

On the computational complexity of stochastic controller optimization in POMDPs

Nikos Vlassis, Michael L. Littman, and David Barber · 2012

Cited alongside, same era.

How to construct deep recurrent neural networks

Original

Razvan Pascanu, Çaglar Gülçehre, Kyunghyun Cho, and Yoshua Bengio · 2013

Deep recurrent q-learning for partially observable MDPs

Original

Matthew Hausknecht and Peter Stone · 2015

Later among the works it cites.

Human-level control through deep reinforcement learning

Volodymyr Mnih, Koray Kavukcuoglu, David Silver, et al · 2015

Later among the works it cites.

What is decidable about partially observable Markov decision processes with ω \omega -regular objectives

Krishnendu Chatterjee, Martin Chmelík, and Mathieu Tracol · 2016

Later among the works it cites.

A storm is coming: A modern probabilistic model checker

Christian Dehnert, Sebastian Junges, Joost-Pieter Katoen, and Matthias Volk · 2017

Later among the works it cites.

Reluplex: An efficient SMT solver for verifying deep neural networks

Guy Katz, Clark Barrett, David L. Dill, Kyle Julian, and Mykel J. Kochenderfer · 2017

Later among the works it cites.