We propose a distributed technique for estimating position of nodes in a networked system from pairwise distance measurements. The localization problem is firstly formulated as an unconstrained optimization problem and the well-known Gauss-Newton centralized approach for obtaining a local solution is reviewed. Then, a distributed Gauss-Newton approach is presented, which is proved to converge to the same solution as its centralized counterpart, under an hypothesis of network connectivity. Localization performance and computational effort of the described approach are evaluated through numerical examples. The distributed solution allows each agent to autonomously compute its position estimate, exchanging information only with its neighbors, without need of communicating with a central station. Furthermore, when the initial guess for optimization is shared among the nodes, each node may retrieve the whole network configuration (i.e., its own position and the positions of all the other nodes in the network), exploiting local measurements into a global representation.

A distributed Gauss-Newton approach for range-based localization of multi agent formations / Calafiore, Giuseppe Carlo; Carlone, Luca; Wei, Mingzhu. - STAMPA. - (2010), pp. 1152-1157. ((Intervento presentato al convegno The 2010 IEEE Multi-Conference on Systems and Control (MSC’10) tenutosi a Yokohama (Japan) nel September 8-10, 2010 [10.1109/CACSD.2010.5612770].

A distributed Gauss-Newton approach for range-based localization of multi agent formations

CALAFIORE, Giuseppe Carlo;CARLONE, LUCA;WEI, MINGZHU
2010

Abstract

We propose a distributed technique for estimating position of nodes in a networked system from pairwise distance measurements. The localization problem is firstly formulated as an unconstrained optimization problem and the well-known Gauss-Newton centralized approach for obtaining a local solution is reviewed. Then, a distributed Gauss-Newton approach is presented, which is proved to converge to the same solution as its centralized counterpart, under an hypothesis of network connectivity. Localization performance and computational effort of the described approach are evaluated through numerical examples. The distributed solution allows each agent to autonomously compute its position estimate, exchanging information only with its neighbors, without need of communicating with a central station. Furthermore, when the initial guess for optimization is shared among the nodes, each node may retrieve the whole network configuration (i.e., its own position and the positions of all the other nodes in the network), exploiting local measurements into a global representation.
9781424453542
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

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

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2381230
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo