{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:52:15Z","timestamp":1725709935127},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1109\/case48305.2020.9216988","type":"proceedings-article","created":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T20:01:51Z","timestamp":1602187311000},"page":"365-371","source":"Crossref","is-referenced-by-count":1,"title":["Miniature Robot Path Planning for Bridge Inspection: Min-Max Cycle Cover-Based Approach"],"prefix":"10.1109","author":[{"given":"Michael","family":"Lin","sequence":"first","affiliation":[]},{"given":"Richard J.","family":"La","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2015.01.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e88-a.5.1335"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.06.012"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00202-1_18"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2010.02.004"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.09.014"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"ref16"},{"journal-title":"Miniature robot path planning for bridge inspection Min-max cycle-based approach","year":"2020","author":"lin","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1022677261"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9740-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2005.01.007"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.2295609"},{"journal-title":"Approximation algorithms for some min-max vehicle routing problems","year":"2013","author":"jorati","key":"ref5"},{"journal-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","year":"1976","author":"christofides","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.01.041"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.11.010"},{"year":"0","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1976.6"}],"event":{"name":"2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)","start":{"date-parts":[[2020,8,20]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2020,8,21]]}},"container-title":["2020 IEEE 16th International Conference on Automation Science and Engineering (CASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9210430\/9216730\/09216988.pdf?arnumber=9216988","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T15:45:45Z","timestamp":1656344745000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9216988\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/case48305.2020.9216988","relation":{},"subject":[],"published":{"date-parts":[[2020,8]]}}}