Subgoal-based methods are designed to solve sparse reward problems. A distance measure is required
in order for low-level policies to receive internal rewards according to its current state and the subgoal.
Many algorithms simply use Euclidean distance [8, 9] or cosine-distance as measurements.[1]}
