|
|
|
|
LEADER |
01575 am a22001693u 4500 |
001 |
137298 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Miculescu, David
|e author
|
700 |
1 |
0 |
|a Karaman, Sertac
|e author
|
245 |
0 |
0 |
|a Tensor-Train-based Algorithms for Aggregate State Estimation of Swarms with Interacting Agents
|
260 |
|
|
|b IEEE,
|c 2021-11-03T18:31:30Z.
|
856 |
|
|
|z Get fulltext
|u https://hdl.handle.net/1721.1/137298
|
520 |
|
|
|a © 2020 AACC. In this paper, we develop an efficient implementation of the gas-kinetic (GK) Probability Hypothesis Density (PHD) filter for aggregate swarm state estimation with interacting agents. We borrow a kinetic/mesoscopic partial differential equation (PDE) model of a swarm of interacting agents from biology moving in a plane with a heading state, which requires the computation of integrals up to five dimensions. In the context of the GK-PHD, we propagate this model by computing in a compressed format called the Tensor Train (TT) format, yielding better memory and runtime properties than a grid-based approach. Under certain assumptions, we prove that TT-GK-PHD has a time complexity of an order of magnitude better than the grid-based approach. Finally, we showcase the usefulness of our algorithm on a scenario which cannot be solved via the grid-based approach due to hardware memory constraints. Then in a computational experiment we demonstrate the better runtime and memory of TT-GK-PHD over the grid-based approach.
|
546 |
|
|
|a en
|
655 |
7 |
|
|a Article
|
773 |
|
|
|t 10.23919/acc45564.2020.9147339
|
773 |
|
|
|t Proceedings of the American Control Conference
|