Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/53652
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-27T02:07:12Z-
dc.date.available2016-06-27T02:07:12Z-
dc.identifier.urihttp://hdl.handle.net/10397/53652-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.rights© 2014 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. (2014). Finding energy-efficient paths on uneven terrains. Paper presented at the 10th France-Japan Congress, 8th Europe-Asia Congress on Mecatronics, MECATRONICS, 2014, 383-388 is available at 10.1109/MECATRONICS.2014.7018555en_US
dc.subjectMobile roboten_US
dc.subjectEnergy-efficienten_US
dc.subjectHeuristic searchen_US
dc.subjectPath planningen_US
dc.subjectUneven terrainen_US
dc.titleFinding energy-efficient paths on uneven terrainsen_US
dc.typeConference Paperen_US
dc.identifier.spage383-
dc.identifier.epage388-
dc.identifier.doi10.1109/MECATRONICS.2014.7018555-
dcterms.abstractMobile robots are increasingly getting popular in outdoor applications. Long period of continuous operations are common in such applications. Therefore, robot motions need to be optimized to minimize their energy consumption. Shortest paths do not always guarantee minimum energy consumptions of mobile robots. This paper proposes a novel algorithm to generate energy-efficient paths on uneven terrains using an established energycost model for mobile robots. Terrains are represented using grid based elevation maps. Similar to A* algorithm, the energy-cost of traversing through a particular gird depends on a heuristic energy-cost estimation from the current location to the goal. The proposed heuristic energy-cost function makes it possible to generate zigzag-like path patterns on steep hills under the power limitations of the robot. Therefore, the proposed method can find physically feasible energy-efficient paths on any given terrain, provided that such paths exist. Simulation results presented in this paper demonstrate the performance of the proposed algorithm on uneven terrains maps.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitation2014 10th France-Japan/8th Europe-Asia Congress on Mecatronics (MECATRONICS), Tokyo, Japan, 27-29 Nov. 2014, p. 383-388-
dcterms.issued2014-
dc.identifier.scopus2-s2.0-84923487369-
dc.relation.conferenceMECATRONICS-
dc.identifier.rosgroupid2014001364-
dc.description.ros2014-2015 > Academic research: refereed > Refereed conference paper-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumbera0020-n09en_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Ganganath_Finding_Energy-efficient_Paths.pdfPre-published version1.42 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

155
Last Week
0
Last month
Citations as of Apr 14, 2024

Downloads

243
Citations as of Apr 14, 2024

SCOPUSTM   
Citations

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

Google ScholarTM

Check

Altmetric


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