• 综合
  • 标题
  • 关键词
  • 摘要
  • 学者
  • 期刊-刊名
  • 期刊-ISSN
  • 会议名称
搜索

作者:

Hongyun, Liu (Hongyun, Liu.) | Xiao, Jiang (Xiao, Jiang.) | Hehua, Ju (Hehua, Ju.)

收录:

EI Scopus

摘要:

It is a difficult task to fulfill a path planning with realistic significance when aiming at a single target point in such complex real-world. This paper proposes a new kind of multi-objective path planning method based on the grid map for planetary exploration. An improved D*lite algorithm is presented to solve the local optimal path planning based on the extraction and rasterization of Digital Elevation Model (DEM) graph. Especially, a heuristic algorithm is adopted to ensure the convergence of the algorithm, and the theoretical proof is given. Traveling Salesman Problem (TSP) is demonstrated to verify the proposed method. Both the theoretical proof and simulation results show that this proposed algorithm is feasible, to solve planning with multi-goals problem successfully and with a good performance at the same time. © 2013 by CESER publications.

关键词:

Heuristic algorithms Interplanetary spacecraft Motion planning Traveling salesman problem

作者机构:

  • [ 1 ] [Hongyun, Liu]Beijing University of Technology, No.100, Pingleyuan, Chaoyang District, Beijing, China
  • [ 2 ] [Xiao, Jiang]Beijing University of Technology, No.100, Pingleyuan, Chaoyang District, Beijing, China
  • [ 3 ] [Hehua, Ju]Beijing University of Technology, No.100, Pingleyuan, Chaoyang District, Beijing, China

通讯作者信息:

电子邮件地址:

查看成果更多字段

相关关键词:

相关文章:

来源 :

International Journal of Applied Mathematics and Statistics

ISSN: 0973-1377

年份: 2013

期: 12

卷: 42

页码: 430-440

被引次数:

WoS核心集被引频次: 0

SCOPUS被引频次:

ESI高被引论文在榜: 0 展开所有

万方被引频次:

中文被引频次:

近30日浏览量: 3

归属院系:

在线人数/总访问数:1325/2904189
地址:北京工业大学图书馆(北京市朝阳区平乐园100号 邮编:100124) 联系我们:010-67392185
版权所有:北京工业大学图书馆 站点建设与维护:北京爱琴海乐之技术有限公司