{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:44:45Z","timestamp":1742913885603,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642362781"},{"type":"electronic","value":"9783642362798"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36279-8_8","type":"book-chapter","created":{"date-parts":[[2013,2,14]],"date-time":"2013-02-14T09:26:18Z","timestamp":1360833978000},"page":"123-138","source":"Crossref","is-referenced-by-count":11,"title":["Optimal Gap Navigation for a Disc Robot"],"prefix":"10.1007","author":[{"given":"Rigoberto","family":"Lopez-Padilla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Murrieta-Cid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven M.","family":"LaValle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.: New lower bound techniques for robot motion planning problems. In: Proceedings IEEE Symposium on Foundations of Computer Science, pp. 49\u201360 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"key":"8_CR2","unstructured":"Chen, D.Z., Wang, H.: Paths among curved obstacles in the plane. In: Proceedings of Computing Research Repository (2011)"},{"key":"8_CR3","unstructured":"Chew, L.P.: Planning the shortest path for a disc in O(n\n                2\n                log\n                n) time. In: Proceedings ACM Symposium on Computational Geometry (1985)"},{"key":"8_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"M. de Berg","year":"2000","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 2nd edn. Springer, Berlin (2000)","edition":"2"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/MRA.2006.1638022","volume":"13","author":"H. Durrant-Whyte","year":"2006","unstructured":"Durrant-Whyte, H., Bailey, T.: Simultaneous localization and mapping: Part I. IEEE Robotics and Automation Magazine\u00a013(2), 99\u2013110 (2006)","journal-title":"IEEE Robotics and Automation Magazine"},{"key":"8_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"S.K. Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge (2007)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K., Mount, D.M.: An output sensitive algorithm for computing visibility graphs. In: Proceedings IEEE Symposium on Foundations of Computer Science, pp. 11\u201319 (1987)","DOI":"10.1109\/SFCS.1987.6"},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"881","DOI":"10.4310\/CMS.2008.v6.n4.a5","volume":"6","author":"Y. Landa","year":"2008","unstructured":"Landa, Y., Tsai, R.: Visibility of point clouds and exploratory path planning in unknown environments. Communications in Mathematical Sciences\u00a06(4), 881\u2013913 (2008)","journal-title":"Communications in Mathematical Sciences"},{"key":"8_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"S.M. LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006), \n                    http:\/\/planning.cs.uiuc.edu\/"},{"key":"8_CR10","unstructured":"LaValle, S.M.: Sensing and filtering: A fresh perspective based on preimages and information spaces. Foundations and Trends in Robotics Series. Now Publishers, Delft, The Netherlands (2012)"},{"issue":"5","key":"8_CR11","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/70.466615","volume":"11","author":"Y.-H. Liu","year":"1995","unstructured":"Liu, Y.-H., Arimoto, S.: Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph. IEEE Trans. on Robotics and Automation\u00a011(5), 682\u2013691 (1995)","journal-title":"IEEE Trans. on Robotics and Automation"},{"key":"8_CR12","unstructured":"Lopez-Padilla, R., Murrieta-Cid, R., LaValle, S.M.: Detours for optimal navigation with a disc robot, pp. 1\u201321 (February 2012), \n                    http:\/\/www.cimat.mx\/%7Emurrieta\/Papersonline\/AppendixWAFR12.pdf"},{"key":"8_CR13","first-page":"607","volume-title":"Handbook of Discrete and Computational Geometry","author":"J.S.B. Mitchell","year":"2004","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 607\u2013641. Chapman and Hall\/CRC Press, New York (2004)","edition":"2"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem. Journal of the ACM\u00a038, 18\u201373 (1991)","journal-title":"Journal of the ACM"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Murphy, L., Newman, P.: Using incomplete online metric maps for topological exploration with the gap navigation tree. In: Proc. IEEE Int. Conf. on Robotics & Automation (2008)","DOI":"10.1109\/ROBOT.2008.4543633"},{"key":"8_CR16","first-page":"191","volume-title":"Algorithmic and Computational Robotics: New Directions","author":"J.H. Reif","year":"2001","unstructured":"Reif, J.H., Sun, Z.: An efficient approximation algorithm for weighted region shortest path problem. In: Donald, B.R., Lynch, K.M., Rus, D. (eds.) Algorithmic and Computational Robotics: New Directions, pp. 191\u2013203. A.K. Peters, Wellesley (2001)"},{"key":"8_CR17","volume-title":"Probabilistic Robotics","author":"S. Thrun","year":"2005","unstructured":"Thrun, S., Burgard, W., Fox, D.: Probabilistic Robotics. MIT Press, Cambridge (2005)"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/TRO.2007.898962","volume":"23","author":"B. Tovar","year":"2007","unstructured":"Tovar, B., Murrieta, R., LaValle, S.M.: Distance-optimal navigation in an unknown environment without sensing distances. IEEE Trans. on Robotics\u00a023(3), 506\u2013518 (2007)","journal-title":"IEEE Trans. on Robotics"}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36279-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T15:24:19Z","timestamp":1706196259000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-36279-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642362781","9783642362798"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36279-8_8","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[],"published":{"date-parts":[[2013]]}}}