计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (31): 57-60.DOI: 10.3778/j.issn.1002-8331.2010.31.016

• 研究、探讨 • 上一篇    下一篇

基于混沌序列的最大和分散式协调算法

耿蕾蕾1,2,蔚承建1   

  1. 1.南京工业大学 信息工程与科学学院,南京 210009
    2.南京理工大学 计算机科学与技术学院,南京 210094
  • 收稿日期:2009-04-10 修回日期:2009-06-15 出版日期:2010-11-01 发布日期:2010-11-01
  • 通讯作者: 耿蕾蕾

Max-sum decentralised coordination algorithm based on chaos

GENG Lei-lei1,2,WEI Cheng-jian1   

  1. 1.College of Information Science and Engineering,Nanjing University of Technology,Nanjing 210009,China
    2.College of Computer Science and Technology,Nanjing University of Science and Technology,Nanjing 210094,China
  • Received:2009-04-10 Revised:2009-06-15 Online:2010-11-01 Published:2010-11-01
  • Contact: GENG Lei-lei

摘要: 大规模信息系统的协调问题正成为新兴的研究热点,最大和协调算法显示了在该领域的应用前景,然而其收敛速度和鲁棒性有待进一步提高。针对以上问题,提出一种可用于合作系统中的基于混沌的分散式信息传递算法,并通过图形着色问题验证了该算法的有效性。在该算法中,利用混沌序列丰富的时空动态性,产生最大和协调算法的结点信息。然后依据更新规则对结点信息进行交互,完成算法的迭代。通过与传统最大和协调算法和遗传算法的对比实验结果分析,该算法在收敛速度及鲁棒性方面有着更好的表现。

关键词: 分散式协调, 因子图, 变量结点, 函数结点, 混沌序列

Abstract: Coordination problems of large scale information system gradually become a hot spot,and the max-sum product algorithm shows a bright future of applications with improvements of the convergence speed and the robustness.This paper presents a decentralized message passing algorithm based on chaotic sequence which can be used in cooperative systems and is operated in a canonical coordination problem(graph coloring) performing decentralized coordination.The space-time dynamic messages of factor node are generated using chaotic sequence.Compared to max-sum product algorithm,the solution shows the better performance in both convergence speed and robustness.

Key words: decentralized coordination, factor graph, variable nodes, function nodes, chaotic sequence

中图分类号: