Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/53648
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorGanganath, N-
dc.creatorCheng, CT-
dc.creatorTse, CK-
dc.date.accessioned2016-06-27T01:50:56Z-
dc.date.available2016-06-27T01:50:56Z-
dc.identifier.isbn978-1-4673-9199-3-
dc.identifier.urihttp://hdl.handle.net/10397/53648-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_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.rightsThe 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.52en_US
dc.subjectMobile roboten_US
dc.subjectPath planningen_US
dc.subjectReplanningen_US
dc.subjectEnergy-efficienten_US
dc.subjectUneven terrainen_US
dc.titleAn improved Dynamic Z* algorithm for rapid replanning of energy-efficient pathsen_US
dc.typeConference Paperen_US
dc.identifier.spage395-
dc.identifier.epage398-
dc.identifier.doi10.1109/CyberC.2015.52-
dcterms.abstractRecently 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.accessRightsopen accessen_US
dcterms.bibliographicCitation2015 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Xi'an, China, 17-19 Sept. 2015, p. 395-398-
dcterms.issued2015-
dc.identifier.isiWOS:000380437200071-
dc.relation.conferenceInternational Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery [CyberC]-
dc.identifier.rosgroupid2015002750-
dc.description.ros2015-2016 > Academic research: refereed > Refereed conference paper-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0020-n03en_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Ganganath_Improved_Dynamic_Z.pdfPre-published version1.57 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

135
Last Week
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
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.