Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/53655
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Electronic and Information Engineering-
dc.creatorGanganath, N-
dc.creatorCheng, CT-
dc.date.accessioned2016-06-27T02:28:14Z-
dc.date.available2016-06-27T02:28:14Z-
dc.identifier.urihttp://hdl.handle.net/10397/53655-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2013 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. -. (2013). A 2-dimensional ACO-based path planner for off-line robot path planning. Paper presented at the Proceedings - 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2013, 302-307 is available at 10.1109/CyberC.2013.59en_US
dc.subjectACOen_US
dc.subjectB-splineen_US
dc.subjectPath planningen_US
dc.subjectResources managementen_US
dc.subjectWireless sensor networksen_US
dc.titleA 2-dimensional ACO-based path planner for off-line robot path planningen_US
dc.typeConference Paperen_US
dc.identifier.spage302-
dc.identifier.epage307-
dc.identifier.doi10.1109/CyberC.2013.59-
dcterms.abstractWireless sensor networks are usually deployed in scenarios that are too hostile for human personnel to perform maintenance tasks. Wireless sensor nodes usually exchange information in a multi-hop manner. Connectivity is crucial to the performance of a wireless sensor network. In case a network is partitioned due to node failures, it is possible to re-connect the fragments by setting up bridges using mobile platforms. Given the landscape of a terrain, the mobile platforms should be able reach the target position using a desirable path. In this paper, an off-line robot path planner is proposed to find desirable paths between arbitrary points in a given terrain. The proposed path planner is based on ACO algorithms. Unlike ordinary ACO algorithms, the proposed path planner provides its artificial ants with extra flexibility in making routing decisions. Simulation results show that such enhancement can greatly improve the qualities of the paths obtained. Performances of the proposed path planner can be further optimized by fine-tuning its parameters.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), Beijing, China, 10-12 Oct. 2013, p. 302-307-
dcterms.issued2013-
dc.relation.conferenceInternational Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery [CyberC]-
dc.identifier.rosgroupidr71062-
dc.description.ros2013-2014 > Academic research: refereed > Refereed conference paper-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0020-n15en_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Ganganath_2-dimensional_ACO-based_Robot.pdfPre-published version495.65 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

225
Last Week
1
Last month
Citations as of Apr 21, 2024

Downloads

173
Citations as of Apr 21, 2024

SCOPUSTM   
Citations

12
Last Week
0
Last month
Citations as of Apr 19, 2024

WEB OF SCIENCETM
Citations

11
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.