a multi-objective evolutionary algorithm for minimal visual coverage path problem in raster terrain

ISCAS OpenIR

	a multi-objective evolutionary algorithm for minimal visual coverage path problem in raster terrain
	Li Jie; Zheng Chang Wen; Hu Xiaohui
	2011
发表期刊	ICIC Express Letters
ISSN	1881-803X
卷号	5 期号:7 页码:2299-2304
摘要	Minimal visual coverage path problem has wide applications, such as selecting the marching route and searching the smuggler's path. Average horizon of a path, which is the ratio of its visual coverage to its length, can be used to measure how covert a path is. If there are loops in a path, the path is meaningless though its average horizon is small due to its infinite length. A compromise is to modify the objective of minimal average horizon as the ratio of the length to the invisible region of the path where minimal length and minimal view shed can be satisfied simultaneously. However, the modified objective is not completely equivalent with average horizon. This study treats two elements of average horizon as two objectives and presents a multi-objective evolutionary algorithm for the minimal path visual coverage problem with single objective. By multiobjectivizating as well as the proper chromosome structure and effective operators, the method presented is superior to the simulated annealing algorithm and the evolutionary algorithm for single objective with respect to both higher quality of the solution and less computation time.; Minimal visual coverage path problem has wide applications, such as selecting the marching route and searching the smuggler's path. Average horizon of a path, which is the ratio of its visual coverage to its length, can be used to measure how covert a path is. If there are loops in a path, the path is meaningless though its average horizon is small due to its infinite length. A compromise is to modify the objective of minimal average horizon as the ratio of the length to the invisible region of the path where minimal length and minimal view shed can be satisfied simultaneously. However, the modified objective is not completely equivalent with average horizon. This study treats two elements of average horizon as two objectives and presents a multi-objective evolutionary algorithm for the minimal path visual coverage problem with single objective. By multiobjectivizating as well as the proper chromosome structure and effective operators, the method presented is superior to the simulated annealing algorithm and the evolutionary algorithm for single objective with respect to both higher quality of the solution and less computation time.
收录类别	EI
关键词	Landforms Mathematical Operators Multiobjective Optimization Simulated Annealing
部门归属	(1) Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei 230026 China; (2) National Key Laboratory of Integrated Information System Technology Institute of Software Chinese Academy of Sciences Beijing 100190 China
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16010
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Li Jie,Zheng Chang Wen,Hu Xiaohui. a multi-objective evolutionary algorithm for minimal visual coverage path problem in raster terrain[J]. ICIC Express Letters,2011,5(7):2299-2304.
APA	Li Jie,Zheng Chang Wen,&Hu Xiaohui.(2011).a multi-objective evolutionary algorithm for minimal visual coverage path problem in raster terrain.ICIC Express Letters,5(7),2299-2304.
MLA	Li Jie,et al."a multi-objective evolutionary algorithm for minimal visual coverage path problem in raster terrain".ICIC Express Letters 5.7(2011):2299-2304.