Efficient Connectivity Maintenance For Distributed Robotic Systems

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.

Name thesis:degree_name

Master

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2022

Author dc:creator

• Singhal, Nikhil M.

Advisor dc:contributor.advisor

• Rus, Daniela L.

Statement dc:rights

• In Copyright - Educational Use Permitted
• Copyright MIT

Licence dc:rights.uri

• http://rightsstatements.org/page/InC-EDU/1.0/

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/144488

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/144488