{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:57:18Z","timestamp":1777499838294,"version":"3.51.4"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Department of Electronic and Information Engineering at the Hong Kong Polytechnic University","award":["G-UB45"],"award-info":[{"award-number":["G-UB45"]}]},{"name":"Hong Kong Ph.D. Fellowship Scheme"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Ind. Inf."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/tii.2015.2413355","type":"journal-article","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T14:57:26Z","timestamp":1426517846000},"page":"601-611","source":"Crossref","is-referenced-by-count":81,"title":["A Constraint-Aware Heuristic Path Planner for Finding Energy-Efficient Paths on Uneven Terrains"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7381-9493","authenticated-orcid":false,"given":"Nuwan","family":"Ganganath","sequence":"first","affiliation":[]},{"given":"Chi-Tsun","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Chi K.","family":"Tse","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-014-9390-3"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980374"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MECATRONICS.2014.7018555"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/URAI.2012.6462928"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21459"},{"key":"ref37","article-title":"An analysis of ground mobility models (ANAMOB)","author":"rula","year":"1971"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1038\/ngeo1593"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1038\/ngeo1450"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1038\/ngeo737"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2013.2252076"},{"key":"ref40","first-page":"305","article-title":"Complexity analysis of admissible heuristic search","author":"korf","year":"0","journal-title":"Proc AAAI\/IAAI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2039379"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICIT.2010.5472755"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICIT.2010.5472742"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IECON.2010.5675447"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IECON.2011.6119311"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CyberC.2013.59"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2301442"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2014.120282"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2014.2307972"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2004.837232"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INDIN.2010.5549692"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48523-6_49"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2013.2294180"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2188901"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INDIN.2011.6034885"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2198665"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2011.2160510"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2014.6865316"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2003.820849"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2013.2293706"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2013.2264095"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2013.2272275"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2012.2185013"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1986.1087445"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2012.2223591"},{"key":"ref41","year":"2011","journal-title":"Seekur"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1177\/027836499401300503"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/70.62043"}],"container-title":["IEEE Transactions on Industrial Informatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9424\/7116638\/07061469.pdf?arnumber=7061469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:44:56Z","timestamp":1641987896000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7061469\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":41,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tii.2015.2413355","relation":{},"ISSN":["1551-3203","1941-0050"],"issn-type":[{"value":"1551-3203","type":"print"},{"value":"1941-0050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6]]}}}