Skip to main content
. Author manuscript; available in PMC: 2019 Jun 13.
Published in final edited form as: Proc ACM SIGCHI. 2017 Mar;2017:294–302. doi: 10.1145/2909824.3020252

Figure 3:

Figure 3:

(left) Paths corresponding to three different modal policies that lead to the same goal GL We use a stochastic modal policy mL to compactly represent all feasible paths from S to GL. (right) The robot moving upwards from point S could be moving towards either GL or GR.