Computer Science Masters Thesis Presentation

Monday, July 13, 2015 - 1:30pm


Blelloch-Skees Conference Room 8115 Gates & Hillman Centers


EVAN SHAPIRO, 5th Year Masters Student

Robots are rapidly moving towards proficiency at useful tasks. In order for task planners to adapt to novel scenarios, new architectures and algorithms will be necessary. This work develops a framework and extensions to that framework in order to provide an accessible system that can efficiently and robustly plan for a wide variety of tasks. The framework dynamically restricts search space by exploiting highly interconnected hierarchically composed actions. The hierarchical action structure can be generated dynamically during planning, allowing geometric state to determine high level search space restrictions. This allows the framework to provide intermediate goals to efficiently plan through high dimensional spaces over long sequences of actions, and integrate with arbitrary existing task and motion planners. We also develop framework enhancements to improve performance during both planning and during execution. The order in which intermediate steps are explored greatly affects planning time. We apply a variant of Monte Carlo Tree Search to determine the order to compute intermediate steps. Execution performance is improved by interleaving planning and execution. We consider tasks that are composed of reversible trajectories, and construct methods to traverse partially complete plans. We explore the affects of different variants of these enhancements on manipulation tasks. Copy of Masters Document

For More Information, Contact:


Masters Thesis Presentation