{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T07:04:19Z","timestamp":1790147059483,"version":"4.0.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T00:00:00Z","timestamp":1790121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T00:00:00Z","timestamp":1790121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100004442","name":"Narodowym Centrum Nauki","doi-asserted-by":"publisher","award":["2020\/39\/B\/ST6\/03288"],"award-info":[{"award-number":["2020\/39\/B\/ST6\/03288"]}],"id":[{"id":"10.13039\/501100004442","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN 2024-03767"],"award-info":[{"award-number":["RGPIN 2024-03767"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1007\/s00446-026-00518-x","type":"journal-article","created":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T06:44:12Z","timestamp":1790145852000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approach of agents with restricted fuel tanks"],"prefix":"10.1007","volume":"39","author":[{"given":"Adam","family":"Ganczorz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomasz","family":"Jurdzinski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Grzegorz","family":"Stachowiak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,9,23]]},"reference":[{"key":"518_CR1","volume-title":"The Theory of Search Games and Rendezvous","author":"S Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publications, Netherlands (2003)"},{"key":"518_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1006\/inco.1999.2795","volume":"152","author":"B Awerbuch","year":"1999","unstructured":"Awerbuch, B., Betke, M., Rivest, R.L., Singh, M.: Piecemeal graph exploration by a mobile robot. Inf. Comput. 152, 155\u2013172 (1999)","journal-title":"Inf. Comput."},{"key":"518_CR3","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"R Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R., Culberson, J., Rawlins, J.: Searching the plane. Inf. Comput. 106, 234\u2013252 (1993)","journal-title":"Inf. Comput."},{"key":"518_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s00446-018-0338-2","volume":"32","author":"S Bouchard","year":"2019","unstructured":"Bouchard, S., Bournat, M., Dieudonn\u00e9, Y., Dubois, S., Petit, F.: Asynchronous approach in the plane: a deterministic polynomial algorithm. Distrib. Comput. 32, 317\u2013337 (2019)","journal-title":"Distrib. Comput."},{"key":"518_CR5","first-page":"22:1","volume":"19","author":"S Bouchard","year":"2023","unstructured":"Bouchard, S., Dieudonn\u00e9, Y., Labourel, A., Pelc, A.: Almost-optimal deterministic treasure hunt in unweighted graphs. ACM Trans. Algor. 19, 22:1-22:32 (2023)","journal-title":"ACM Trans. Algor."},{"key":"518_CR6","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: Gathering. SIAM J. Comput. 41, 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"518_CR7","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"34","author":"R Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. Comput. 34, 1516\u20131528 (2005)","journal-title":"SIAM J. Comput."},{"key":"518_CR8","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Gasieniec, L., Killick, R., Kranakis, E.: Symmetry breaking in the plane: Rendezvous by robots with unknown attributes, Proc. 38th ACM Symp. on Principles of Distributed Computing (PODC 2019): 4-13","DOI":"10.1145\/3293611.3331608"},{"key":"518_CR9","doi-asserted-by":"publisher","first-page":"3110","DOI":"10.1007\/s00453-023-01122-2","volume":"85","author":"Y Dieudonn\u00e9","year":"2023","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Petit, F.: Almost universal anonymous rendezvous in the plane. Algorithmica 85, 3110\u20133143 (2023)","journal-title":"Algorithmica"},{"key":"518_CR10","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/130931990","volume":"44","author":"Y Dieudonn\u00e9","year":"2015","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. SIAM J. Comput. 44, 844\u2013867 (2015)","journal-title":"SIAM J. Comput."},{"key":"518_CR11","doi-asserted-by":"crossref","unstructured":"Duncan, C.A., Kobourov, S.G., Kumar, V.S.A.: Optimal constrained graph exploration. ACM Trans. Algor. 2, 380\u2013402 (2006)","DOI":"10.1145\/1159892.1159897"},{"key":"518_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. Theor. Comput. Sci. 337, 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"518_CR13","doi-asserted-by":"crossref","unstructured":"Gal, S.: Search Games: A Review. A Game Theoretic Perspective, Search Theory, pp. 3\u201315 (2013)","DOI":"10.1007\/978-1-4614-6825-7_1"},{"key":"518_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.cosrev.2010.05.001","volume":"4","author":"SK Ghosh","year":"2010","unstructured":"Ghosh, S.K., Klein, R.: Online algorithms for searching and exploration in the plane. Computer Sci. Rev. 4, 189\u2013201 (2010)","journal-title":"Computer Sci. Rev."},{"key":"518_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2018.04.006","volume":"140","author":"A Pelc","year":"2018","unstructured":"Pelc, A.: Reaching a target in the plane with no information. Inf. Process. Lett. 140, 13\u201317 (2018)","journal-title":"Inf. Process. Lett."},{"key":"518_CR16","doi-asserted-by":"crossref","unstructured":"Pelc, A.: Deterministic rendezvous algorithms, In: Distributed Computing by Mobile Entities, P. Flocchini, G. Prencipe, N. Santoro, Eds., Springer, LNCS 11340 (2019)","DOI":"10.1007\/978-3-030-11072-7_17"},{"key":"518_CR17","first-page":"12:1","volume":"10","author":"A Ta-Shma","year":"2014","unstructured":"Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. ACM Trans. Algor. 10, 12:1-12:15 (2014)","journal-title":"ACM Trans. Algor."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-026-00518-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-026-00518-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-026-00518-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T06:44:15Z","timestamp":1790145855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-026-00518-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9,23]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["518"],"URL":"https:\/\/doi.org\/10.1007\/s00446-026-00518-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,9,23]]},"assertion":[{"value":"31 December 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"26"}}