Show simple item record

dc.contributor.advisorEytan Modiano and Sertac Karaman.en_US
dc.contributor.authorTalak, Rajat(Rajat R.)en_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Aeronautics and Astronautics.en_US
dc.date.accessioned2021-01-06T18:32:02Z
dc.date.available2021-01-06T18:32:02Z
dc.date.copyright2020en_US
dc.date.issued2020en_US
dc.identifier.urihttps://hdl.handle.net/1721.1/129160
dc.descriptionThesis: Ph. D., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, September, 2020en_US
dc.descriptionCataloged from student-submitted PDF of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 249-261).en_US
dc.description.abstractNetworked autonomy deals with problems in which several autonomous agents interact via a communication network to cooperatively perform intelligent tasks. Networked autonomous systems operate in a constantly changing, real-world environment and thus have to constantly apprise themselves of the changing state of the world and other autonomous agents in the network. The autonomous agents have to do this by consistently exchanging information via the communication network. The first part of this thesis deals with the problems of optimizing information freshness in wireless communication networks formed by autonomous agents. We argue why Age-of-Information is a good metric for information freshness, show how it fundamentally differs from a traditional latency metric of packet delay, and devise several policies to minimize Age-of-Information in wireless communication networks. We consider single-hop as well as multi-hop communication networks.en_US
dc.description.abstractWe provide theoretical guarantees on the performance of the proposed policies. The autonomous systems also have to estimate their locations and construct a map of their shared environment. The estimated map and locations must be robust to outliers and model parameters, hardware failures, unknown system dynamics for a fail-safe, long-term operation of the networked system. In the second part of the thesis, we propose a new theory of uncertainty variables which provides a mathematical framework for performing set-estimation over complex graphical models. An uncertainty variable is characterized by an uncertainty set, in which its realization is bound to lie, while the conditional uncertainty is characterized by a set map. We prove Bayes' law and the law of total probability equivalents for uncertainty variables. We then develop notions of independence, conditional independence, and graphical models over a collection of uncertainty variables.en_US
dc.description.abstractWe propose belief propagation algorithms with provable performance guarantees for set-estimation, which can be used for localization, mapping, high-level perception and planning in networked autonomous systems.en_US
dc.description.statementofresponsibilityby Rajat Talak.en_US
dc.format.extent261 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectAeronautics and Astronautics.en_US
dc.titleInformation exchange and robust learning algorithms for networked autonomyen_US
dc.typeThesisen_US
dc.description.degreePh. D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.identifier.oclc1227276801en_US
dc.description.collectionPh.D. Massachusetts Institute of Technology, Department of Aeronautics and Astronauticsen_US
dspace.imported2021-01-06T18:32:01Zen_US
mit.thesis.degreeDoctoralen_US
mit.thesis.departmentAeroen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record