Selecting appropriate reinforcement-learning algorithms for robot manipulation domains

Engineering reinforcement learning agents for application on a particular target domain requires making decisions such as the learning algorithm and state representation. We empirically study the performance of three reference implementations of model-free reinforcement learning algorithms: Covariance Matrix Adaptation Evolution Strategy, Deep Deterministic Policy Gradients, and Proximal Policy Optimization. We compare their performance on various target domains to measure quantitatively their dependence on varied features of the environment. We study the effect of actuation noise, observation noise, reward sparsity and task horizon. Then, we explore automatically generated state encodings for learning using a lower-dimensional encoding from high dimensional sensor data. A proof-of- concept end-to-end system for scooping beads of different sizes in the real world generates, uses, then follows force traces along with a positional controller to execute a scoop.

Name thesis:degree_name

Master

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2019

Author dc:creator

• LaGrassa, Alex Licari.

Advisor dc:contributor.advisor

• Leslie Pack Kaelbling.

• Electrical Engineering and Computer Science.

Statement dc:rights

• MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/124251

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/124251