Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/53648
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electronic and Information Engineering | - |
dc.creator | Ganganath, N | - |
dc.creator | Cheng, CT | - |
dc.creator | Tse, CK | - |
dc.date.accessioned | 2016-06-27T01:50:56Z | - |
dc.date.available | 2016-06-27T01:50:56Z | - |
dc.identifier.isbn | 978-1-4673-9199-3 | - |
dc.identifier.uri | http://hdl.handle.net/10397/53648 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | en_US |
dc.rights | The following publication Ganganath, N., Cheng, C. -., & Tse, C. K. (2015). An improved dynamic Z∗ algorithm for rapid replanning of energy-efficient paths. Paper presented at the Proceedings - 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2015, 395-398 is available at 10.1109/CyberC.2015.52 | en_US |
dc.subject | Mobile robot | en_US |
dc.subject | Path planning | en_US |
dc.subject | Replanning | en_US |
dc.subject | Energy-efficient | en_US |
dc.subject | Uneven terrain | en_US |
dc.title | An improved Dynamic Z* algorithm for rapid replanning of energy-efficient paths | en_US |
dc.type | Conference Paper | en_US |
dc.identifier.spage | 395 | - |
dc.identifier.epage | 398 | - |
dc.identifier.doi | 10.1109/CyberC.2015.52 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | 2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Xi'an, China, 17-19 Sept. 2015, p. 395-398 | - |
dcterms.issued | 2015 | - |
dc.identifier.isi | WOS:000380437200071 | - |
dc.relation.conference | International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery [CyberC] | - |
dc.identifier.rosgroupid | 2015002750 | - |
dc.description.ros | 2015-2016 > Academic research: refereed > Refereed conference paper | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a0020-n03 | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Conference Paper |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Ganganath_Improved_Dynamic_Z.pdf | Pre-published version | 1.57 MB | Adobe PDF | View/Open |
Page views
135
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
133
Citations as of Apr 21, 2024
SCOPUSTM
Citations
5
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
5
Last Week
0
0
Last month
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.