{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:34:53Z","timestamp":1760488493362},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/tase.2011.2123888","type":"journal-article","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T19:08:49Z","timestamp":1303931329000},"page":"654-659","source":"Crossref","is-referenced-by-count":6,"title":["Some Complexity Results for Metric View Planning Problem With Traveling Cost and Visibility Range"],"prefix":"10.1109","volume":"8","author":[{"family":"Pengpeng Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Krishnamurti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1241874"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21708-5"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00138-007-0110-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/641865.641868"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00451-7"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1006\/cviu.1995.1007"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2003.817031"},{"key":"ref3","author":"borodin","year":"1998","journal-title":"Online Computation and Competitive Analysis"},{"key":"ref6","author":"christofides","year":"1976","journal-title":"Worst-case analysis of a new heuristic for the travelling salesman problem"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574671"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844726"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1642097"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646145"},{"key":"ref9","first-page":"350","article-title":"Online searching with an autonomous robot","author":"fekete","year":"2004","journal-title":"Proc Workshop on Algorithmic Foundation of Robotics"},{"key":"ref20","author":"vazirani","year":"2001","journal-title":"Approximation Algorithms"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363070"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8856\/5937311\/05730510.pdf?arnumber=5730510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:51:12Z","timestamp":1633909872000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5730510\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":21,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tase.2011.2123888","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}