{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:12:55Z","timestamp":1740175975179,"version":"3.37.3"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1734419","IIS-1845888"],"award-info":[{"award-number":["IIS-1734419","IIS-1845888"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1109\/lra.2019.2961302","type":"journal-article","created":{"date-parts":[[2019,12,24]],"date-time":"2019-12-24T04:51:11Z","timestamp":1577163071000},"page":"430-437","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Perimeter Guarding With Heterogeneous Robot Teams: Complexity Analysis and Effective Algorithms"],"prefix":"10.1109","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5778-7057","authenticated-orcid":false,"given":"Si Wei","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4112-2250","authenticated-orcid":false,"given":"Jingjin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321909"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.4.538"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0204035"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/70.795787"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2003.812781"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2004.824698"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.846556"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152815"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/TAC.2011.2158172","article-title":"Rendezvous without coordinates","volume":"57","author":"yu","year":"2012","journal-title":"IEEE Trans Autom Control"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1177\/0278364916632065"},{"key":"ref17","volume":"57","author":"o\u2019rourke","year":"1987","journal-title":"Art Gallery Theorems and Algorithms"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/5.163407"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/359156.359164"},{"article-title":"Two NP-complete problems in nonnegative integer programming","year":"1975","author":"lueker","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543489"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2002.806024"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2062070"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/opre.5.2.266"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2026926"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7354037"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913515307"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.21236\/ADA196213"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2015.XI.011"},{"key":"ref1","article-title":"Efficient algorithms for optimal perimeter guarding","author":"feng","year":"0","journal-title":"Proc Robot Sci Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057165"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2005.162.1065"},{"key":"ref21","first-page":"3","volume":"1","author":"thue","year":"1910","journal-title":"&#x00DC;ber Die Dichteste Zusammenstellung von Kongruenten Kreisen in Einer Ebene"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2009.5152809"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6"},{"article-title":"Near-optimal bin packing algorithms","year":"1973","author":"johnson","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1177\/0278364916688103"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7083369\/8932682\/8938724-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/8932682\/08938724.pdf?arnumber=8938724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:32:49Z","timestamp":1651080769000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8938724\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":33,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2019.2961302","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}