{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T06:43:49Z","timestamp":1740120229478,"version":"3.37.3"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"13","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61702242"],"award-info":[{"award-number":["61702242"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Doctoral Scientific Research Foundation of Liaoning Province","award":["20170520207"],"award-info":[{"award-number":["20170520207"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2019,12,15]]},"abstract":"<jats:p> This paper studies a searching problem in an unknown street. A simple polygon [Formula: see text] with two distinguished vertices, [Formula: see text] and [Formula: see text], is called a street if the two boundary chains from [Formula: see text] to [Formula: see text] are mutually weakly visible. We use a mobile robot to locate [Formula: see text] starting from [Formula: see text]. Assume that the robot has a limited sensing capability that can only detect the constructed edges (also called gaps) on the boundary of its visible region, but cannot measure any angle or distance. The robot does not have knowledge of the street in advance. We present a new competitive strategy for this problem and prove that the length of the path generated by the robot is at most 9-times longer than the shortest path. We also propose a matching lower bound to show that our strategy is optimal. Compared with the previous strategy, we further relaxed the restriction that the robot should take a marking device and use the data structure S-GNT. The analysis of our strategy is tight. <\/jats:p>","DOI":"10.1142\/s0218001419590420","type":"journal-article","created":{"date-parts":[[2019,2,28]],"date-time":"2019-02-28T03:01:51Z","timestamp":1551322911000},"page":"1959042","source":"Crossref","is-referenced-by-count":1,"title":["Walking an Unknown Street with Limited Sensing"],"prefix":"10.1142","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0421-6979","authenticated-orcid":false,"given":"Qi","family":"Wei","sequence":"first","affiliation":[{"name":"School of Computer and Information Technology, Liaoning Normal University, South Liushu Street 1, Dalian 116081, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuehou","family":"Tan","sequence":"additional","affiliation":[{"name":"School of Information Science and Technology, Tokai University, 4-1-1 Kitakaname, Hiratsuka 259-1292, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonggong","family":"Ren","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Liaoning Normal University, South Liushu Street 1, Dalian 116081, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,12,17]]},"reference":[{"key":"S0218001419590420BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.01.013"},{"key":"S0218001419590420BIB002","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1054"},{"key":"S0218001419590420BIB003","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001417590182"},{"key":"S0218001419590420BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.011"},{"key":"S0218001419590420BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.11.017"},{"key":"S0218001419590420BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38016-7_6"},{"key":"S0218001419590420BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2010.05.001"},{"key":"S0218001419590420BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(97)00003-5"},{"key":"S0218001419590420BIB009","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702419352"},{"key":"S0218001419590420BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(92)90010-P"},{"key":"S0218001419590420BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36279-8_8"},{"key":"S0218001419590420BIB012","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001419500022"},{"key":"S0218001419590420BIB013","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"S0218001419590420BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9791-4"},{"key":"S0218001419590420BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1241638"},{"key":"S0218001419590420BIB016","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195998000060"},{"key":"S0218001419590420BIB017","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2016EDP7118"},{"key":"S0218001419590420BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001416590102"}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218001419590420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T03:00:31Z","timestamp":1576638031000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218001419590420"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,15]]},"references-count":18,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2019,12,15]]}},"alternative-id":["10.1142\/S0218001419590420"],"URL":"https:\/\/doi.org\/10.1142\/s0218001419590420","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"type":"print","value":"0218-0014"},{"type":"electronic","value":"1793-6381"}],"subject":[],"published":{"date-parts":[[2019,12,15]]}}}