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

作者:

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

收录:

CPCI-S

摘要:

In accordance with the problem which ingle target path planning is difficult to simulate the complex real world, this paper presents a new multi-goal path planning method based on grid map for planetary exploration, which designs and realizes the corresponding branch-detected algorithm and heuristic algorithm to solve the local optimal path planning and TSP, eventually reach the target state. The theoretical proof and simulation results show that this algorithm can successfully solve path planning with multi-goal and with a good performance at the same time.

关键词:

Branch-Detected Multi-Goals Path Planning TSP

作者机构:

  • [ 1 ] [Liu Hongyun]Beijing Univ Technol, Beijing 100124, Peoples R China
  • [ 2 ] [Jiang Xiao]Beijing Univ Technol, Beijing 100124, Peoples R China
  • [ 3 ] [Ju Hehua]Beijing Univ Technol, Beijing 100124, Peoples R China

通讯作者信息:

  • [Liu Hongyun]Beijing Univ Technol, Beijing 100124, Peoples R China

电子邮件地址:

查看成果更多字段

相关关键词:

相关文章:

来源 :

2013 25TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC)

ISSN: 1948-9439

年份: 2013

页码: 2872-2876

语种: 英文

被引次数:

WoS核心集被引频次: 7

SCOPUS被引频次:

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

万方被引频次:

中文被引频次:

近30日浏览量: 2

归属院系:

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