Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/64536
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.accessioned2017-03-03T03:45:25Z-
dc.date.available2017-03-03T03:45:25Z-
dc.identifier.urihttp://hdl.handle.net/10397/64536-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2016 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 N. Ganganath, C. T. Cheng and C. K. Tse, "Rapidly Replanning A*," 2016 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Chengdu, China, 2016, pp. 386-389 is available at http://dx.doi.org/10.1109/CyberC.2016.81en_US
dc.subjectHeuristic searchen_US
dc.subjectA*en_US
dc.subjectRRA*en_US
dc.subjectPath planningen_US
dc.subjectReplanningen_US
dc.subjectIncremental searchen_US
dc.titleRapidly replanning A*en_US
dc.typeConference Paperen_US
dc.identifier.spage386-
dc.identifier.epage389-
dc.identifier.doi10.1109/CyberC.2016.81-
dcterms.abstractIn this paper, Rapidly Replanning A* (RRA*) algorithm is proposed for path planning and replanning in partially unknown environments. RRA* uses an effective mechanism to reuse previous search results, which considerably accelerates its replanning process compared to repetitive replanning from scratch. RRA* guarantees to find an optimal path from the current location of an agent to its target location based on the available information. Simulation results verify the optimality of the path generated by RRA* and the superior efficiency of RRA* in path replanning.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation2016 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Chengdu, China, 13-15 Oct 2016, p. 386-389-
dcterms.issued2016-
dc.identifier.ros2016005631-
dc.relation.conferenceInternational Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery [CyberC]-
dc.identifier.rosgroupid2016005380-
dc.description.ros2016-2017 > Academic research: refereed > Refereed conference paper-
dc.description.validate201804_a bcma-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0057-n02en_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Ganganath_Rapiding_Replanning_A.pdfPre-published version778.55 kBAdobe 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

104
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

103
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

8
Last Week
1
Last month
Citations as of Mar 29, 2024

WEB OF SCIENCETM
Citations

5
Last Week
0
Last month
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.