This article addresses simultaneous localization and mapping (SLAM) via probability hypothesis density (PHD) filtering. The resulting approach, named PHD-SLAM, has demonstrated its effectiveness, especially when measurements provided by the sensors onboard the vehicle are highly contaminated by missdetections and clutter. However, since the proposal distribution (PD) of standard PHD-SLAM does not take into account most recently received measurements, a huge amount of particles are typically needed in order to achieve satisfactory performance. In this article, a new PD, which aims to approximate the vehicle pose posterior, is proposed for PHD-SLAM. The resulting algorithm, named PHD-SLAM 2.0, allows for drastically reducing the number of particles, and hence, the computational burden, while preserving the SLAM performance. The computational complexity of PHD-SLAM 2.0 is analyzed, and its performance is assessed via both simulated and real-data experiments.

PHD-SLAM 2.0: efficient SLAM in the presence of missdetections and clutter / Gao L.; Battistelli G.; Chisci L.. - In: IEEE TRANSACTIONS ON ROBOTICS. - ISSN 1552-3098. - STAMPA. - 37:(2021), pp. 1834-1843. [10.1109/TRO.2021.3052078]

PHD-SLAM 2.0: efficient SLAM in the presence of missdetections and clutter

Gao L.;Battistelli G.;Chisci L.
2021

Abstract

This article addresses simultaneous localization and mapping (SLAM) via probability hypothesis density (PHD) filtering. The resulting approach, named PHD-SLAM, has demonstrated its effectiveness, especially when measurements provided by the sensors onboard the vehicle are highly contaminated by missdetections and clutter. However, since the proposal distribution (PD) of standard PHD-SLAM does not take into account most recently received measurements, a huge amount of particles are typically needed in order to achieve satisfactory performance. In this article, a new PD, which aims to approximate the vehicle pose posterior, is proposed for PHD-SLAM. The resulting algorithm, named PHD-SLAM 2.0, allows for drastically reducing the number of particles, and hence, the computational burden, while preserving the SLAM performance. The computational complexity of PHD-SLAM 2.0 is analyzed, and its performance is assessed via both simulated and real-data experiments.
2021
37
1834
1843
Gao L.; Battistelli G.; Chisci L.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1232269
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 10
social impact