We consider a mobile robot localising itself through a set of UWB wireless anchors. We show how the use of an appropriate localisation algorithm allows for an analytical estimate of the localisation uncertainty. This information is used to build a potential-based motion planning algorithm that drives the robot along trajectories, while achieving a good tradeoff between moving toward the goal and keeping localisation uncertainty reasonably low.
Ruling uncertainties in Range-only Robot Localisation / Shamsfakhr, Farhad; Palopoli, Luigi; Macii, David; Fontanelli, Daniele. - ELETTRONICO. - 2021-:(2021), pp. 1-6. (Intervento presentato al convegno 2021 IEEE International Instrumentation and Measurement Technology Conference, I2MTC 2021 tenutosi a ONLINE - Technology and Innovation Centre (TIC), Glasgow, GBR nel 17th-20th May 2021) [10.1109/I2MTC50364.2021.9459813].
Ruling uncertainties in Range-only Robot Localisation
Shamsfakhr, Farhad;Palopoli, Luigi;Macii, David;Fontanelli, Daniele
2021-01-01
Abstract
We consider a mobile robot localising itself through a set of UWB wireless anchors. We show how the use of an appropriate localisation algorithm allows for an analytical estimate of the localisation uncertainty. This information is used to build a potential-based motion planning algorithm that drives the robot along trajectories, while achieving a good tradeoff between moving toward the goal and keeping localisation uncertainty reasonably low.File | Dimensione | Formato | |
---|---|---|---|
SLAMwithRanging.pdf
accesso aperto
Tipologia:
Post-print referato (Refereed author’s manuscript)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.59 MB
Formato
Adobe PDF
|
1.59 MB | Adobe PDF | Visualizza/Apri |
Ruling_uncertainties_in_Range-only_Robot_Localisation.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
2.03 MB
Formato
Adobe PDF
|
2.03 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione