Evidence map›Paper›PMID 37346718›Full record

ArticlePeerJ. Computer science2023

A robust cooperative localization algorithm based on covariance intersection method for multi-robot systems.

Miao Wang, Qingshan Liu

Abstract read
In one paragraph

Article in PeerJ. Computer science, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Miao WangSchool of Cyber Science and Engineering, Southeast University, Nanjing, China.
Qingshan LiuPurple Mountain Laboratories, Nanjing, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Cooperative localization is an arising research problem for multi-robot system, especially for the scenarios that need to reduce the communication load of base stations. This article proposes a novel cooperative localization algorithm, which can achieve high accuracy localization by using the relative measurements among robots. To address uncertainty in the measuring robots' positions and avoid linearization errors in the extended Kalman filter during the measurement update phase, a particle-based approximation method is proposed. The covariance intersection method is then employed to fuse preliminary estimations from different robots, guaranteeing a minimum upper bound for the fused covariance. Moreover, in order to avoid the negative effect of abnormal measurements, this article adopts the Kullback-Leibler divergence to calculate the distances between different estimations and rejects to fuse the preliminary estimations far from the estimation obtained in the prediction stage. Two simulations are conducted to validate the proposed algorithm. Compared with the other three algorithms, the proposed algorithm can achieve higher localization accuracy and deal with the abnormal measurement.

Indexed as

Cooperative localizationCovariance intersectionKullback–Leibler divergenceMulti-robot systemRobust localization

Identifiers

PMID37346718
PMCPMC10280389

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.