A Combinatorial Disjunctive Constraint Approach to Optimal Footstep Planning

Simple item page
dc.contributor.advisorHicks, Illya V
dc.creatorGarcia, Raul
dc.date.accessioned2023-08-09T14:33:01Z
dc.date.available2023-08-09T14:33:01Z
dc.date.created2023-05
dc.date.issued2023-04-07
dc.date.submittedMay 2023
dc.date.updated2023-08-09T14:33:01Z
dc.description.abstractWalking robots have many uses in manufacturing, agriculture, medical practice, prosthesis research, emergency relief, military operations, space exploration, service, and entertainment. These include industrial inspection, maintenance, personal assistance, surveillance, reconnaissance, delivery, and human interactions. In many of these scenarios, an autonomous agent must find a path through a cluttered environment to safely arrive at a destination, and such a path should in some sense be optimal. However, its workspace is generally non-convex and needs to be efficiently described in the context of an optimization problem. For this reason, we leverage the independent branching scheme to construct small, ideal formulations for constraints that ensure our robot travels only through obstacle-free polyhedral regions, which traditionally have been formulated with (non-ideal) big-M techniques. As our approach requires a biclique cover for an associated graph, we exploit the structure of this class of graphs to develop a fast subroutine for obtaining biclique covers in polynomial time. While experiments have shown the big-M approach to outperform our method on most of our test instances, there are numerous directions for future work which may improve our resolution time as well as determine classes of scenarios where our formulation may be more favorable.
dc.format.mimetypeapplication/pdf
dc.identifier.citationGarcia, Raul. "A Combinatorial Disjunctive Constraint Approach to Optimal Footstep Planning." (2023) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/115061">https://hdl.handle.net/1911/115061</a>.
dc.identifier.urihttps://hdl.handle.net/1911/115061
dc.language.isoeng
dc.rightsCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.
dc.subjectdisjunctive constraints
dc.subjectideal formulations
dc.subjectMIP
dc.subjectmixed-integer programming
dc.subjectpath planning
dc.subjectfootstep planning
dc.subjectrobotics
dc.titleA Combinatorial Disjunctive Constraint Approach to Optimal Footstep Planning
dc.typeThesis
dc.type.materialText
thesis.degree.departmentComputational and Applied Mathematics
thesis.degree.disciplineEngineering
thesis.degree.grantorRice University
thesis.degree.levelMasters
thesis.degree.nameMaster of Arts
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
GARCIA-DOCUMENT-2023.pdf
Size:
26.21 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
PROQUEST_LICENSE.txt
Size:
5.84 KB
Format:
Plain Text
Description:
Download
No Thumbnail Available
Name:
LICENSE.txt
Size:
2.6 KB
Format:
Plain Text
Description:
Download
Collections
Rice University Electronic Theses and Dissertations