Data-Efficient Policy Selection for Navigation in Partial Maps

This page did not load. You can still read it on the original site — the toolbar below keeps your place in the directory.

Consider a robot that is tasked to navigate to an unseen goal in a maze in which a green path on the floor signals the route to the goal. The robot’s behavior is guided by a policy that determines what action the robot should take at any point during navigation. In the figure below, the robot comes across a fork while trying to find the goal: ​ At a fork while trying to find the goal that exists…

Read on cs.gmu.edu ↗