<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-21T15:12:47Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/129224" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/129224</identifier>
        <datestamp>2025-10-20</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:format>application/pdf</dc:format>
          <dc:language>en</dc:language>
          <dc:type>text</dc:type>
          <dc:description>Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms</dc:description>
          <dc:description>The student, Keyi Shen, accepted the attached license on 2025-05-06 at 23:20.</dc:description>
          <dc:description>The student, Keyi Shen, submitted this Thesis for approval on 2025-05-06 at 23:29.</dc:description>
          <dc:description>This Thesis was approved for publication on 2025-05-09 at 15:23.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #21852 on 2025-10-19 at 18:09:34</dc:description>
          <dc:title>Long-horizon motion planning with branch-and-bound and neural dynamics</dc:title>
          <dc:creator>Shen, Keyi</dc:creator>
          <dc:date>2025-05-09</dc:date>
          <dc:contributor>Zhang, Huan</dc:contributor>
          <dc:contributor>Li, Yunzhu</dc:contributor>
          <dc:subject>Robotic Manipulation</dc:subject>
          <dc:subject>Model-based Planning</dc:subject>
          <dc:subject>Neural Dynamics Models</dc:subject>
          <dc:subject>Branch-and-bound Method</dc:subject>
          <dc:language>eng</dc:language>
          <dc:description>Neural-network-based dynamics models learned from observational data have shown strong predictive capabilities for scene dynamics in robotic manipulation tasks. However, their inherent non-linearity presents significant challenges for effective planning. Current planning methods, often dependent on extensive sampling or local gradient descent, struggle with long-horizon motion planning tasks involving complex contact events. In this paper, we present a GPU-accelerated branch-and-bound (BaB) framework for motion planning in manipulation tasks that require trajectory optimization over neural dynamics models. Our approach employs a specialized branching heuristics to divide the search space into subdomains, and applies a modified bound propagation method, inspired by the state-of-the-art neural network verifier α,β-CROWN, to efficiently estimate objective bounds within these subdomains. The branching process guides planning effectively, while the bounding process strategically reduces the search space. Our framework achieves superior planning performance, generating high-quality state-action trajectories and surpassing existing methods in challenging, contact-rich manipulation tasks such as non-prehensile planar pushing with obstacles, object sorting, and rope routing in both simulated and real-world settings. Furthermore, our framework supports various neural network architectures, ranging from simple multilayer perceptrons to advanced graph neural dynamics models, and scales efficiently with different model sizes.</dc:description>
          <dc:date>2025-05</dc:date>
          <dc:type>Text</dc:type>
          <dc:identifier>https://hdl.handle.net/2142/129224</dc:identifier>
          <dc:rights>Copyright 2025 Keyi Shen</dc:rights>
          <degree>
            <department>Electrical &amp; Computer Eng</department>
            <discipline>Electrical &amp; Computer Engr</discipline>
            <grantor>University of Illinois Urbana-Champaign</grantor>
            <name>M.S.</name>
            <level>Thesis</level>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
