{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:12:24Z","timestamp":1729627944537,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1109\/robot.2009.5152532","type":"proceedings-article","created":{"date-parts":[[2009,7,1]],"date-time":"2009-07-01T14:16:05Z","timestamp":1246457765000},"page":"2461-2466","source":"Crossref","is-referenced-by-count":0,"title":["Surveillance of a polygonal area by a mobile searcher from the boundary: Searchability testing"],"prefix":"10.1109","author":[{"given":"B.","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"T.","family":"Kameda","sequence":"additional","affiliation":[]},{"given":"J.Z.","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/160985.161163"},{"key":"14","article-title":"searching a circular corridor by two boundary 1-searchers","author":"kameda","year":"2007","journal-title":"Proc Kyoto Int'l Conf on Computational Geometry and Graph Theory"},{"key":"11","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/3-540-44634-6_40","article-title":"optimal algorithms for two-guard walkability of simple polygons","author":"bhattacharya","year":"2001","journal-title":"Proc 7th Int'l Workshop on Algorithms and Data Structures"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840360"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30540-8_22"},{"key":"2","article-title":"a characterization of the class of polygons searchable by a 1-searcher","author":"park","year":"2000","journal-title":"Korea Advanced Institute of Science and Technology Tech Rep CS\/TR-2000-160"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1137\/0221051"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(00)00024-9"},{"key":"7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1142\/S021819590200075X","article-title":"an algorithm for searching a polygonal region with a flashlight","volume":"12","author":"lavalle","year":"2002","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.870640"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195999000273"},{"key":"4","first-page":"113","article-title":"simple characterization of polygons searchable by 1-searcher","author":"kameda","year":"2006","journal-title":"Proc 18th Canadian Conf on Computational Geometry"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00042-9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195992000160"}],"event":{"name":"2009 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2009,5,12]]},"location":"Kobe","end":{"date-parts":[[2009,5,17]]}},"container-title":["2009 IEEE International Conference on Robotics and Automation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5076472\/5152175\/05152532.pdf?arnumber=5152532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:16:24Z","timestamp":1558401384000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5152532\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/robot.2009.5152532","relation":{},"subject":[],"published":{"date-parts":[[2009,5]]}}}