Cloud Theory Based Simulated Annealing Algorithm for Multiple Observers Sitting on Terrain Problem

  • Authors:
  • Pin Lv;Lin Yuan;Jinfang Zhang

  • Affiliations:
  • National Key Laboratory of Integrated Information System Technology, Institute of Software, Chinese Academy of Sciences, Beijing, 100190 and Graduate University, Chinese Academy of Sciences, Beiji ...;National Key Laboratory of Integrated Information System Technology, Institute of Software, Chinese Academy of Sciences, Beijing, 100190 and Graduate University, Chinese Academy of Sciences, Beiji ...;National Key Laboratory of Integrated Information System Technology, Institute of Software, Chinese Academy of Sciences, Beijing, 100190

  • Venue:
  • ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of Multiple Observers Sitting on Terrain (MOST) is an important part in visibility-based terrain reasoning and many applications can be classified as this problem. Recent developments in this field concentrate on using heuristic algorithm, such as Simulated Annealing algorithm (SA), but it is still difficult because of unacceptable computing time and low solving precision. In this paper, a Cloud theory based Simulated Annealing algorithm (CSA) is introduced involving two innovations. The first is state changing by using X cloud generator which can make the position selection of observer controllable. The second is temperature annealing by using Y cloud generator which can produce approximatively continuous annealing temperature and fit the physical annealing process in nature much better. Theoretical analysis proves that CSA is convergent for MOST problem. Application experiments show that, using CSA for MOST problem, the average time cost decreases by 40%~60% and the average solution accuracy improves by 10% as compared with using SA.