Learning to plan with uncertain topological maps - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

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 noiseless 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.
Fichier principal
Vignette du fichier
2007.05270.pdf (2.76 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02933641 , version 1 (09-09-2020)



Edward Beeching, Jilles Dibangoye, Olivier Simonin, Christian Wolf. Learning to plan with uncertain topological maps. ECCV 2020 - 16th European Conference on Computer Vision, Aug 2020, Glasgow, United Kingdom. pp.1-24, ⟨10.1007/978-3-030-58580-8_28⟩. ⟨hal-02933641⟩
116 View
156 Download



Gmail Mastodon Facebook X LinkedIn More