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.

Efficient Connectivity Maintenance For Distributed Robotic Systems

Author(s)
Singhal, Nikhil M.
Thumbnail
DownloadThesis PDF (5.061Mb)
Advisor
Rus, Daniela L.
Terms of use
In Copyright - Educational Use Permitted Copyright MIT http://rightsstatements.org/page/InC-EDU/1.0/
Metadata
Show full item record
Abstract
Teams of multiple autonomous robots have the potential to improve upon many robotic tasks performed by individuals. As these robots move about, they must maintain connectivity through direct links or multi-hop paths in order to exchange useful information for the completion of collaborative tasks and avoid duplicating work. In this thesis, we survey the field to identify an optimally versatile connectivity maintenance algorithm supporting arbitrary tasks. To this end, we implement, modify, and optimize several connectivity maintenance algorithms from the literature and evaluate their performance on tasks such as trajectory following and multi-agent search. Finally we leverage these results to discuss the trade-offs between these algorithms for use cases with different priorities.
Date issued
2022-05
URI
https://hdl.handle.net/1721.1/144488
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.