In this paper a novel algorithm for the decentralized estimation of the network centroid for a multi-agent system deployed in a d-dimensional space is presented. It is assumed that the agents are static, do not share a common coordinate system and are only able to estimate relative distance and angle of sight with respect to themselves during pairwise asynchronous communications. It is shown that if the graph representing the network topology is rigid, then the proposed algorithm solves the network centroid estimation problem.
Decentralized Centroid Estimation for Multi-Agent Systems in Absence of a Common Reference Frame: A Convergence Analysis
FRANCESCHELLI, MAURO;
2012-01-01
Abstract
In this paper a novel algorithm for the decentralized estimation of the network centroid for a multi-agent system deployed in a d-dimensional space is presented. It is assumed that the agents are static, do not share a common coordinate system and are only able to estimate relative distance and angle of sight with respect to themselves during pairwise asynchronous communications. It is shown that if the graph representing the network topology is rigid, then the proposed algorithm solves the network centroid estimation problem.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
