中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
a multi-objective evolutionary algorithm for minimal visual coverage path problem in raster terrain
Author: Li Jie ; Zheng Chang Wen ; Hu Xiaohui
Keyword: Landforms ; Mathematical operators ; Multiobjective optimization ; Simulated annealing
Source: ICIC Express Letters
Issued Date: 2011
Volume: 5, Issue:7, Pages:2299-2304
Indexed Type: EI
Department: (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
Abstract: 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.
English Abstract: 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.
Language: 英语
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/16010
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
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-01-01,5(7):2299-2304.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Li Jie]'s Articles
[Zheng Chang Wen]'s Articles
[Hu Xiaohui]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Li Jie]‘s Articles
[Zheng Chang Wen]‘s Articles
[Hu Xiaohui]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace