MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

An Application of Graph of Convex Sets Trajectory Optimization to the Marine Robotics Domain

Author(s)
Largaespada, Raul Alexander
Thumbnail
DownloadThesis PDF (25.56Mb)
Advisor
Leonard, John J.
Bennett, Andrew
Terms of use
In Copyright - Educational Use Permitted Copyright retained by author(s) https://rightsstatements.org/page/InC-EDU/1.0/
Metadata
Show full item record
Abstract
Autonomous unmanned surface vehicles (USVs) and unmanned underwater vehicles (UUVs) are becoming ubiquitous in applications exploring marine environments, and the design of path planning algorithms for these vehicles remains an open area of research. For marine environments, to save on energy a path between two points should be optimized to minimize distance traveled while remaining smooth to reduce changes in speed and account for the dynamic limits of the vehicle. The Graphs of Convex Sets (GCS) trajectory optimization motion planner from the MIT Robot Locomotion Group is a recently developed planner which has been demonstrated to return smooth and optimal paths navigating around complex environments filled with obstacles, but this planner has not been applied to marine environments. The early successes of the GCS planner and the smoothness of the trajectories returned suggest that GCS could be effectively applied to USV and UUV path planning. This project implemented the GCS planner as part of the MOOS-IvP so software suite for autonomous marine robotics. The robustness of the trajectories returned from GCS was evaluated via Monte Carlo trials on a simulated USV traversing a field of randomized known and unknown obstacles. The performance of GCS was compared against alternate planners implementing the D* Lite algorithm or relying only on existing MOOS-IvP obstacle avoidance capabilities, running the the same simulation environment. In testing, the GCS planner was not as successful as the D* Lite planner in navigating dense obstacle fields, but returned smoother and shorter paths than D* Lite which were easier for the vehicle to follow. Testing also suggested future modifications to the GCS planner which could be added to further increase its robustness when applied to USVs operating in dense obstacle fields. All code developed for this project may be found at: https://github.com/rlargaespada/moos-ivp-monte-carlo.
Date issued
2023-09
URI
https://hdl.handle.net/1721.1/152742
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.