Inference and Task Planning over Spatially Complex Problems
Name
Cuellar-alexcuel-meng-eecs-2022-thesis.pdf
Description
Thesis PDF
Size
1.38 MB
Format
Adobe PDF
Checksum (MD5)
57568c584e8ae281e976e70290762bae
Author(s)
Cuellar, Alex
Advisor(s)
Shah, Julie
Date Issued
September 2022
Publisher
Massachusetts Institute of Technology
Abstract
One core problem of robot viability in many sectors is retrainability; if a robot’s task can change without changing code, automation becomes feasible for a wider set of applications. To advance robot retrainability, this thesis will introduce a learning from demonstrations (LfD) framework allowing a robot to learn and execute tasklevel plans in spatially complex environments. To achieve this goal, we introduce a propositional logic framework to encode spatial relationships between objects and an inference scheme to identify important relationships between defined object classes. Finally, we present a search-based algorithm to synthesize required class relationships into a task-level plan. As a representative problem for this of context, we focus on the problem of box packing, wherein the robot must learn specific rules surrounding how to place objects in a box according to a demonstrator’s wishes.
DISTRIBUTION STATEMENT A. Approved for public release. Distribution is unlimited.
This material is based upon work supported by the Under Secretary of Defense for Research and Engineering under Air Force Contract No. FA8702-15-D-0001. Any opinions, findings, conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the Under Secretary of Defense for Research and Engineering.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
In Copyright - Educational Use Permitted
Copyright MIT
Persistent DSpace Link
