An Improved Dynamic Z Algorithm for Rapid Replanning of Energy-Efficient Paths

Nuwan Ganganath*, Chi-Tsun Cheng, Chi K. Tse

*Corresponding author for this work

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

5 Citations (Scopus)

Abstract

Recently proposed Dynamic Z heuristic search algorithm enables mobile robots navigating on uneven terrains to replan energy-efficient paths using previous search results whenever an obstacle is encountered. This paper proposes some vital improvements to Dynamic Z by optimizing the use of previous search results in replanning. Simulation results show that the proposed improvements can significantly reduce the computational cost of replanning in Dynamic Z while producing equally energy-efficient paths.
Original languageEnglish
Title of host publicationProceedings - 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC 2015)
PublisherIEEE
Pages395-398
ISBN (Electronic)978-1-4673-9200-6
DOIs
Publication statusPublished - Sept 2015
Externally publishedYes
Event7th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015 - Xi'an, China
Duration: 17 Sept 201519 Sept 2015

Publication series

NameProceedings - 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015

Conference

Conference7th International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015
Country/TerritoryChina
CityXi'an
Period17/09/1519/09/15

Research Keywords

  • energy-efficient
  • Mobile robot
  • path planning
  • replanning
  • Uneven terrain

Fingerprint

Dive into the research topics of 'An Improved Dynamic Z Algorithm for Rapid Replanning of Energy-Efficient Paths'. Together they form a unique fingerprint.

Cite this