{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:31:30Z","timestamp":1725863490602},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319293622"},{"type":"electronic","value":"9783319293639"}],"license":[{"start":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T00:00:00Z","timestamp":1472169600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,8,26]],"date-time":"2016-08-26T00:00:00Z","timestamp":1472169600000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-29363-9_19","type":"book-chapter","created":{"date-parts":[[2016,8,25]],"date-time":"2016-08-25T08:32:19Z","timestamp":1472113939000},"page":"327-343","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Planning Complex Inspection Tasks Using Redundant Roadmaps"],"prefix":"10.1007","author":[{"given":"Brendan","family":"Englot","sequence":"first","affiliation":[]},{"given":"Franz","family":"Hover","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,26]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"D. Applegate, W. Cook, A. Rohe, Chained Lin-Kernighan for large traveling salesman problems. INFORMS J. Comput. 15(1), 82\u201392 (2003)","journal-title":"INFORMS J. Comput."},{"key":"19_CR2","volume-title":"The Traveling Salesman Problem: a Computational Study","author":"D Applegate","year":"2006","unstructured":"D. Applegate, R. Bixby, V. Chvatal, W. Cook, The Traveling Salesman Problem: a Computational Study (Princeton University Press, Princeton, 2006)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0020-0190(93)90072-H","volume":"47","author":"EM Arkin","year":"1993","unstructured":"E.M. Arkin, M.M. Halldorsson, R. Hassin, Approximating the tree and tour covers of a graph. Inform. Process. Lett. 47, 275\u2013282 (1993)","journal-title":"Inform. Process. Lett."},{"issue":"11","key":"19_CR5","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1177\/0278364905059058","volume":"24","author":"P Atkar","year":"2005","unstructured":"P. Atkar, A.L. Greenfield, D.C. Conner, H. Choset, A. Rizzi, Uniform coverage of automotive surface patches. Int. J. Robot. Res. 24(11), 883\u2013898 (2005)","journal-title":"Int. J. Robot. Res."},{"key":"19_CR6","unstructured":"P. Atkar, A.L. Greenfield, D.C. Conner, H. Choset, A. Rizzi. Hierarchical segmentation of surfaces embedded in \u211c3 for auto-body painting, in Proceedings of IEEE International. Conference on Robotics and Automation (2005), pp. 572\u2013577"},{"issue":"11\u201312","key":"19_CR7","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1002\/rob.20318","volume":"26","author":"PS Blaer","year":"2009","unstructured":"P.S. Blaer, P.K. Allen, View planning and automated data acquisition for three-dimensional modeling of complex sites. J. Field Robot. 26(11\u201312), 865\u2013891 (2009)","journal-title":"J. Field Robot."},{"key":"19_CR4","unstructured":"P. Cheng, J. Keller, V. Kumar, Time-optimal UAV trajectory planning for 3D urban structure coverage, in Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems (2008), pp. 2750\u20132757"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"H. Choset, P. Pignon, Coverage path planning: the boustrophedon decomposition, in Proceedings of International Conference on Field and Service Robotics (1997)","DOI":"10.1007\/978-1-4471-1273-0_32"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H Choset","year":"2001","unstructured":"H. Choset, Coverage for robotics\u2014a survey of recent results. Ann. Math. Artif. Intell. 31, 113\u2013126 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"key":"19_CR10","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Applications","author":"H Choset","year":"2005","unstructured":"H. Choset, K.M. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L.E. Kavraki, S. Thrun, Principles of Robot Motion: Theory, Algorithms, and Applications (MIT Press, Cambridge, 2005)"},{"key":"19_CR11","unstructured":"N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report CS-93-13, Carnegie Mellon University (1976)"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1287\/trsc.23.3.208","volume":"23","author":"JR Current","year":"1989","unstructured":"J.R. Current, D.A. Schilling, The Covering Salesman Problem. Transp. Sci. 23(3), 208\u2013213 (1989)","journal-title":"Transp. Sci."},{"key":"19_CR13","unstructured":"T. Danner, L. Kavraki, Randomized planning for short inspection paths, in Proceedings of IEEE International Conference on Robotics and Automation, vol 2 (2000), pp. 971\u2013976"},{"key":"19_CR14","unstructured":"K. Easton, J. Burdick, A coverage algorithm for multi-robot boundary inspection, in Proceedings of IEEE International Conference on Robotics and Automation (2005), pp. 727\u2013734"},{"key":"19_CR15","unstructured":"P. Fazli, A. Davoodi, P. Pasquier, A.K. Mackworth, Complete and robust cooperative robot area coverage with limited range, in Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems (2010), pp. 5577\u20135582"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"M. Fischetti, J.J.S. Gonzalez, P. Toth, A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378\u2013394 (1997)","journal-title":"Oper. Res."},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.45.4.568","volume":"45","author":"M Gendreau","year":"1997","unstructured":"M. Gendreau, G. LaPorte, F. Semet, The covering tour problem. Oper. Res. 45(4), 568\u2013576 (1997)","journal-title":"Oper. Res."},{"key":"19_CR18","unstructured":"H. Gonzalez-Ba\u00f1os, J.-C. Latombe, Planning robot motions for range-image acquisition and automatic 3D model construction, in Proceedings of AAAI Fall Symposium (1998)"},{"key":"19_CR19","unstructured":"H. Gonzalez-Ba\u00f1os, J.-C. Latombe, A randomized art gallery algorithm for sensor placement, in Proceedings of 17th Annual ACM Symposium on Computational Geometry (2001), pp. 232\u2013240"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"D.S. Hochbaum, Approximation algorithms for the set covering and vertex cover problems. 21.SIAM J. Comput. 11(3) (1982)","DOI":"10.1137\/0211045"},{"issue":"2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"44","DOI":"10.4031\/002533207787442196","volume":"41","author":"F Hover","year":"2007","unstructured":"F. Hover et al., A vehicle system for autonomous relative survey of in-water ships. J. Mar. Technol. Soc. 41(2), 44\u201355 (2007)","journal-title":"J. Mar. Technol. Soc."},{"key":"19_CR22","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"D.S. Johnson, Approximation algorithms for combinatorial problems. J. Comput. Syst. Sci. 9, 256\u2013278 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR23","unstructured":"M. Kazhdan, M. Bolitho, H. Hoppe, Poisson surface reconstruction, in Proceedings of Fourth Eurographics Symposium on Geometry (2006)"},{"key":"19_CR24","unstructured":"S. LaValle, J. Kuffner, Rapidly-exploring random trees: progress and prospects, in Proceedings of Workshop on the Algorithmic Foundations of Robotics (2000), pp. 293\u2013308"},{"key":"19_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"S LaValle","year":"2006","unstructured":"S. LaValle, Planning Algorithms (Cambridge University Press, Cambridge, UK, 2006)"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0255(93)90133-7","volume":"74","author":"YN Lien","year":"1993","unstructured":"Y.N. Lien, E. Ma, Transformation of the generalized traveling salesman problem into the standard traveling salesman problem. Inf. Sci. 74, 177\u2013189 (1993)","journal-title":"Inf. Sci."},{"issue":"2","key":"19_CR27","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"S. Lin, B.W. Kernighan, An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"19_CR28","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L Lovasz","year":"1975","unstructured":"L. Lovasz, On the ratio of optimal integral and fractional covers. Discrete Math. 13, 383\u2013390 (1975)","journal-title":"Discrete Math."},{"key":"19_CR29","unstructured":"C.E. Noon, J.C. Bean, An efficient transformation of the generalized traveling salesman problem. Technical Report 89-36, Department of Industrial and Operations Engineering (The University of Michigan, Ann Arbor, 1989)"},{"issue":"3","key":"19_CR30","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1177\/0278364906061705","volume":"25","author":"M Saha","year":"2006","unstructured":"M. Saha, T. Roughgarden, J.-C. Latombe, G. Sanchez-Ante, Planning tours of robotic arms among partitioned goals. Int. J. Robot. Res. 25(3), 207\u2013223 (2006)","journal-title":"Int. J. Robot. Res."},{"issue":"1","key":"19_CR31","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1177\/027836402320556458","volume":"21","author":"G Sanchez","year":"2002","unstructured":"G. Sanchez, J.-C. Latombe, On delaying collision checking in PRM planning: application to multi-robot coordination. Int. J. Robot. Res. 21(1), 5\u201326 (2002)","journal-title":"Int. J. Robot. Res."},{"issue":"1","key":"19_CR32","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/641865.641868","volume":"35","author":"W Scott","year":"2003","unstructured":"W. Scott, G. Roth, J. Rivest, View planning for automated three-dimensional object reconstruction and inspection. ACM Comput. Surv. 35(1), 64\u201396 (2003)","journal-title":"ACM Comput. Surv."},{"issue":"9","key":"19_CR33","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/5.163407","volume":"80","author":"T Shermer","year":"1992","unstructured":"T. Shermer, Recent results in art galleries. Proc. IEEE 80(9), 1384\u20131399 (1992)","journal-title":"Proc. IEEE"},{"key":"19_CR34","unstructured":"P. Wang, R. Krishnamurti, K. Gupta, View planning problem with combined view and traveling cost, in Proceedings of IEEE International Conference on Robotics and Automation (2007), pp. 711\u2013716"},{"key":"19_CR35","unstructured":"K. Williams, J. Burdick, Multi-robot boundary coverage with plan revision, in Proceedings of IEEE International Conference on Robotics and Automation (2006), pp. 1716\u20131723"}],"container-title":["Springer Tracts in Advanced Robotics","Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29363-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T15:29:48Z","timestamp":1558452588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29363-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,26]]},"ISBN":["9783319293622","9783319293639"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29363-9_19","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2016,8,26]]},"assertion":[{"value":"26 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}