1,642 research outputs found
Learning to plan with uncertain topological maps
We train an agent to navigate in 3D environments using a hierarchical
strategy including a high-level graph based planner and a local policy. Our
main contribution is a data driven learning based approach for planning under
uncertainty in topological maps, requiring an estimate of shortest paths in
valued graphs with a probabilistic structure. Whereas classical symbolic
algorithms achieve optimal results on noise-less topologies, or optimal results
in a probabilistic sense on graphs with probabilistic structure, we aim to show
that machine learning can overcome missing information in the graph by taking
into account rich high-dimensional node features, for instance visual
information available at each location of the map. Compared to purely learned
neural white box algorithms, we structure our neural model with an inductive
bias for dynamic programming based shortest path algorithms, and we show that a
particular parameterization of our neural model corresponds to the Bellman-Ford
algorithm. By performing an empirical analysis of our method in simulated
photo-realistic 3D environments, we demonstrate that the inclusion of visual
features in the learned neural planner outperforms classical symbolic solutions
for graph based planning.Comment: ECCV 202
- …