This paper presents a Linear Least-Squares approach to estimate the pose of a mobile robot based on passive Radio Frequency Identification (RFID) technology at the Ultra-High Frequency (UHF) band. The mobile robot leverages the received signal power to obtain ranging data from a set of reference landmark RFID tags. Then, an optimisation algorithm merges RFID and odometry data to reconstruct the entire robot trajectory. The proposed method does not require precise placement of the landmarks and it is therefore fast and easy to deploy. Both numerical and experimental analysis are presented.
RFID-based robot localisation: an unconstrained optimisation problem by exploiting RSSI / Shamsfakhr, F; Macii, D; Fontanelli, D; Motroni, A; Nepa, P; Palopoli, L; Buffi, A. - (2022), pp. 1-6. (Intervento presentato al convegno 2022 IEEE International Instrumentation and Measurement Technology Conference, I2MTC 2022 tenutosi a Ottawa, Canada nel 16-19 May 2022) [10.1109/I2MTC48687.2022.9806604].
RFID-based robot localisation: an unconstrained optimisation problem by exploiting RSSI
Shamsfakhr, F;Macii, D;Fontanelli, D;Palopoli, L;
2022-01-01
Abstract
This paper presents a Linear Least-Squares approach to estimate the pose of a mobile robot based on passive Radio Frequency Identification (RFID) technology at the Ultra-High Frequency (UHF) band. The mobile robot leverages the received signal power to obtain ranging data from a set of reference landmark RFID tags. Then, an optimisation algorithm merges RFID and odometry data to reconstruct the entire robot trajectory. The proposed method does not require precise placement of the landmarks and it is therefore fast and easy to deploy. Both numerical and experimental analysis are presented.File | Dimensione | Formato | |
---|---|---|---|
main.pdf
Solo gestori archivio
Tipologia:
Post-print referato (Refereed author’s manuscript)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
960.16 kB
Formato
Adobe PDF
|
960.16 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione