<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/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-11-22T10:38:17Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/114737" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/114737</identifier><datestamp>2026-05-15T19:50:14Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Qi, Dongping</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Vladimirsky, Alexander</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Bindel, David</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Damle, Anil</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-04-05T18:47:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-04-05T18:47:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2023-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 13778</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 30569263</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/114737</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/pp0n-ab95</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">16219366</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">164 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">We consider three optimal control problems, which focus on continuouspath-planning applications, and each problem deals with a specific challenge. First, we introduce a new local factoring technique which can remove numerical artifacts arising from Eikonal equations with non-smooth conditions. Next, we deal with path-planning under an initial uncertainty, which can be removed later at some certainty time, and further discuss methods suitable for different notions of optimality. The third section considers an online-learning path-planning problem with unknown surveillance intensity and develops a Bayesian reinforcement learning method. In addition to the three path-planning problems, a new method of parameterizing neural networks is introduced. It follows the continuous optimal control interpretation of deep learning and uses B-spline basis functions to parameterize. For each problem we use numerical experiments to show the advantages of our proposed methods.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Numerical Analysis</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Optimal Control</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Path Planning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Reinforcement Learning</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Robustness</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Uncertainty</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Challenges in Continuous Path Planning: Rarefactions, Uncertainty and Reinforcement Learning</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/16219366</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Applied Mathematics</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Applied Mathematics</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810.2</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Qi, Dongping</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="a242367d-f3d4-4a1d-9206-18aa8bb526b0">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>Challenges in Continuous Path Planning: Rarefactions, Uncertainty and Reinforcement Learning&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2023-08&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/pp0n-ab95&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Qi, Dongping&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Numerical Analysis&lt;/Keyword>
    &lt;Keyword>Optimal Control&lt;/Keyword>
    &lt;Keyword>Path Planning&lt;/Keyword>
    &lt;Keyword>Reinforcement Learning&lt;/Keyword>
    &lt;Keyword>Robustness&lt;/Keyword>
    &lt;Keyword>Uncertainty&lt;/Keyword>
   	&lt;Abstract>We consider three optimal control problems, which focus on continuouspath-planning applications, and each problem deals with a specific challenge. First, we introduce a new local factoring technique which can remove numerical artifacts arising from Eikonal equations with non-smooth conditions. Next, we deal with path-planning under an initial uncertainty, which can be removed later at some certainty time, and further discuss methods suitable for different notions of optimality. The third section considers an online-learning path-planning problem with unknown surveillance intensity and develops a Bayesian reinforcement learning method. In addition to the three path-planning problems, a new method of parameterizing neural networks is introduced. It follows the continuous optimal control interpretation of deep learning and uses B-spline basis functions to parameterize. For each problem we use numerical experiments to show the advantages of our proposed methods.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>