.png){kind=icon}
.png){kind=icon}
Return
Cooperative Localization Based on Efficient Covariance Intersection
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2019.2907936.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This work proposes a geometric covariance intersection (CI)-based algorithm for efficiently solving the decentralized cooperative localization (CL) problem with multiple TOA measurements. Unlike existing algorithms that only process one measurement at a time, our proposed algorithm processes multiple measurements in a batch style, which improves the precision performance by considering the correlation among these measurements. An efficient way to get the optimal solution is given in our algorithm, which reduces the computational complexity to O(N logN). Furthermore, the sparsity of the optimal solution is proved, which enables a heuristic state buffering approach to reduce the usage of ranging link resources and improve measurement efficiency. The simulation results show that our algorithm outperforms the conventional methods.
Keywords:
Cooperative localization
covariance intersection
decentralized algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W