Applications of Experience Graphs in Humanoid Motion Planning
Abstract
The capability of using cached plans, whether in the form of expert provided demonstrations or previously generated paths from prior planner runs, is a useful addition to any search based planner. Its benefits range from faster planning times in large state spaces to generation of more predictable replans in case of partially known environments which robots discover as they plan. The experience graph (E-Graph) algorithm is a planning algorithm which allows a planner to reuse cached plans/demonstrations by providing a heuristic which biases the search towards states which are present in prior demonstrations. This technical report addresses the particular application of the experience graph algorithm in search based planning for a 35-DOF humanoid. In this work, we outline the details of deploying E-Graphs to this particular problem and show that using E-Graphs significantly outperforms conventional methods like weighted A*.
BibTeX
@mastersthesis{Bardapurkar-2017-27162,author = {Sameer Bardapurkar},
title = {Applications of Experience Graphs in Humanoid Motion Planning},
year = {2017},
month = {August},
school = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-17-59},
keywords = {Search based planning, Reusing Demonstrations, E-Graph Planner, Humanoids},
}