{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T07:44:17Z","timestamp":1783410257661,"version":"3.54.6"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Hong Kong ITC ITSP Tier2","award":["ITS\/105\/18FP"],"award-info":[{"award-number":["ITS\/105\/18FP"]}]},{"name":"Hong Kong ITC MRP","award":["MRP\/011\/18"],"award-info":[{"award-number":["MRP\/011\/18"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Syst. Man Cybern, Syst."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1109\/tsmc.2020.3048984","type":"journal-article","created":{"date-parts":[[2021,2,25]],"date-time":"2021-02-25T19:10:07Z","timestamp":1614280207000},"page":"2174-2183","source":"Crossref","is-referenced-by-count":24,"title":["Real-Time Decision Making and Path Planning for Robotic Autonomous Luggage Trolley Collection at Airports"],"prefix":"10.1109","volume":"52","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9139-0291","authenticated-orcid":false,"given":"Jiankun","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5255-5898","authenticated-orcid":false,"given":"Max Q.-H.","family":"Meng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2017.8122814"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1990.126006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942562"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/321043.321046"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.robot.2016.04.003","article-title":"Data transferring model determination in robotic group","volume":"83","author":"sergiyenko","year":"2016","journal-title":"Robot Auton Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICEC.1997.592327"},{"key":"ref11","author":"bullnheimer","year":"1997","journal-title":"A New Rank-Based Version of the Ant System A Computational Study"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321847"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2602385"},{"key":"ref15","volume":"12","author":"gutin","year":"2006","journal-title":"The Traveling Salesman Problem and Its Variations"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2019.2962425"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2500027"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2808471"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1401132.1401206"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2987397"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.690"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2010.5530777"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2017.2691140"},{"key":"ref6","first-page":"185","volume":"2570","author":"woeginger","year":"2003","journal-title":"Exact Algorithms for NP-Hard Problems A Survey"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2822013.2822036"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48213-4_1"},{"key":"ref8","article-title":"Optimization, learning and natural algorithms","author":"dorigo","year":"1992"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.1999.782657"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2014.2363632"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2660547"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2008.2012116"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/02783640122067453"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2020.2976560"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IRDS.2002.1041624"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980479"}],"container-title":["IEEE Transactions on Systems, Man, and Cybernetics: Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221021\/9736423\/09328172.pdf?arnumber=9328172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T21:13:03Z","timestamp":1650921183000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9328172\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":34,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tsmc.2020.3048984","relation":{},"ISSN":["2168-2216","2168-2232"],"issn-type":[{"value":"2168-2216","type":"print"},{"value":"2168-2232","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}