{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:51:37Z","timestamp":1772772697518,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["CZ.02.1.01\/0.0\/0.0\/15_003\/0000470"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/15_003\/0000470"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Agency of the Czech Technical University","award":["SGS21\/185\/OHK3\/3T\/37"],"award-info":[{"award-number":["SGS21\/185\/OHK3\/3T\/37"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1109\/lra.2022.3159824","type":"journal-article","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T19:37:06Z","timestamp":1647459426000},"page":"5934-5941","source":"Crossref","is-referenced-by-count":6,"title":["Towards a Continuous Solution of the $d$-Visibility Watchman Route Problem in a Polygon With Holes"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3404-8742","authenticated-orcid":false,"given":"Jan","family":"Mikula","sequence":"first","affiliation":[{"name":"Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Karlovo namesti 13, Czech Republic"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0997-5889","authenticated-orcid":false,"given":"Miroslav","family":"Kulich","sequence":"additional","affiliation":[{"name":"Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Czech Republic"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10518"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90014-J"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2012.02.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2005.861455"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2070518"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.05.055"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90008-6"},{"key":"ref9","first-page":"97","article-title":"Generalized traveling salesman problem through n sets of nodes","volume":"7","author":"Srivastava","year":"1969","journal-title":"CORS J."},{"key":"ref10","first-page":"175","article-title":"Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons","volume-title":"Proc. 22nd Annu. Can. Conf. Comput. Geometry","author":"Pan","year":"2010"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574671"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009467"},{"key":"ref13","first-page":"253","article-title":"Approximating a shortest watchman route","volume":"45","author":"Nilsson","year":"2001","journal-title":"Fundamenta Informaticae"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.021"},{"key":"ref15","article-title":"A linear-time algorithm for orthogonal watchman route problem with minimum bends","author":"Hoorfar","year":"2017"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2013.11.008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.11.011"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.60"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844726"},{"key":"ref20","article-title":"Planning robot motions for range-image acquisition and automatic 3D model construction","volume-title":"Proc. AAAI Fall Symp. Ser., Integr. Planning Auton. Agent Architectures","author":"Gonzalez-Banos","year":"1998"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF00337288"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.09.004"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v12i1.18557"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00047-5"},{"key":"ref25","first-page":"1","article-title":"Fast approximation of the maximum area convex subset for star-shaped polygons","volume":"1","author":"Coeurjolly","year":"2004","journal-title":"CNRS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780612"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.05.010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/IRDS.2002.1041701"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780612"},{"key":"ref30","article-title":"An extension of the Lin-Kernighan-Helsgaun TSP solver for constrained traveling salesman and vehicle routing problems","author":"Helsgaun","year":"2017"},{"key":"ref31","first-page":"1","article-title":"Efficient computation of visibility polygons","volume-title":"Proc. Eur. Workshop Comput. Geometry","author":"Bungiu","year":"2014"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014497"},{"key":"ref33","article-title":"Clipper-an open source freeware library for clipping and offsetting lines and polygons","author":"Johnson"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/73393.73410"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9750005\/09736678.pdf?arnumber=9736678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:41:23Z","timestamp":1705538483000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9736678\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":34,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2022.3159824","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7]]}}}