• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

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

Indexed by:

EI Scopus

Abstract:

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.

Keyword:

Heuristic algorithms Interplanetary spacecraft Motion planning Traveling salesman problem

Author Community:

  • [ 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

Reprint Author's Address:

Show more details

Related Keywords:

Related Article:

Source :

International Journal of Applied Mathematics and Statistics

ISSN: 0973-1377

Year: 2013

Issue: 12

Volume: 42

Page: 430-440

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 4

Affiliated Colleges:

Online/Total:1044/10533456
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.