返回Google圖書搜尋

Comparison of heuristics for terrain guarding

出版	Faculty of Electrical Engineering and Computer Science, Laboratory for geometrical modelling and multimedia algorithms, 2006
URL	http://books.google.com.hk/books?id=cUwJOQAACAAJ&hl=&source=gbs_api

註釋Guarding polyhedral terrains is a well known problem. It has a wide area of applications and many problems have been identified - problems with only one guard and more complex problems with many guards. Many of them represent NP-hard problems and since 1986 when first solution for terrain guarding was proposed, several heuristics have been developed. Extensive set of heuristics was published in different sources and consequently a realistic comparison between them (which is better and which worse) is missing. ln this contribution we present the results of comprehensive testing of terrain guarding. Basic terrain guarding problem called watch lower problem is considered and the problem of guarding where number of guards is upward limited. To the authors' knowledge, all known heuristics are used, and comparison is done on actual terrain surfaces. The most important result of this contribution is showing that long lasting belief that the best results can be obtained by greedy add heuristics is wrong. Better results can be obtained by our new heuristic called improved greedy add and i-technique.