{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:21:20Z","timestamp":1773141680993,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2010,7,30]],"date-time":"2010-07-30T00:00:00Z","timestamp":1280448000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10846-010-9449-0","type":"journal-article","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:22:40Z","timestamp":1280391760000},"page":"329-353","source":"Crossref","is-referenced-by-count":23,"title":["A Sensor Placement Algorithm for a Mobile Robot Inspection Planning"],"prefix":"10.1007","volume":"62","author":[{"given":"Jan","family":"Faigl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslav","family":"Kulich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Libor","family":"P\u0159eu\u010dil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,30]]},"reference":[{"key":"9449_CR1","doi-asserted-by":"crossref","unstructured":"Chin, W.-P., Ntafos, S.: Optimum watchman routes. In: SCG \u201986: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 24\u201333, Yorktown Heights, New York. ACM (1986)","DOI":"10.1145\/10515.10518"},{"key":"9449_CR2","unstructured":"Packer, E.: Robust geometric computing and optimal visibility coverage. PhD thesis, Stony Brook University, New York (2008)"},{"key":"9449_CR3","doi-asserted-by":"crossref","unstructured":"Danner, T., Kavraki, L.E.: Randomized planning for short inspection paths. In: Proceedings of The IEEE International Conference on Robotics and Automation (ICRA), pp. 971\u2013976, San Francisco, CA. IEEE (2000)","DOI":"10.1109\/ROBOT.2000.844726"},{"issue":"1","key":"9449_CR4","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1006\/jagm.1994.1025","volume":"17","author":"JC Culberson","year":"1994","unstructured":"Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. J. Algorithms 17(1), 2\u201344 (1994)","journal-title":"J. Algorithms"},{"issue":"4","key":"9449_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0020-0190(03)00284-9","volume":"87","author":"X Tan","year":"2003","unstructured":"Tan, X., Hirata, T.: Finding shortest safari routes in simple polygons. Inf. Process. Lett. 87(4), 179\u2013186 (2003)","journal-title":"Inf. Process. Lett."},{"key":"9449_CR6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0925-7721(92)90014-J","volume":"1","author":"SC Ntafos","year":"1992","unstructured":"Ntafos, S.C.: Watchman routes under limited visibility. Comput. Geom. 1, 149\u2013170 (1992)","journal-title":"Comput. Geom."},{"key":"9449_CR7","doi-asserted-by":"crossref","unstructured":"Li, F., Klette, R.: An approximate algorithm for solving the watchman route problem. In: RobVis, pp. 189\u2013206 (2008)","DOI":"10.1007\/978-3-540-78157-8_15"},{"key":"9449_CR8","volume-title":"Handbook of Discrete and Computational Geometry","year":"2004","unstructured":"Goodman, J.E., O\u2019Rourke, J. (eds.): Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (2004)"},{"key":"9449_CR9","unstructured":"Gonz\u00e1lez-Ba\u00f1os, H.H., Hsu, D., Latombe, J.-C.: Motion planning: recent developments. In: Ge, S.S., Lewis, F.L. (eds.) Autonomous Mobile Robots: Sensing, Control, Decision-Making and Applications, Chapter\u00a010. CRC (2006)"},{"key":"9449_CR10","doi-asserted-by":"crossref","unstructured":"Wang, P.: View planning with combined view and travel cost. PhD thesis, Simon Fraser University (2007)","DOI":"10.1109\/ROBOT.2007.363070"},{"key":"9449_CR11","unstructured":"Gonz\u00e1lez-Ba\u00f1os, H.H., Latombe, J.-C.: Planning robot motions for range-image acquisition and automatic 3d model construction. In: AAAI Fall Symposium (1998)"},{"key":"9449_CR12","doi-asserted-by":"crossref","unstructured":"H\u00f6rster, E., Lienhart, R.: On the optimal placement of multiple visual sensors. In: VSSN \u201906: Proceedings of the 4th ACM International Workshop on Video Surveillance and Sensor Networks, pp. 111\u2013120, New York, NY. ACM (2006)","DOI":"10.1145\/1178782.1178800"},{"issue":"3","key":"9449_CR13","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.cviu.2006.06.005","volume":"103","author":"UM Erdem","year":"2006","unstructured":"Erdem, U.M., Sclaroff, S.: Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements. Comput. Vis. Image Underst. 103(3), 156\u2013169 (2006)","journal-title":"Comput. Vis. Image Underst."},{"issue":"2","key":"9449_CR14","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/s11036-009-0179-0","volume":"15","author":"YE Osais","year":"2008","unstructured":"Osais, Y.E., St-Hilaire, M., Yu, F.R.: Directional sensor placement with optimal sensing range, field of view and orientation. Mob. Netw. Appl. 15(2), 216\u2013225 (2008)","journal-title":"Mob. Netw. Appl."},{"key":"9449_CR15","unstructured":"Kazazakis, G.D., Argyros, A.A.: Fast positioning of limited visibility guards for the inspection of 2d workspaces. In: Proceedings of the IEEE\/RSJ Int. Conference on Intelligent Robots and Systems (IROS2002), Lausanne (2002)"},{"issue":"1","key":"9449_CR16","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1145\/641865.641868","volume":"35","author":"WR Scott","year":"2003","unstructured":"Scott, W.R., Roth, G., Rivest, J.-F.: View planning for automated three-dimensional object reconstruction and inspection. ACM Comput. Surv. 35(1), 64\u201396 (2003)","journal-title":"ACM Comput. Surv."},{"key":"9449_CR17","doi-asserted-by":"crossref","unstructured":"Blaer, P.S., Allen, P.K.: Data acquisition and view planning for 3-d modeling tasks. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2007), pp. 417\u2013422, 29 October\u20132 November 2007","DOI":"10.1109\/IROS.2007.4399581"},{"key":"9449_CR18","unstructured":"N\u00fcchter, A., Surmann, H., Hertzberg, J.: Planning robot motion for 3d digitalization of indoor environments. In: Proceedings of the 11th International Conference on Advanced Robotics (ICAR), pp. 222\u2013227 (2003)"},{"issue":"10\u201311","key":"9449_CR19","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1177\/0278364902021010834","volume":"21","author":"HH Gonz\u00e1lez-Ba\u00f1os","year":"2002","unstructured":"Gonz\u00e1lez-Ba\u00f1os, H.H., Latombe, J.-C.: Navigation strategies for exploring indoor environments. Int. J. Rob. Res. 21(10\u201311), 829\u2013848 (2002)","journal-title":"Int. J. Rob. Res."},{"key":"9449_CR20","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/378583.378674","volume-title":"SCG \u201901: Proceedings of the Seventeenth Annual Symposium on Computational Geometry","author":"HH Gonz\u00e1lez-Banos","year":"2001","unstructured":"Gonz\u00e1lez-Banos, H.H.: A randomized art-gallery algorithm for sensor placement. In: SCG \u201901: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, pp. 232\u2013240. ACM, New York (2001)"},{"key":"9449_CR21","doi-asserted-by":"crossref","unstructured":"Lavalle, S.M.: Planning Algorithms. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511546877"},{"key":"9449_CR22","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/73393.73410","volume-title":"SCG \u201988: Proceedings of the Fourth Annual Symposium on Computational Geometry","author":"MH Overmars","year":"1988","unstructured":"Overmars, M.H., Welzl, E.: New methods for computing visibility graphs. In: SCG \u201988: Proceedings of the Fourth Annual Symposium on Computational Geometry, pp. 164\u2013171. ACM, New York (1988)"},{"issue":"1","key":"9449_CR23","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0925-7721(91)90012-4","volume":"1","author":"R Seidel","year":"1991","unstructured":"Seidel, R.: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Comput. Geom. Theory Appl. 1(1), 51\u201364 (1991)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"3","key":"9449_CR24","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/cviu.1998.0738","volume":"73","author":"LJ Latecki","year":"1999","unstructured":"Latecki, L.J., Lak\u00e4mper, R.: Convexity rule for shape decomposition based on discrete contour evolution. Comput. Vis. Image Underst. 73(3), 441\u2013454 (1999)","journal-title":"Comput. Vis. Image Underst."},{"key":"9449_CR25","unstructured":"Wolter, D., Richter, K.-F.: Schematized aspect maps for robot guidance. In: Proceedings of the ECAI Workshop Cognitive Robotics (CogRob) (2004)"},{"key":"9449_CR26","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: CONCORDE TSP Solver. http:\/\/www.tsp.gatech.edu\/concorde.html (2003). Accessed 23 July 2010"},{"issue":"1","key":"9449_CR27","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained lin-kernighan for large traveling salesman problems. INFORMS J. Comput. 15(1), 82\u201392 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9449_CR28","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1109\/TRO.2009.2017140","volume":"25","author":"Z Chen","year":"2009","unstructured":"Chen, Z., Birchfield, S.T.: Qualitative vision-based path following. IEEE Transactions on Robotics 25(3), 749\u2013754 (2009)","journal-title":"IEEE Transactions on Robotics"},{"issue":"3","key":"9449_CR29","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10846-009-9313-2","volume":"56","author":"HJ Sohn","year":"2009","unstructured":"Sohn, H.J., Kim, B.K.: Vecslam: an efficient vector-based slam algorithm for indoor environments. J. Intell. Robot. Syst. 56(3), 301\u2013318 (2009)","journal-title":"J. Intell. Robot. Syst."},{"key":"9449_CR30","unstructured":"CGAL\u2014Computational Geometry Algorithms Library. http:\/\/www.cgal.org (2004). Accessed 23 July 2010"},{"key":"9449_CR31","unstructured":"JTS Topology Suite. http:\/\/www.vividsolutions.com\/jts\/jtshome.htm . Version 1.5 (2004). Accessed 23 July 2010"},{"key":"9449_CR32","unstructured":"Diablo Caffe JDK 1.6.0-7. http:\/\/www.freebsdfoundation.org\/downloads\/java.shtml (2009). Accessed 23 July 2010"},{"key":"9449_CR33","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1064092.1064104","volume-title":"SCG \u201905: Proceedings of the Twenty-First Annual Symposium on Computational Geometry","author":"R Wein","year":"2005","unstructured":"Wein, R., van\u00a0den Berg, J.P., Halperin, D.: The visibility\u2013voronoi complex and its applications. In: SCG \u201905: Proceedings of the Twenty-First Annual Symposium on Computational Geometry, pp. 63\u201372. ACM, New York (2005)"},{"key":"9449_CR34","unstructured":"Huang, W.H., Beevers, K.R.: Complete Topological Mapping with Sparse Sensing. Technical Report\u00a06, Rensselaer Polytechnic Institute Department of Computer Science (2005)"}],"container-title":["Journal of Intelligent &amp; Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-010-9449-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10846-010-9449-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-010-9449-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:50:20Z","timestamp":1559346620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10846-010-9449-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,30]]},"references-count":34,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["9449"],"URL":"https:\/\/doi.org\/10.1007\/s10846-010-9449-0","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"value":"0921-0296","type":"print"},{"value":"1573-0409","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,30]]}}}