| 基于平均视距的最优可视覆盖路径 |
| |
| 引用本文： | 鲁敏,张金芳,吕品,范植华. 基于平均视距的最优可视覆盖路径[J]. 计算机辅助设计与图形学学报, 2007, 19(9): 1159-1165 |
| |
| 作者姓名： | 鲁敏 张金芳 吕品 范植华 |
| |
| 作者单位： | 中国科学院软件研究所通用软件实验室,北京,100080;中国科学院研究生院,北京,100049;中国科学院软件研究所通用软件实验室,北京,100080 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 提出平均视距的概念来衡量路径可视覆盖的最优性,给出以最大平均视距为优化目标的最优可视覆盖路径问题的求解模型.通过预先计算并存储视域信息,采用基于视域融合的模拟退火算法实现了该问题的求解.
|
| 关 键 词： | 视域 平均视距 路径可视覆盖 视域融合 模拟退火 |
| 收稿时间： | 2006-10-25 |
| 修稿时间： | 2006-10-252007-06-21 |
Optimal Visual Coverage Path Based on Average Horizon |
| |
| Lu Min,Zhang Jinfang,Lu Pin,Fan Zhihua. Optimal Visual Coverage Path Based on Average Horizon[J]. Journal of Computer-Aided Design & Computer Graphics, 2007, 19(9): 1159-1165 |
| |
| Authors: | Lu Min Zhang Jinfang Lu Pin Fan Zhihua |
| |
| Affiliation: | 1.Laboratory of General Software, Institute of Software, Chinese Academy of Sciences, Beijing 100080; 2. Graduate University of Chinese Academy of Sciences, Beijing 100049 |
| |
| Abstract: | This paper proposes the concept of "average horizon" to evaluate the optimality of the path visual coverage. An optimization model aiming at maximizing "average horizon" is established. By pre-computing and storing viewshed information, the optimal visual coverage path problem is resolved using simulated annealing algorithm based on viewshed amalgamation. |
| |
| Keywords: | viewshed average horizon path visual coverage viewshed amalgamation simulated annealing |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
