中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
a multi-objective evolutionary algorithm for shortest path with maximal visual coverage

文献类型:会议论文

作者Zheng Changwen ; Yin Huafei ; Li Jie ; Lu Min
出版日期2011
会议名称2011 IEEE International conference on Intelligent Computation and Bio-Medical Instrumentation, ICBMI 2011
会议日期December 14, 2011 - December 17, 2011
会议地点Wuhan, Hubei, China
关键词Graph theory Motion planning Multiobjective optimization
页码232-235
中文摘要In this paper, the shortest path planning problem with maximal visual coverage in the raster terrain is studied with the proposal of a multi-objective evolutionary planner. By using a problem-specific representation of candidate solutions and genetic operators, our planner can handle the objectives of the visual coverage and the path length and find the non-dominated solutions efficiently. Utilizing an external archive, our algorithm may effectively obtain the approximate Pareto front with wide distribution to provide multiple candidates for decision-maker. © 2011 IEEE.
英文摘要In this paper, the shortest path planning problem with maximal visual coverage in the raster terrain is studied with the proposal of a multi-objective evolutionary planner. By using a problem-specific representation of candidate solutions and genetic operators, our planner can handle the objectives of the visual coverage and the path length and find the non-dominated solutions efficiently. Utilizing an external archive, our algorithm may effectively obtain the approximate Pareto front with wide distribution to provide multiple candidates for decision-maker. © 2011 IEEE.
收录类别EI
会议主办者IEEE Tainan Section; Huazhong University of Science and Technology; National Cheng Kung University
会议录Proceedings - 2011 International Conference on Intelligent Computation and Bio-Medical Instrumentation, ICBMI 2011
语种英语
ISBN号9780769546230
源URL[http://ir.iscas.ac.cn/handle/311060/16285]  
专题软件研究所_软件所图书馆_会议论文
推荐引用方式
GB/T 7714
Zheng Changwen,Yin Huafei,Li Jie,et al. a multi-objective evolutionary algorithm for shortest path with maximal visual coverage[C]. 见:2011 IEEE International conference on Intelligent Computation and Bio-Medical Instrumentation, ICBMI 2011. Wuhan, Hubei, China. December 14, 2011 - December 17, 2011.

入库方式: OAI收割

来源:软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。