set of my solutions to Berkley CS 294: Deep Reinforcement Learning, Spring 2017 problems
-
Updated
Apr 9, 2017 - Jupyter Notebook
set of my solutions to Berkley CS 294: Deep Reinforcement Learning, Spring 2017 problems
Implementations of basic concepts dealt under the Reinforcement Learning umbrella. This project is collection of assignments in CS747: Foundations of Intelligent and Learning Agents (Autumn 2017) at IIT Bombay
Value Iteration and Policy Iteration to solve MDPs
MDPs solved using Value Iteration and Linear Programming
Notebooks for my youtube Reinforcement Learning leactures.
Project on Simultaneous Task Allocation and Planning Under Uncertainty
Implementation of LAO*/ILAO* MDP algorithms to solve PDDLGym environments
This part of assignment covers the concept of the Linear programming for solving MDPs.
A POMDP solver using Littman-Cassandra's Witness algorithm.
Agent which computes the optimal policy for in a Dice Game
The performances of NMDPs, RMDPs, DRMDPs are evaluated in several classis toy examples.
Python implementation of algorithms for Best Policy Identification in Markov Decision Processes
Interface for defining discrete and continuous-space MDPs and POMDPs in python. Compatible with the POMDPs.jl ecosystem.
A C++ framework for MDPs and POMDPs with Python bindings
discussion of MDPs and EM algorithm
Concise and friendly interfaces for defining MDP and POMDP models for use with POMDPs.jl solvers
Compressed belief-state MDPs in Julia compatible with POMDPs.jl
MDPs and POMDPs in Julia - An interface for defining, solving, and simulating fully and partially observable Markov decision processes on discrete and continuous spaces.
Add a description, image, and links to the mdps topic page so that developers can more easily learn about it.
To associate your repository with the mdps topic, visit your repo's landing page and select "manage topics."