This work investigates the problem of distributed estimation of the position of agents in a networked system, from pairwise distance measurements between them. Although the underlying geometrical problem has been studied quite extensively, most of the state-of-the-art algorithms for network localization presuppose a central unit, capable of collecting agents' measurements and retrieving the configuration of the whole network. Here, we explore decentralized, or distributed, approaches for range localization, and we develop two algorithms in which distributed optimization techniques are applied for localization, namely a distributed gradient method with Barzilai-Borwein stepsizes and a distributed Gauss-Newton approach. The advantage of these approaches is that each agent may autonomously compute its position estimate, exchanging information only with its neighbors, without need of communicating with a central station and without needing complete knowledge of the network structure. The proposed algorithms are proved to converge, under an hypothesis of network connectivity, to the same solution of their centralized counterparts.

Distributed optimization techniques for range localization in networked systems / Calafiore, Giuseppe Carlo; Carlone, Luca; Wei, Mingzhu. - STAMPA. - (2010), pp. 2221-2226. ((Intervento presentato al convegno the 49th IEEE Conference on Decision and Control tenutosi a Atlanta (USA) nel December 15-17, 2010 [10.1109/CDC.2010.5717645].

Distributed optimization techniques for range localization in networked systems

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

Abstract

This work investigates the problem of distributed estimation of the position of agents in a networked system, from pairwise distance measurements between them. Although the underlying geometrical problem has been studied quite extensively, most of the state-of-the-art algorithms for network localization presuppose a central unit, capable of collecting agents' measurements and retrieving the configuration of the whole network. Here, we explore decentralized, or distributed, approaches for range localization, and we develop two algorithms in which distributed optimization techniques are applied for localization, namely a distributed gradient method with Barzilai-Borwein stepsizes and a distributed Gauss-Newton approach. The advantage of these approaches is that each agent may autonomously compute its position estimate, exchanging information only with its neighbors, without need of communicating with a central station and without needing complete knowledge of the network structure. The proposed algorithms are proved to converge, under an hypothesis of network connectivity, to the same solution of their centralized counterparts.
9781424477456
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/2380872
 Attenzione

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