{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/67346"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/67346","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"GUARANTEED ROBOTIC PLANNING AND EXPLORATION IN UNKNOWN ENVIRONMENTS","abstract":"Robots have become ubiquitous in modern life, but their autonomous application has, thus far, been relegated to well known, well structured, or benign environments. Practical guarantees for robotic path planning in unknown environments have been elusive. This work explores three distinct problems in robotic planning and exploration in unknown environments and their interconnections. First, information gathering is considered in an environment with known obstacles. An algorithm is developed which solves the information gathering problem while providing a probabilistic guarantee on localization. The algorithm's behavior is analyzed, and a practical demonstration is presented. Second, multi-robot exploration and tracking of multiple objects is explored. A centralized planning algorithm is developed which provides a guarantee on maintaining tracking accuracy of located objects while continuing exploration. Finally, the problem of minimum time planning under uncertain or incomplete maps is considered, and an optimal planner which guarantees collision avoidance is developed. This planner allows near real-time computation while proving smooth dynamically feasible trajectories.","abstract_html":"Robots have become ubiquitous in modern life, but their autonomous application has, thus far, been relegated to well known, well structured, or benign environments. Practical guarantees for robotic path planning in unknown environments have been elusive. This work explores three distinct problems in robotic planning and exploration in unknown environments and their interconnections. First, information gathering is considered in an environment with known obstacles. An algorithm is developed which solves the information gathering problem while providing a probabilistic guarantee on localization. The algorithm&#x27;s behavior is analyzed, and a practical demonstration is presented. Second, multi-robot exploration and tracking of multiple objects is explored. A centralized planning algorithm is developed which provides a guarantee on maintaining tracking accuracy of located objects while continuing exploration. Finally, the problem of minimum time planning under uncertain or incomplete maps is considered, and an optimal planner which guarantees collision avoidance is developed. This planner allows near real-time computation while proving smooth dynamically feasible trajectories.","abstract_has_math":false,"creators":["Ivanov, Alexander"],"institution":"Cornell University","degree_name":"Ph.D., Electrical and Computer Engineering","degree_level":"Doctor of Philosophy","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Campbell, Mark"],"committee_members":["Vladimirsky, Alexander B.","Ferrari, Silvia"],"year":2019,"date_issued":"2019-05-30","date_published":"2019-05-30","updated_at":"2026-11-19T03:20:35Z","subjects":["Exploration","Computer science","Robotics","Path planning","Optimal control"],"languages":["en_US"],"rights":["Attribution 4.0 International"],"rights_urls":["https://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/7mxn-5568"],"render_values":[{"text":"https://doi.org/10.7298/7mxn-5568","href":"https://doi.org/10.7298/7mxn-5568","code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["11050328"],"render_values":[{"text":"11050328","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11328","ProQuest Publication ID: 13814409"],"render_values":[{"text":"ProQuest Submission ID: 11328","href":null,"code":true},{"text":"ProQuest Publication ID: 13814409","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/67346","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/67346","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F67346","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Campbell, Mark"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Vladimirsky, Alexander B.","Ferrari, Silvia"]},{"key":"dc:creator","label":"Author","values":["Ivanov, Alexander"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-10-15T15:30:13Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-10-15T15:30:13Z"]},{"key":"dc:date.issued","label":"Date","values":["2019-05-30"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D., Electrical and Computer Engineering"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Exploration","Computer science","Robotics","Path planning","Optimal control"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["11050328"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/7mxn-5568"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11328","ProQuest Publication ID: 13814409"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/67346"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"9f04bfef-42ee-4f1b-8163-a2b9f32271db\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>GUARANTEED ROBOTIC PLANNING AND EXPLORATION IN UNKNOWN ENVIRONMENTS</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019-05-30</PublicationDate> <DOI>https://doi.org/10.7298/7mxn-5568</DOI> <Authors> <Author> <DisplayName>Ivanov, Alexander</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by/4.0/</License> <Keyword>Exploration</Keyword> <Keyword>Computer science</Keyword> <Keyword>Robotics</Keyword> <Keyword>Path planning</Keyword> <Keyword>Optimal control</Keyword> <Abstract>Robots have become ubiquitous in modern life, but their autonomous application has, thus far, been relegated to well known, well structured, or benign environments. Practical guarantees for robotic path planning in unknown environments have been elusive. This work explores three distinct problems in robotic planning and exploration in unknown environments and their interconnections. First, information gathering is considered in an environment with known obstacles. An algorithm is developed which solves the information gathering problem while providing a probabilistic guarantee on localization. The algorithm's behavior is analyzed, and a practical demonstration is presented. Second, multi-robot exploration and tracking of multiple objects is explored. A centralized planning algorithm is developed which provides a guarantee on maintaining tracking accuracy of located objects while continuing exploration. Finally, the problem of minimum time planning under uncertain or incomplete maps is considered, and an optimal planner which guarantees collision avoidance is developed. This planner allows near real-time computation while proving smooth dynamically feasible trajectories.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Ivanov, Alexander"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description.abstract","label":"Abstract","values":["Robots have become ubiquitous in modern life, but their autonomous application has, thus far, been relegated to well known, well structured, or benign environments. Practical guarantees for robotic path planning in unknown environments have been elusive. This work explores three distinct problems in robotic planning and exploration in unknown environments and their interconnections. First, information gathering is considered in an environment with known obstacles. An algorithm is developed which solves the information gathering problem while providing a probabilistic guarantee on localization. The algorithm's behavior is analyzed, and a practical demonstration is presented. Second, multi-robot exploration and tracking of multiple objects is explored. A centralized planning algorithm is developed which provides a guarantee on maintaining tracking accuracy of located objects while continuing exploration. Finally, the problem of minimum time planning under uncertain or incomplete maps is considered, and an optimal planner which guarantees collision avoidance is developed. This planner allows near real-time computation while proving smooth dynamically feasible trajectories."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dcterms:license","label":"Dcterms License","values":["https://hdl.handle.net/1813/59810"]},{"key":"dc:title","label":"Title","values":["GUARANTEED ROBOTIC PLANNING AND EXPLORATION IN UNKNOWN ENVIRONMENTS"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"9f04bfef-42ee-4f1b-8163-a2b9f32271db\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>GUARANTEED ROBOTIC PLANNING AND EXPLORATION IN UNKNOWN ENVIRONMENTS</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2019-05-30</PublicationDate> <DOI>https://doi.org/10.7298/7mxn-5568</DOI> <Authors> <Author> <DisplayName>Ivanov, Alexander</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by/4.0/</License> <Keyword>Exploration</Keyword> <Keyword>Computer science</Keyword> <Keyword>Robotics</Keyword> <Keyword>Path planning</Keyword> <Keyword>Optimal control</Keyword> <Abstract>Robots have become ubiquitous in modern life, but their autonomous application has, thus far, been relegated to well known, well structured, or benign environments. Practical guarantees for robotic path planning in unknown environments have been elusive. This work explores three distinct problems in robotic planning and exploration in unknown environments and their interconnections. First, information gathering is considered in an environment with known obstacles. An algorithm is developed which solves the information gathering problem while providing a probabilistic guarantee on localization. The algorithm's behavior is analyzed, and a practical demonstration is presented. Second, multi-robot exploration and tracking of multiple objects is explored. A centralized planning algorithm is developed which provides a guarantee on maintaining tracking accuracy of located objects while continuing exploration. Finally, the problem of minimum time planning under uncertain or incomplete maps is considered, and an optimal planner which guarantees collision avoidance is developed. This planner allows near real-time computation while proving smooth dynamically feasible trajectories.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Ivanov, Alexander"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Campbell, Mark"],"dc:contributor.committeemember":["Vladimirsky, Alexander B.","Ferrari, Silvia"],"dc:creator":["Ivanov, Alexander"],"dc:date.accessioned":["2019-10-15T15:30:13Z"],"dc:date.available":["2019-10-15T15:30:13Z"],"dc:date.issued":["2019-05-30"],"dc:description.abstract":["Robots have become ubiquitous in modern life, but their autonomous application has, thus far, been relegated to well known, well structured, or benign environments. Practical guarantees for robotic path planning in unknown environments have been elusive. This work explores three distinct problems in robotic planning and exploration in unknown environments and their interconnections. First, information gathering is considered in an environment with known obstacles. An algorithm is developed which solves the information gathering problem while providing a probabilistic guarantee on localization. The algorithm's behavior is analyzed, and a practical demonstration is presented. Second, multi-robot exploration and tracking of multiple objects is explored. A centralized planning algorithm is developed which provides a guarantee on maintaining tracking accuracy of located objects while continuing exploration. Finally, the problem of minimum time planning under uncertain or incomplete maps is considered, and an optimal planner which guarantees collision avoidance is developed. This planner allows near real-time computation while proving smooth dynamically feasible trajectories."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["11050328"],"dc:identifier.doi":["https://doi.org/10.7298/7mxn-5568"],"dc:identifier.other":["ProQuest Submission ID: 11328","ProQuest Publication ID: 13814409"],"dc:identifier.uri":["https://hdl.handle.net/1813/67346"],"dc:language.iso":["en_US"],"dc:rights":["Attribution 4.0 International"],"dc:rights.uri":["https://creativecommons.org/licenses/by/4.0/"],"dc:subject":["Exploration","Computer science","Robotics","Path planning","Optimal control"],"dcterms:license":["https://hdl.handle.net/1813/59810"],"dc:title":["GUARANTEED ROBOTIC PLANNING AND EXPLORATION IN UNKNOWN ENVIRONMENTS"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph.D., Electrical and Computer Engineering"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:20:35Z"}