2026-09-20T03:20:48Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1516122023-08-01T04:01:37Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Kaelbling, Leslie P.
Silver, Tom
Luong, Lilian
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2023-07-31T19:52:41Z
2023-07-31T19:52:41Z
2023-06
2023-06-06T16:35:40.168Z
https://hdl.handle.net/1721.1/151612
Bilevel planning is an effective approach for solving complex task and motion planning (TAMP) problems with continuous state and action spaces, that involves first searching for a high-level abstract plan and then refining it into a sequence of lowlevel actions. Although the low-level refinement process is a significant contributor to the total time needed to solve a task, this cost is typically unaccounted for during high-level planning. This can result in undesirable behavior if abstract plans that are difficult or even impossible to refine are selected over alternatives that may be slightly longer but can also be refined significantly faster. This work develops a method for learning to estimate the cost of refining an abstract plan and a framework for using the estimator to guide high-level search in a bilevel planner. We demonstrate using two environments that our proposed approach considerably improves on the combined planning and execution cost required for tasks compared to several baselines, including a standard benchmark bilevel planner and alternative estimator models.
M.Eng.
Massachusetts Institute of Technology
In Copyright - Educational Use Permitted
Copyright retained by author(s)
https://rightsstatements.org/page/InC-EDU/1.0/
Learning Refinement Cost Estimators for Bilevel
Planning
Thesis
application/pdf
Master
Master of Engineering in Electrical Engineering and Computer Science
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="4e575dfe-3fee-423b-9bba-8cc569b6333b">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Title>Learning Refinement Cost Estimators for Bilevel
Planning</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2023-06</PublicationDate>
<Authors>
<Author>
<DisplayName>Luong, Lilian</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>https://rightsstatements.org/page/InC-EDU/1.0/</License>
<Abstract>Bilevel planning is an effective approach for solving complex task and motion planning (TAMP) problems with continuous state and action spaces, that involves first searching for a high-level abstract plan and then refining it into a sequence of lowlevel actions. Although the low-level refinement process is a significant contributor to the total time needed to solve a task, this cost is typically unaccounted for during high-level planning. This can result in undesirable behavior if abstract plans that are difficult or even impossible to refine are selected over alternatives that may be slightly longer but can also be refined significantly faster. This work develops a method for learning to estimate the cost of refining an abstract plan and a framework for using the estimator to guide high-level search in a bilevel planner. We demonstrate using two environments that our proposed approach considerably improves on the combined planning and execution cost required for tasks compared to several baselines, including a standard benchmark bilevel planner and alternative estimator models.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>