{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T11:34:51Z","timestamp":1765280091799,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030253318"},{"type":"electronic","value":"9783030253325"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25332-5_16","type":"book-chapter","created":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T08:13:27Z","timestamp":1563264807000},"page":"179-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Watchman Routes for Robot Inspection"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[]},{"given":"Zhuowei","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,17]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-78157-8_15","volume-title":"Robot Vision","author":"F Li","year":"2008","unstructured":"Li, F., Klette, R.: An approximate algorithm for solving the watchman route problem. In: Sommer, G., Klette, R. (eds.) RobVis 2008. LNCS, vol. 4931, pp. 189\u2013206. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-78157-8_15"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V Chv\u00c3\u00a1tal","year":"1975","unstructured":"Chv\u00c3\u00a1tal, V.: A combinatorial theorem in plane geometry. J. Comb. Theory Ser. B 18(1), 39\u201341 (1975)","journal-title":"J. Comb. Theory Ser. B"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-319-64107-2_12","volume-title":"Towards Autonomous Robotic Systems","author":"S Edelkamp","year":"2017","unstructured":"Edelkamp, S., Secim, B.C., Plaku, E.: Surface inspection via hitting sets and multi-goal motion planning. In: Gao, Y., Fallah, S., Jin, Y., Lekakou, C. (eds.) TAROS 2017. LNCS (LNAI), vol. 10454, pp. 134\u2013149. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-64107-2_12"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Gath, M., Cazenave, T., Teytaud, F.: Algorithm and knowledge engineering for the TSPTW problem. In: 2013 IEEE Symposium on Computational Intelligence in Scheduling (CISched), Singapore, pp. 44\u201351 (2013)","DOI":"10.1109\/SCIS.2013.6613251"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/B978-044482537-7\/50020-6","volume-title":"Handbook of Computational Geometry","author":"T Asano","year":"2000","unstructured":"Asano, T., Ghosh, S.K., Shermer, T.C.: Visibility in the plane. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 829\u2013876. Elsevier, Amsterdam (2000)"},{"key":"16_CR6","unstructured":"Simple polygon. Math Wiki (2018). \n                      http:\/\/math.wikia.com\/wiki\/Simple_polygon\n                      \n                    . Accessed 07 Jun 2018"},{"key":"16_CR7","unstructured":"Polygon. Math.ucdavis.edu (2018). \n                      https:\/\/www.math.ucdavis.edu\/~latte\/background\/countingLecture\/poly\/poly\/index.php\n                      \n                    . Accessed 10 Jun 2018"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/PL00009467","volume":"22","author":"S Carlsson","year":"1999","unstructured":"Carlsson, S., Jonsson, H., Nilsson, B.: Finding the shortest watchman route in a simple polygon. Discrete Comput. Geom. 22(3), 377\u2013402 (1999). \n                      https:\/\/doi.org\/10.1007\/PL00009467","journal-title":"Discrete Comput. Geom."},{"key":"16_CR9","unstructured":"Morphology - Skeletonization\/Medial Axis Transform (2018). Homepages.inf.ed.ac.uk. \n                      https:\/\/homepages.inf.ed.ac.uk\/rbf\/HIPR2\/skeleton.htm\n                      \n                    . Accessed 19 Jun 2018"},{"key":"16_CR10","unstructured":"Morphology - Thinning (2018). Homepages.inf.ed.ac.uk. \n                      https:\/\/homepages.inf.ed.ac.uk\/rbf\/HIPR2\/thin.htm\n                      \n                    . Accessed 20 Jun 2018"},{"key":"16_CR11","unstructured":"Morphology - Hit-and-Miss Transform (2018). Homepages.inf.ed.ac.uk. \n                      https:\/\/homepages.inf.ed.ac.uk\/rbf\/HIPR2\/hitmiss.htm\n                      \n                    . Accessed 22 Jun 2018"},{"key":"16_CR12","unstructured":"Morphology - Distance Transform (2018). Homepages.inf.ed.ac.uk. \n                      https:\/\/homepages.inf.ed.ac.uk\/rbf\/HIPR2\/distance.htm\n                      \n                    . Accessed 26 Jun 2018"},{"key":"16_CR13","unstructured":"FOV using recursive shadowcasting - RogueBasin (2018). Roguebasin.com. \n                      http:\/\/www.roguebasin.com\/index.php?title=FOV_using_recursive_shadowcasting\n                      \n                    . Accessed 26 Jun 2018"},{"key":"16_CR14","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo tree search. In: International Joint Conference on Artificial Intelligence, Barcelona, Spain, pp. 649\u2013654 (2011)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: International Joint Conference on Artificial Intelligence, Barcelona, Spain, pp. 456\u2013461 (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"key":"16_CR16","unstructured":"Flask. Pallets (2018). \n                      https:\/\/www.palletsprojects.com\/p\/flask\n                      \n                    . Accessed 03 Jul 2018"},{"key":"16_CR17","unstructured":"Nms.kcl.ac.uk (2018). \n                      https:\/\/nms.kcl.ac.uk\/stefan.edelkamp\/lectures\/pi1\/programs\/TSPTW.java\n                      \n                    . Accessed 20 Jul 2018"},{"key":"16_CR18","unstructured":"Cellular Automata - Unity. Unity (2018). \n                      https:\/\/unity3d.com\/cn\/learn\/tutorials\/projects\/procedural-cave-generation-tutorial\/cellularautomata?playlist=17153\n                      \n                    . Accessed 20 Jun 2018"},{"key":"16_CR19","unstructured":"Scrum Alliance - Learn About Scrum. Scrumalliance.org (2018). \n                      https:\/\/www.scrumalliance.org\/why-scrum\n                      \n                    . Accessed 20 Apr 2018"},{"key":"16_CR20","unstructured":"Akhier\/Py-RecursiveShadowCasting. GitHub (2018). \n                      https:\/\/github.com\/Akhier\/Py-RecursiveShadowCasting\n                      \n                    . Accessed 17 Jul 2018"},{"key":"16_CR21","unstructured":"SebLague\/Procedural-Cave-Generation. GitHub (2018). \n                      https:\/\/github.com\/SebLague\/Procedural-Cave-Generation\n                      \n                    . Accessed 18 Jul 2018"}],"container-title":["Lecture Notes in Computer Science","Towards Autonomous Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25332-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T07:04:41Z","timestamp":1565766281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25332-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030253318","9783030253325"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25332-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"17 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAROS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference Towards Autonomous Robotic Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"taros2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qmul.ac.uk\/robotics\/events\/taros2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}