{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/147490"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/147490","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"S*: Geometric Multimodal Trajectory Optimization via Apex Interpolating Spiro Splines","abstract":"Non-heuristic multimodal trajectory optimization is widely considered an intractable holy grail for real-time robotic systems, with the existing state-of-the-art standing at a heuristic hierarchical approach that stacks upstream search-based or sampling-based behavior planning on top of downstream local numerical trajectory optimization. In this thesis, we present (i) the S* algorithm, a novel geometric trajectory optimization method for autonomous ground vehicles in dynamic environments that uses apex interpolating Spiro splines to optimize orders of magnitude fewer variables than numerical optimization, and (ii) an anytime best-first multimodal variant of S* using a parallel optimistic branch-and-bound on homology classes. We demonstrate a preliminary implementation of this algorithm integrated into MIT Driverless’s autonomous racing stack on a full-size Roborace Devbot 2.0 racecar navigating mixed-reality obstacle courses at up to 100 mph.","abstract_html":"Non-heuristic multimodal trajectory optimization is widely considered an intractable holy grail for real-time robotic systems, with the existing state-of-the-art standing at a heuristic hierarchical approach that stacks upstream search-based or sampling-based behavior planning on top of downstream local numerical trajectory optimization. In this thesis, we present (i) the S* algorithm, a novel geometric trajectory optimization method for autonomous ground vehicles in dynamic environments that uses apex interpolating Spiro splines to optimize orders of magnitude fewer variables than numerical optimization, and (ii) an anytime best-first multimodal variant of S* using a parallel optimistic branch-and-bound on homology classes. We demonstrate a preliminary implementation of this algorithm integrated into MIT Driverless’s autonomous racing stack on a full-size Roborace Devbot 2.0 racecar navigating mixed-reality obstacle courses at up to 100 mph.","abstract_has_math":false,"creators":["Chang, Christopher W."],"institution":"Massachusetts Institute of Technology","degree_name":"Master","degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science","school":null,"contributors":[],"advisors":["Rus, Daniela"],"committee_chairs":[],"committee_members":[],"year":2022,"date_issued":"2022-09","date_published":"2022-09","updated_at":"2026-07-22T22:22:30Z","subjects":[],"languages":[],"rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"rights_urls":["http://rightsstatements.org/page/InC-EDU/1.0/"],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1721.1/147490","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Rus, Daniela"]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Chang, Christopher W."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2023-01-19T19:53:53Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2023-01-19T19:53:53Z"]},{"key":"dc:date.issued","label":"Date","values":["2022-09"]},{"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":["Master","Master of Engineering in Electrical Engineering and Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["In Copyright - Educational Use Permitted","Copyright MIT"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/page/InC-EDU/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1721.1/147490"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Non-heuristic multimodal trajectory optimization is widely considered an intractable holy grail for real-time robotic systems, with the existing state-of-the-art standing at a heuristic hierarchical approach that stacks upstream search-based or sampling-based behavior planning on top of downstream local numerical trajectory optimization. In this thesis, we present (i) the S* algorithm, a novel geometric trajectory optimization method for autonomous ground vehicles in dynamic environments that uses apex interpolating Spiro splines to optimize orders of magnitude fewer variables than numerical optimization, and (ii) an anytime best-first multimodal variant of S* using a parallel optimistic branch-and-bound on homology classes. We demonstrate a preliminary implementation of this algorithm integrated into MIT Driverless’s autonomous racing stack on a full-size Roborace Devbot 2.0 racecar navigating mixed-reality obstacle courses at up to 100 mph."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["S*: Geometric Multimodal Trajectory Optimization via Apex Interpolating Spiro Splines"]}]}],"canonical_facts":{"dc:contributor.advisor":["Rus, Daniela"],"dc:contributor.department":["Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science"],"dc:creator":["Chang, Christopher W."],"dc:date.accessioned":["2023-01-19T19:53:53Z"],"dc:date.available":["2023-01-19T19:53:53Z"],"dc:date.issued":["2022-09"],"dc:description.abstract":["Non-heuristic multimodal trajectory optimization is widely considered an intractable holy grail for real-time robotic systems, with the existing state-of-the-art standing at a heuristic hierarchical approach that stacks upstream search-based or sampling-based behavior planning on top of downstream local numerical trajectory optimization. In this thesis, we present (i) the S* algorithm, a novel geometric trajectory optimization method for autonomous ground vehicles in dynamic environments that uses apex interpolating Spiro splines to optimize orders of magnitude fewer variables than numerical optimization, and (ii) an anytime best-first multimodal variant of S* using a parallel optimistic branch-and-bound on homology classes. We demonstrate a preliminary implementation of this algorithm integrated into MIT Driverless’s autonomous racing stack on a full-size Roborace Devbot 2.0 racecar navigating mixed-reality obstacle courses at up to 100 mph."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["https://hdl.handle.net/1721.1/147490"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["In Copyright - Educational Use Permitted","Copyright MIT"],"dc:rights.uri":["http://rightsstatements.org/page/InC-EDU/1.0/"],"dc:title":["S*: Geometric Multimodal Trajectory Optimization via Apex Interpolating Spiro Splines"],"dc:type":["Thesis"],"thesis:degree_name":["Master","Master of Engineering in Electrical Engineering and Computer Science"]},"updated_at":"2026-07-22T22:22:30Z"}