{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T15:27:37Z","timestamp":1725809257769},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_9","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:11:32Z","timestamp":1415981492000},"page":"101-112","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot"],"prefix":"10.1007","author":[{"given":"Azadeh","family":"Tabatabaei","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Disser, Y., Ghosh, S.K., Mihalk, M., Widmayer, P.: Mapping a polygon with holes using a compass. Theor. Comput. Sci. (in press, corrected proof) (Available online 18 December 2013)","DOI":"10.1007\/978-3-642-36092-3_9"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/s10878-010-9303-0","volume":"24","author":"SP Fekete","year":"2003","unstructured":"Fekete, S.P., Mitchell, J.S.B., Schmidt, C.: Minimum covering with travel cost. J. Comb. Optim. 24, 32\u201351 (2003)","journal-title":"J. Comb. Optim."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/s10878-012-9564-x","volume":"28","author":"SF Ghannadpour","year":"2012","unstructured":"Ghannadpour, S.F., Noori, S., Tavakkoli-Moghaddam, R.: A multi-objective vehicle routing and scheduling problem with uncertainty in customers request and priority. J. Comb. Optim. 28, 414\u2013446 (2012)","journal-title":"J. Comb. Optim."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Guilamo, L., Tovar, B., LaValle, S.M.: Pursuit-evasion in an unknown environment using gap navigation trees. In: Proceedings of the 2004 IEEE\/RSJ International Conference on Intelligent Robot\u2019s and Systems, (IROS 2004), vol. 4, pp. 3456\u20133462. IEEE, September 2004","DOI":"10.1109\/IROS.2004.1389951"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.tcs.2005.11.032","volume":"354","author":"M Hammar","year":"2006","unstructured":"Hammar, M., Nilsson, B.J., Persson, M.: Competitive exploration of rectilinear polygons. Theor. Comput. Sci. 354(3), 367\u2013378 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-49116-3_10","volume-title":"STACS 99","author":"C Icking","year":"1999","unstructured":"Icking, C., Klein, R., Langetepe, E.: An optimal competitive strategy for walking in streets. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 110\u2013120. Springer, Heidelberg (1999)"},{"issue":"1","key":"9_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/TRO.2010.2095570","volume":"27","author":"M Katsev","year":"2011","unstructured":"Katsev, M., et al.: Mapping and pursuit-evasion strategies for a simple wall-following robot. IEEE Trans. Robot. 27(1), 113\u2013128 (2011)","journal-title":"IEEE Trans. Robot."},{"issue":"6","key":"9_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0925-7721(92)90010-P","volume":"1","author":"R Klein","year":"1992","unstructured":"Klein, R.: Walking an unknown street with bounded detour. Comput. Geom. 1(6), 325\u2013351 (1992)","journal-title":"Comput. Geom."},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0925-7721(97)00003-5","volume":"8","author":"S Kumar Ghosh","year":"1997","unstructured":"Kumar Ghosh, S., Saluja, S.: Optimal on-line algorithms for walking with minimum number of turns in unknown streets. Comput. Geom. 8(5), 241\u2013266 (1997)","journal-title":"Comput. Geom."},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0196-6774(91)90024-S","volume":"12","author":"S Kumar Ghosh","year":"1991","unstructured":"Kumar Ghosh, S.: Computing the visibility polygon from a convex set and related problems. J. Algorithms 12(1), 75\u201395 (1991)","journal-title":"J. Algorithms"},{"key":"9_CR11","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-36279-8_8","volume-title":"Algorithmic Foundations of Robotics X","author":"R Lopez-Padilla","year":"2013","unstructured":"Lopez-Padilla, R., Murrieta-Cid, R., LaValle, S.M.: Optimal gap navigation for a disc robot. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds.) Algorithmic Foundations of Robotics X. STAR, vol. 86, pp. 123\u2013138. Springer, Heidelberg (2013)"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.tcs.2003.08.001","volume":"310","author":"A Lpez-Ortiz","year":"2004","unstructured":"Lpez-Ortiz, A., Schuierer, S.: On-line parallel heuristics, processor scheduling and robot searching under the competitive framework. Theor. Comput. Sci. 310(1), 527\u2013537 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20136","key":"9_CR13","first-page":"431","volume":"8","author":"JS Mitchell","year":"1998","unstructured":"Mitchell, J.S., Rote, G., Woeginger, G.: Minimum-link paths among obstacles in the plane. Algorithmica 8(1\u20136), 431\u2013459 (1998)","journal-title":"Algorithmica"},{"issue":"1","key":"9_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1177\/0278364904039610","volume":"23","author":"S Sachs","year":"2004","unstructured":"Sachs, S., LaValle, S.M., Rajko, S.: Visibility-based pursuit-evasion in an unknown planar environment. Int. J. Robot. Res. 23(1), 3\u201326 (2004)","journal-title":"Int. J. Robot. Res."},{"issue":"9","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1177\/0278364908095833","volume":"27","author":"S Suri","year":"2008","unstructured":"Suri, S., Vicari, E., Widmayer, P.: Simple robots with minimal sensing: from local visibility to global geometry. Int. J. Robot. Res. 27(9), 1055\u20131067 (2008)","journal-title":"Int. J. Robot. Res."},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-319-03780-6_32","volume-title":"Combinatorial Optimization and Applications","author":"A Tabatabaei","year":"2013","unstructured":"Tabatabaei, A., Ghodsi, M.: Walking in streets with minimal sensing. In: Widmayer, P., Xu, Y., Zhu, B. (eds.) COCOA 2013. LNCS, vol. 8287, pp. 361\u2013372. Springer, Heidelberg (2013)"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2013.03.019","volume":"532","author":"X Tan","year":"2014","unstructured":"Tan, X., Bo, J.: Minimization of the maximum distance between the two guards patrolling a polygonal region. Theor. Comput. Sci. 532, 73\u201379 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"9_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-Cid, R., LaValle, S.M.: Distance-optimal navigation in an unknown environment without sensing distances. IEEE Trans. Robot. 23(3), 506\u2013518 (2007)","journal-title":"IEEE Trans. Robot."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Tovar, B., LaValle, S.M., Murrieta, R.: Optimal navigation and object finding without geometric maps or localization. In Proceedings of the IEEE International Conference on Robotics and Automation, ICRA\u201903, vol. 1, pp. 464\u2013470. IEEE, September 2003","DOI":"10.1109\/ROBOT.2003.1241638"},{"issue":"2","key":"9_CR20","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10878-008-9156-y","volume":"18","author":"Y Xu","year":"2009","unstructured":"Xu, Y., et al.: The canadian traveller problem and its competitive analysis. J. Comb. Optim. 18(2), 195\u2013205 (2009)","journal-title":"J. Comb. Optim."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T07:35:02Z","timestamp":1566027302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}