Computational intelligence for the collaborative identification of distributed systems

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, on the basis of a rigorous mathematical formulation, a new algorithm for the identification of distributed systems by large scale collaborative sensor networks is suggested. The algorithm extends a KLT-based identification approach to a decentralized setting, using the distributed Karhunen-Loéve transform (DKLT) recently proposed by Gastpar et al.. The proposed approach permits an arbitrarily accurate identification since it exploits both the asymptotic properties of convergence of DKLT and the universal approximation capabilities of radial basis functions neural networks. The effectiveness of the proposed approach is directly related to the reduction of total distortion in the compression performed by the single nodes of the sensor network, to the identification accuracy, as well as to the low computational complexity of the fusion algorithm performed by the fusion center to regulate the intelligent cooperation of the nodes. Some identification experiments, that have been carried out on systems whose behavior is described by partial differential equations in 2-D domainswith random excitations, confirm the validity of this approach. It is worth noting the generality of the algorithm that can be applied in a wide range of applications without limitations on the type of physical phenomena, boundary conditions, sensor network used, and number of its nodes. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Biagetti, G., Crippa, P., Gianfelici, F., & Turchetti, C. (2009). Computational intelligence for the collaborative identification of distributed systems. Intelligent Systems Reference Library, 1(1), 475–500. https://doi.org/10.1007/978-3-642-01799-5_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free