{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/122736"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/122736","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"Exact geometry algorithms for robotic motion planning","abstract":"The current generation of robotic motion planning algorithms is dominated by derivatives of the PRM and RRT algorithms. These methods abstract away all geometric information about the underlying problem into a collision checker. While this approach yields simple and general purpose algorithms, it often comes at the cost of theoretical guarantees and performance. In this thesis, we explore deterministic motion planning algorithms that have explicit knowledge of the geometry of the underlying problems. By exploiting this geometry, we give algorithms that can achieve stronger theoretical guarantees and better performance in some problems. This thesis is divided into two main sections comprising of two different motion planning scenarios. In the first case, we explore issues of decidability in task and motion planning by giving a decision procedure for prehensile task and motion planning. In the second section, we present a holonomic motion planning algorithm that can almost always identify the exact optimal solution as a system of differential equations, which can be numerically solved to produce an asymptotically-optimal solution.","abstract_html":"The current generation of robotic motion planning algorithms is dominated by derivatives of the PRM and RRT algorithms. These methods abstract away all geometric information about the underlying problem into a collision checker. While this approach yields simple and general purpose algorithms, it often comes at the cost of theoretical guarantees and performance. In this thesis, we explore deterministic motion planning algorithms that have explicit knowledge of the geometry of the underlying problems. By exploiting this geometry, we give algorithms that can achieve stronger theoretical guarantees and better performance in some problems. This thesis is divided into two main sections comprising of two different motion planning scenarios. In the first case, we explore issues of decidability in task and motion planning by giving a decision procedure for prehensile task and motion planning. In the second section, we present a holonomic motion planning algorithm that can almost always identify the exact optimal solution as a system of differential equations, which can be numerically solved to produce an asymptotically-optimal solution.","abstract_has_math":false,"creators":["Deshpande, Ashwin."],"institution":"Massachusetts Institute of Technology","degree_name":"Doctoral","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Tomás Lozano-Pérez and Leslie P. Kaelbling."],"committee_chairs":[],"committee_members":[],"year":2019,"date_issued":"2019","date_published":"2019","updated_at":"2026-07-22T22:22:01Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/122736","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Tomás Lozano-Pérez and Leslie P. Kaelbling."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","EECS"]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Deshpande, Ashwin."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-11-04T20:21:47Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-11-04T20:21:47Z"]},{"key":"dc:date.issued","label":"Date","values":["2019"]},{"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":["Doctoral"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/122736"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 103-113)."]},{"key":"dc:description.abstract","label":"Abstract","values":["The current generation of robotic motion planning algorithms is dominated by derivatives of the PRM and RRT algorithms. These methods abstract away all geometric information about the underlying problem into a collision checker. While this approach yields simple and general purpose algorithms, it often comes at the cost of theoretical guarantees and performance. In this thesis, we explore deterministic motion planning algorithms that have explicit knowledge of the geometry of the underlying problems. By exploiting this geometry, we give algorithms that can achieve stronger theoretical guarantees and better performance in some problems. This thesis is divided into two main sections comprising of two different motion planning scenarios. In the first case, we explore issues of decidability in task and motion planning by giving a decision procedure for prehensile task and motion planning. In the second section, we present a holonomic motion planning algorithm that can almost always identify the exact optimal solution as a system of differential equations, which can be numerically solved to produce an asymptotically-optimal solution."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Ph. D."]},{"key":"dc:title","label":"Title","values":["Exact geometry algorithms for robotic motion planning"]}]}],"canonical_facts":{"dc:contributor.advisor":["Tomás Lozano-Pérez and Leslie P. Kaelbling."],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","EECS"],"dc:contributor.other":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science."],"dc:creator":["Deshpande, Ashwin."],"dc:date.accessioned":["2019-11-04T20:21:47Z"],"dc:date.available":["2019-11-04T20:21:47Z"],"dc:date.issued":["2019"],"dc:description":["Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 103-113)."],"dc:description.abstract":["The current generation of robotic motion planning algorithms is dominated by derivatives of the PRM and RRT algorithms. These methods abstract away all geometric information about the underlying problem into a collision checker. While this approach yields simple and general purpose algorithms, it often comes at the cost of theoretical guarantees and performance. In this thesis, we explore deterministic motion planning algorithms that have explicit knowledge of the geometry of the underlying problems. By exploiting this geometry, we give algorithms that can achieve stronger theoretical guarantees and better performance in some problems. This thesis is divided into two main sections comprising of two different motion planning scenarios. In the first case, we explore issues of decidability in task and motion planning by giving a decision procedure for prehensile task and motion planning. In the second section, we present a holonomic motion planning algorithm that can almost always identify the exact optimal solution as a system of differential equations, which can be numerically solved to produce an asymptotically-optimal solution."],"dc:description.degree":["Ph. D."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/122736"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["Exact geometry algorithms for robotic motion planning"],"dc:type":["Thesis"],"thesis:degree_name":["Doctoral"]},"updated_at":"2026-07-22T22:22:01Z"}