A networked transferable belief model approach for distributed data aggregation - Static version

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2010, Pages 1229-1236

  Fiorini, Flavio ^a   Gasparri, Andrea ^a   Di Rocco, Maurizio ^a   Panzieri, Stefano ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL ENGINEERING;

BASIC BELIEF ASSIGNMENT; COMMON KNOWLEDGE; DATA AGGREGATION PROBLEMS; DISTRIBUTED DATA; STATIC SCENARIOS; TRANSFERABLE BELIEF MODEL;

MULTI AGENT SYSTEMS;

EID: 79953128550     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2010.5717223     Document Type: Conference Paper

References (16)

1. M. R. Ghahroudi and R. Sabzevari, Sensor and Data Fusion, N. Milisavljevic, Ed., 2009.
2. A. Doucet, N. De Freitas, and N. Gordon, Sequential Monte Carlo methods in practice. Springer, 2001.
3. J. Schwertfeger and O. Jenkins, "Multi-robot belief propagation for distributed robot allocation," in IEEE 6th International Conference on Development and Learning, 2007., 2007, pp. 193-198.
4. J. Schiff, E. Sudderth, and K. Goldberg, "Nonparametric belief propagation for distributed tracking of robot networks with noisy interdistance measurements," in Intelligent Robots and Systems, 2009. IROS 2009. IEEE/RSJ International Conference on, oct. 2009, pp. 1369-1376.
5. G. Shafer, A Mathematical Theory of Evidence. Princeton: Princeton University Press, 1976.
6. P. Smets, "Information content of an evidence," Int. J. Man Machine Studies, vol. 19, pp. 33-43, 1983.
7. P. Smets and R. Kennes, "The transferable belief model," Artificial Intelligence, vol. 66, pp. 191-234, 1994.
8. Fast Algorithms for Dempster-Shafer Theory. London, UK: Springer-Verlag, 1991.
9. Y. Denoeux, "Approximating the combination of belief functions using the fast moebius transform in a coarsened frame," International Journal of Approximate Reasoning, vol. 31, no. 1-2, pp. 77-101, 2002.
10. P. Smets, "The application of the transferable belief model to diagnostic problems," Int. J. Intelligent Systems, vol. 13, pp. 127-157, 1998.
11. F. Delmotte and P. Smets, "Target identification based on the transferable belief model interpretation of Dempster-Shafer model." IEEE Transactions on Systems, Man and Cybernetics, vol. A 34, pp. 457-471, 2004.
12. L. A. Zadeh, "On the validity of dempster rule of combination," in In Memo M 79/24. Univ. of California, Berkeley, 1979.
13. P. Smets, "The combination of evidence in the transferable belief model," IEEE Trans. Pattern Anal. Mach. Intell., vol. 12, no. 5, pp. 447-458, 1990.
14. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE/ACM Trans. Netw., vol. 14, pp. 2508-2530, 2006.
15. K. Johansen, U. Jørgensen, S. Nielsen, S. Nielsen, and S. Skyum, "A distributed spanning tree algorithm," Distributed Algorithms, pp. 1-12, 1988. [Online]. Available: http://dx.doi.org/10.1007/BFb0019790
16. Y. Dalal, "A distributed algorithm for constructing minimal spanning trees," Software Engineering, IEEE Transactions on, vol. SE-13, no. 3, pp. 398-405, March 1987.