E-Graphs: Bootstrapping Planning with Experience Graphs

In this paper, we develop an online motion planning approach which learns from its planning episodes (experiences) a graph, an Experience Graph. On the theoretical side, we show that planning with Experience graphs is complete and provides bounds on suboptimality with respect to the graph that represents the original planning problem. Experimentally, we show in simulations and on a physical robot that our approach is particularly suitable for higher-dimensional motion planning tasks such as planning for two armed mobile manipulation.

Authors

• Mike Phillips
• Benjamin J. Cohen
• Sachin Chitta
• Maxim Likhachev

Keywords

• heuristic search
• weighted A*
• experience graphs