E-Graphs: Bootstrapping Planning with Experience Graphs
DOI:
https://doi.org/10.1609/socs.v3i1.18225Keywords:
heuristic search, weighted A*, experience graphsAbstract
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.
Downloads
Published
2021-08-20
How to Cite
Phillips, M., Cohen, B., Chitta, S., & Likhachev, M. (2021). E-Graphs: Bootstrapping Planning with Experience Graphs. Proceedings of the International Symposium on Combinatorial Search, 3(1), 188-189. https://doi.org/10.1609/socs.v3i1.18225
Issue
Section
Extended Abstracts of Papers Presented Elsewhere