{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/147491"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/147491","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Inference and Task Planning over Spatially Complex Problems","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Cuellar, Alex"],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Shah, Julie"],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-09","date_published":"2022-09","updated_at":"2026-07-22T22:22:06Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"rights_urls":["http://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/147491","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Shah, Julie"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Cuellar, Alex"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-01-19T19:53:57Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-01-19T19:53:57Z"]},{"key":"dc:date.issued","label":"Date","values":["2022-09"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright MIT"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/147491"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["Inference and Task Planning over Spatially Complex Problems"]}]}],"canonical_facts":{"dc:contributor.advisor":["Shah, Julie"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Cuellar, Alex"],"dc:date.accessioned":["2023-01-19T19:53:57Z"],"dc:date.available":["2023-01-19T19:53:57Z"],"dc:date.issued":["2022-09"],"dc:description.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."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/147491"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"dc:rights.uri":["http://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["Inference and Task Planning over Spatially Complex Problems"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:22:06Z"}