Research and improvement on optimal path analysis algorithm based on cost-distance grid

Xin Zhang, Guofeng Cao, Lili Zhang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The optimal path analysis based on cost distance grid is another common path analysis method besides the network path analysis. How to improve the efficiency of generating cost distance grid is a major difficulty in this method and how to reduce the repeated calculation and comparison is the key challenge in improving the efficiency. Based on "Node/Link" model, this paper adopts the Dijkstra algorithm idea, and extends it to multiple source optimal path finding, presents an algorithm of only calculating the source cell's neighboring cells which influence the calculation of working accumulative cost distance. Besides, some optimized storage and sorting techniques are also introduced.

Original languageEnglish
Title of host publication2006 IEEE International Geoscience and Remote Sensing Symposium, IGARSS
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages860-862
Number of pages3
ISBN (Print)0780395107, 9780780395107
DOIs
StatePublished - 2006
Event2006 IEEE International Geoscience and Remote Sensing Symposium, IGARSS - Denver, CO, United States
Duration: Jul 31 2006Aug 4 2006

Publication series

NameInternational Geoscience and Remote Sensing Symposium (IGARSS)

Conference

Conference2006 IEEE International Geoscience and Remote Sensing Symposium, IGARSS
CountryUnited States
CityDenver, CO
Period07/31/0608/4/06

Keywords

  • Accumulative cost distance
  • Cost-distance grid
  • Direction grid
  • Optimal path Analysis

Fingerprint Dive into the research topics of 'Research and improvement on optimal path analysis algorithm based on cost-distance grid'. Together they form a unique fingerprint.

Cite this