{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T03:10:07Z","timestamp":1748747407393,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319286778"},{"type":"electronic","value":"9783319286785"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-28678-5_3","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T15:14:18Z","timestamp":1452266058000},"page":"30-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robots\u2019 Cooperation for Finding a Target in Streets"],"prefix":"10.1007","author":[{"given":"Mohammad Abouei","family":"Mehrizi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azadeh","family":"Tabatabaei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"RA Baezayates","year":"1993","unstructured":"Baezayates, R.A., Culberson, J.C., Rawlins, G.J.: Searching in the plane. Inf. Comput. 106(2), 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0925-7721(95)00042-9","volume":"7","author":"G Das","year":"1997","unstructured":"Das, G., Heffernan, P.J., Narasimhan, G.: LR-visibility in polygons. Comput. Geom. 7(1), 37\u201357 (1997)","journal-title":"Comput. Geom."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-77871-4_5","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"B Gfeller","year":"2008","unstructured":"Gfeller, B., Mihal\u00e1k, M., Suri, S., Vicari, E., Widmayer, P.: Counting targets with mobile sensors in an unknown environment. In: Kuty\u0142owski, M., Cicho\u0144, J., Kubiak, P. (eds.) ALGOSENSORS 2007. LNCS, vol. 4837, pp. 32\u201345. Springer, Heidelberg (2008)"},{"key":"3_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, Cambridge (2007)"},{"key":"3_CR5","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)"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Klein, R.: Walking an unknown street with bounded detour. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991, pp. 304\u2013313, October 1991","DOI":"10.1109\/SFCS.1991.185383"},{"key":"3_CR7","unstructured":"Kleinbergt, J.M.: On-line search in a simple polygon. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, No. 70, p. 8. SIAM (1994)"},{"key":"3_CR8","unstructured":"Lopez-Ortiz, A.: On-line target searching in bounded and unbounded domains. University of Waterloo (1996)"},{"key":"3_CR9","unstructured":"Lopez-Ortiz, A., Schuierer, S.: Simple, efficient and robust strategies to traverse streets. In: Proceedings of the 7th Canada Conference on Computational Geometry (1995)"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume":"334","author":"JS Mitchell","year":"2000","unstructured":"Mitchell, J.S.: Geometric shortest paths and network optimization. Handb. Comput. Geom. 334, 633\u2013702 (2000)","journal-title":"Handb. Comput. Geom."},{"issue":"9","key":"3_CR11","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."},{"issue":"3","key":"3_CR12","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. Robotics 23(3), 506\u2013518 (2007)","journal-title":"IEEE Trans. Robotics"},{"key":"3_CR13","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 2003, ICRA 2003, vol. 1, pp. 464\u2013470, September 2003","DOI":"10.1109\/ROBOT.2003.1241638"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-3-319-12691-3_9","volume-title":"Combinatorial Optimization and Applications","author":"A Tabatabaei","year":"2014","unstructured":"Tabatabaei, A., Ghodsi, M.: Optimal strategy for walking in streets with minimum number of turns for a simple robot. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 101\u2013112. Springer, Heidelberg (2014)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-45077-1_22","volume-title":"Fundamentals of Computation Theory","author":"M Hammar","year":"2003","unstructured":"Hammar, M., Nilsson, B.J., Persson, M.: Competitive exploration of rectilinear polygons. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol. 2751, pp. 234\u2013245. Springer, Heidelberg (2003)"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Yu, J., LaValle, S.M.: Planning optimal paths for multiple robots on graphs. In: 2013 IEEE International Conference on Robotics and Automation (ICRA), pp. 3612\u20133617, May 2013","DOI":"10.1109\/ICRA.2013.6631084"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Yu, J., LaValle, S.M.: Structure and intractability of optimal multi-robot path planning on graphs. In: AAAI, June 2013","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"3_CR18","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-36279-8_10","volume-title":"Algorithmic Foundations of Robotics X","author":"J Yu","year":"2013","unstructured":"Yu, J., LaValle, S.M.: Multi-agent path planning and network flow. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds.) Algorithmic Foundations of Robotics X. STAR, vol. 86, pp. 157\u2013173. Springer, Heidelberg (2013)"},{"issue":"1\u20134","key":"3_CR19","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/BF01840371","volume":"2","author":"M Erdmann","year":"1987","unstructured":"Erdmann, M., Lozano-Perez, T.: On multiple moving objects. Algorithmica 2(1\u20134), 477\u2013521 (1987)","journal-title":"Algorithmica"},{"key":"3_CR20","unstructured":"Luna, R., Bekris, K.E.: Push and swap: fast cooperative path-finding with completeness guarantees. In: IJCAI, pp. 294\u2013300, July 2011"},{"key":"3_CR21","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1613\/jair.2408","volume":"31","author":"MRK Ryan","year":"2008","unstructured":"Ryan, M.R.K.: Exploiting subgraph structure in multi-robot path planning. J. Artif. Intell. Res. 31, 497\u2013542 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Silver, D.: Cooperative pathfinding. In: AIIDE, pp. 117\u2013122, June 2005","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"3_CR23","unstructured":"Tabatabaei, A., Ghodsi, M.: Walking in streets with minimal sensing. J. Comb. Optim. (2014). http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9791-4"}],"container-title":["Lecture Notes in Computer Science","Topics in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28678-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T02:42:36Z","timestamp":1748745756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28678-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319286778","9783319286785"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28678-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}