In this paper, an adaptive sensor selection architecture is developed to deal with distributed state estimation problems for multi-agent networked systems consisting of three different classes of nodes (plants, sensors and agents). Specifically, the problem of adequately fusing the sensors data coming from the plants and delivered to the agents, is addressed by evaluating their trustworthiness. This is achieved by exploiting a well-established approach in the power electronics: the PerturbObserve algorithm that in the present framework allows one to select the more adequate group of sensors so as to compute at each time instant the best state estimate according to a given performance index. Some simulations are finally reported to testify the effectiveness of the proposed methodology.

Sensors Selection via a Distributed Reputation Mechanism: An Information Fusion Approach

Casavola A.;Franze G.
;
Tedesco F.
2021-01-01

Abstract

In this paper, an adaptive sensor selection architecture is developed to deal with distributed state estimation problems for multi-agent networked systems consisting of three different classes of nodes (plants, sensors and agents). Specifically, the problem of adequately fusing the sensors data coming from the plants and delivered to the agents, is addressed by evaluating their trustworthiness. This is achieved by exploiting a well-established approach in the power electronics: the PerturbObserve algorithm that in the present framework allows one to select the more adequate group of sensors so as to compute at each time instant the best state estimate according to a given performance index. Some simulations are finally reported to testify the effectiveness of the proposed methodology.
2021
978-1-7281-2989-1
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.

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

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

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact