Show simple item record

dc.contributor.advisorSertac Karaman.en_US
dc.contributor.authorMiculescu, David.en_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Aeronautics and Astronautics.en_US
dc.date.accessioned2021-05-24T19:53:39Z
dc.date.available2021-05-24T19:53:39Z
dc.date.copyright2021en_US
dc.date.issued2021en_US
dc.identifier.urihttps://hdl.handle.net/1721.1/130744
dc.descriptionThesis: Ph. D., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, February, 2021en_US
dc.descriptionCataloged from the official PDF of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 145-158).en_US
dc.description.abstractRapid development and deployment of large-scale swarms of robotic agents motivates the need for computationally-efficient algorithms for monitoring the state of the swarm. This dissertation is concerned with the state estimation of swarms via tensor methods, specifically the Tensor-Train (TT) decomposition. Existing nonlinear filtering algorithms for swarms, such as particle-based methods, suffer from particle degeneracy when scaling to larger swarms and higher dimensional state-spaces. Tensor-based methods such as the TT decomposition have the potential to alleviate the curse of dimensionality via computationally-efficient multi-linear algebra methods in "low-rank" problem instances. Our first contribution is a class of algorithms allowing for the efficient reconstruction of the state of agents in a swarm in a Bayesian manner. Specifically, we consider swarms under the standard multi-target tracking model, i.e., independent agents with identical dynamics.en_US
dc.description.abstractWe demonstrate that the traditional Probability Hypothesis Density (PHD) filter can be efficiently implemented in the TT format for problems settings in which the relevant parameters have efficient TT approximations. We then generalize our TT-based algorithms to swarm problems with interacting agents via the Gas-kinetic (GK) PHD filter. Specifically, we demonstrate that the GK-PHD filter may be efficiently implemented via the TT format. We analyze the convergence and computational complexity of our TT-based algorithms. Our second contribution is a class of efficiently implemented controllers for a team of mobile sensors performing swarm state estimation guided by an information-theoretic objective. Specifically, certain costly quantities arising from the traditional binary measurement model for sensors is implemented efficiently in the TT format. We analyze the convergence and computational complexity of our TT-based implementations.en_US
dc.description.abstractFurthermore, we propose a novel controller based on a tertiary sensor model and describe its efficient implementation in the TT format.en_US
dc.description.statementofresponsibilityby David Miculescu.en_US
dc.format.extent158 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.titleTensor-train-based algorithms for swarm state estimation with a team of mobile sensorsen_US
dc.typeThesisen_US
dc.description.degreePh. D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Aeronautics and Astronauticsen_US
dc.identifier.oclc1251896673en_US
dc.description.collectionPh.D. Massachusetts Institute of Technology, Department of Aeronautics and Astronauticsen_US
dspace.imported2021-05-24T19:53:39Zen_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