/Applications of Experience Graphs in Humanoid Motion Planning

Applications of Experience Graphs in Humanoid Motion Planning

Sameer Bardapurkar
Master's Thesis, Tech. Report, CMU-RI-TR-17-59, Robotics Institute, Carnegie Mellon University, August, 2017

Download Publication (PDF)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.


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 Reference
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},