Simulated Annealing Algorithm for Global Optimal Translation Sequence in Rough Communication
粗交流整体最优传递序列的模拟退火算法

In rough communication,because each agent has a different language and can not provide precise communication to each other,the concept translated among multi-agents will loss some information,and this results in a less or rougher concept.With different translation sequences the amount of the missed knowledge is varied.In order to get the translation sequence,in which every agent taking part in rough communication gets maximum information,simulated annealing algorithm is used.Analysis and simulation of the algorithm demonstrate the effectiveness of the approach.