Result Optimal Translation Sequence of a New Definition Form of Rough Communication

In rough communication, because each agent has 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. A new definition form of rough communication is introduced. In order to get the translation sequence, in which the last agent taking part in new-rough communication gets maximum information, simulated annealing algorithm is used. Analysis and simulation of the algorithm demonstrate the effectiveness of the approach.