Scalable methods for computing state similarity in deterministic MDPs

This post describes my paper Scalable methods for computing state similarity in deterministic MDPs, published at AAAI 2020. The code is available here.

Motivation

We consider distance metrics between states in an MDP. Take the following MDP, where the goal is to reach the green cells:

Sample MDP

Physical distance betweent states?

Physical distance often fails to capture the similarity properties we’d like:

Physical distance

State abstractions

Now imagine we add an exact copy of these states to the MDP (think of it as an additional “floor”):