Distributed data aggregation via networked transferable belief model over a graph

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2011, Pages 5730-5736

  Fiorini, Flavio ^a   Gasparri, Andrea ^a   Di Rocco, Maurizio ^a   Ulivi, Giovanni ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON KNOWLEDGE; DATA AGGREGATION PROBLEMS; DISTRIBUTED DATA; MULTI AGENT SYSTEM (MAS); NETWORK TOPOLOGY; THEORETICAL RESULT; THEORY OF EVIDENCE; TRANSFERABLE BELIEF MODEL;

ELECTRIC NETWORK TOPOLOGY; MULTI AGENT SYSTEMS; SENSOR NETWORKS;

ROBOTICS;

EID: 84871672300     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRA.2011.5979910     Document Type: Conference Paper

References (16)

1. A. Doucet, N. De Freitas, and N. Gordon, Sequential Monte Carlo methods in practice. Springer, 2001.
2. J. Schwertfeger and O. Jenkins, "Multi-robot belief propagation for distributed robot allocation," in Development and Learning, 2007. ICDL 2007. IEEE 6th International Conference on, july 2007, pp. 193-198.
3. 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, 2009.
4. G. Shafer, A Mathematical Theory of Evidence. Princeton: Princeton University Press, 1976.
5. P. Smets, "Information content of an evidence," Int. J. Man Machine Studies, vol. 19, pp. 33-43, 1983.
6. P. Smets and R. Kennes, "The transferable belief model," Artificial Intelligence, vol. 66, pp. 191-234, 1994.
7. Fast Algorithms for Dempster-Shafer Theory. London, UK: Springer-Verlag, 1991.
8. 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.
9. P. Smets, "The application of the transferable belief model to diagnostic problems," Int. J. Intelligent Systems, vol. 13, pp. 127-157, 1998.
10. 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.
11. M. Di Rocco, F. Flavio, A. Gasparri, and S. Panzieri, "A networked transferable belief model approach for distributed data aggregation-static version," in The 49th IEEE Conference on Decision and Control, CDC10, 2010.
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.