关键词: 分散式协调, 和积算法, 因子图, 混沌序列, 效用值表

Abstract: Coordination problems of large scale information system gradually become a hot spot, and the maxsum product algorithm shows a bright application future but with improvement of the convergence speed and the robustness. In this paper a decentralized message passing algorithm based on chaotic sequence was presented which can be used in cooperative systems and was operated in a canonical coordination problem (graph coloring ) performing decentralized coordination. The spacetime dynamic messages of factor node were generated using chaotic sequence and updated following optimized utilitymap and simple rules. Compared to maxsum product algorithm, the solution resolves computational bottleneck and shows a better performance in both convergence speed and robustness.

Key words: decentralized coordination, sum-product algorithm, factor graph, chaotic sequence, utility-map