{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T22:14:19Z","timestamp":1778537659164,"version":"3.51.4"},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T00:00:00Z","timestamp":1771545600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100012376","name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100012376","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":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.tcs.2026.115844","type":"journal-article","created":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:16:48Z","timestamp":1771658208000},"page":"115844","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Exploration of convex terrains by a deterministic automaton with pebbles"],"prefix":"10.1016","volume":"1070","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6612-0916","authenticated-orcid":false,"given":"Mohamed","family":"Anouar Baaziz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0598-1218","authenticated-orcid":false,"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115844_bib0001","article-title":"Labyrinth Problems: Labyrinth-Searching Abilities of Automata, Teubner-Texte zur Mathematik","volume":"114","author":"Hemmerling","year":"1989"},{"key":"10.1016\/j.tcs.2026.115844_bib0002","series-title":"Technical Report","article-title":"Robot Navigation in Unknown Terrains: Introductory Survey of Non-Heuristic Algorithms","author":"Rao","year":"1993"},{"key":"10.1016\/j.tcs.2026.115844_bib0003","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s00453-001-0067-x","article-title":"Exploring unknown environments with obstacles","volume":"32","author":"Albers","year":"2002","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115844_bib0004","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.ic.2013.02.001","article-title":"Worst-case optimal exploration of terrains with obstacles","volume":"225","author":"Czyzowicz","year":"2013","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.115844_bib0005","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ic.2010.09.005","article-title":"Optimality and competitiveness of exploring polygons by mobile robots","volume":"209","author":"Czyzowicz","year":"2011","journal-title":"Inf. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2026.115844_bib0006","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/274787.274788","article-title":"How to learn an unknown environment I: the rectilinear case","volume":"45","author":"Deng","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2026.115844_bib0007","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1137\/S0097539799348670","article-title":"The polygon exploration problem","volume":"31","author":"Hoffmann","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115844_bib0008","series-title":"Proc. 21st Ann. ACM-SIAM Symp. Disc. Algor. (SODA","first-page":"1","article-title":"On the optimality of spiral search","author":"Langetepe","year":"2010"},{"key":"10.1016\/j.tcs.2026.115844_bib0009","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1006\/inco.1993.1054","article-title":"Searching the plane","volume":"106","author":"Baeza-Yates","year":"1993","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.115844_bib0010","series-title":"ACM Symposium on Principles of Distributed Computing","first-page":"67","article-title":"On the computational power of oblivious robots: forming a series of geometric patterns","author":"Das","year":"2010"},{"key":"10.1016\/j.tcs.2026.115844_bib0011","series-title":"24th International Symposium on Distributed Computing (DISC)","first-page":"267","article-title":"Leader election problem versus pattern formation problem","author":"Dieudonn\u00e9","year":"2010"},{"issue":"4","key":"10.1016\/j.tcs.2026.115844_bib0012","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1137\/S009753979628292X","article-title":"Distributed anonymous mobile robots: formation of geometric patterns","volume":"28","author":"Suzuki","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2026.115844_bib0013","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1137\/S009753979732428X","article-title":"Exploring unknown environments","volume":"29","author":"Albers","year":"2000","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2026.115844_bib0014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2001.3081","article-title":"The power of a pebble: exploring and mapping directed graphs","volume":"176","author":"Bender","year":"2002","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.115844_bib0015","series-title":"35th Ann. Symp. on Foundations of Computer Science (FOCS","first-page":"75","article-title":"The power of team exploration: two robots can learn unlabeled directed graphs","author":"Bender","year":"1994"},{"issue":"3","key":"10.1016\/j.tcs.2026.115844_bib0016","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","article-title":"Exploring an unknown graph","volume":"32","author":"Deng","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2026.115844_bib0017","series-title":"21st Symposium on Theoretical Aspects of Computer Science (STACS)","first-page":"246","article-title":"Directed graphs exploration with little memory","author":"Fraigniaud","year":"1996"},{"issue":"2","key":"10.1016\/j.tcs.2026.115844_bib0018","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/inco.1999.2795","article-title":"Piecemeal graph learning by a mobile robot","volume":"152","author":"Awerbuch","year":"1999","journal-title":"Inf. Comput."},{"key":"10.1016\/j.tcs.2026.115844_bib0019","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1023\/A:1022803514157","article-title":"Piecemeal learning of an unknown environment","volume":"18","author":"Betke","year":"1995","journal-title":"Mach. Learn."},{"key":"10.1016\/j.tcs.2026.115844_bib0020","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/mana.19780860120","article-title":"Automata and labyrinths","volume":"86","author":"Budach","year":"1978","journal-title":"Math. Nachrichten"},{"issue":"1","key":"10.1016\/j.tcs.2026.115844_bib0021","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","article-title":"Tree exploration with little memory","volume":"51","author":"Diks","year":"2004","journal-title":"J. Algorithms"},{"issue":"6","key":"10.1016\/j.tcs.2026.115844_bib0022","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/70.105395","article-title":"Robotic exploration as graph construction","volume":"7","author":"Dudek","year":"1991","journal-title":"IEEE Trans. Robot. Autom."},{"key":"10.1016\/j.tcs.2026.115844_bib0023","series-title":"12th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"807","article-title":"Optimal constrained graph exploration","author":"Duncan","year":"2001"},{"issue":"2","key":"10.1016\/j.tcs.2026.115844_bib0024","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1006\/jagm.1999.1043","article-title":"Exploring unknown undirected graphs","volume":"33","author":"Panaite","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2026.115844_bib0025","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF00288647","article-title":"Automaten in planaren Graphen","volume":"13","author":"Rollik","year":"1980","journal-title":"Acta Informatica"},{"key":"10.1016\/j.tcs.2026.115844_bib0026","series-title":"14th International Conference on Principles of Distributed Systems","first-page":"119","article-title":"Constructing a map of an anonymous graph: applications of universal sequences","author":"Chalopin","year":"2010"},{"key":"10.1016\/j.tcs.2026.115844_bib0027","first-page":"451","article-title":"Graph exploration by a finite automaton","volume":"3153","author":"Fraigniaud","year":"2004","journal-title":"29th International Symposium on Mathematical Foundations of Computer Science (MFCS)"},{"key":"10.1016\/j.tcs.2026.115844_bib0028","series-title":"19th Symposium on Foundations of Computer Science (FOCS","first-page":"132","article-title":"On the power of the compass (or, why mazes are easier to search than graphs","author":"Blum","year":"1978"},{"key":"10.1016\/j.tcs.2026.115844_bib0029","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2025.103696","article-title":"Exploring wedges of an oriented grid by an automaton with pebbles","volume":"155","author":"Bhagat","year":"2026","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2026.115844_bib0030","series-title":"Automata and planar graphs","first-page":"243","author":"Kozen","year":"1979"},{"key":"10.1016\/j.tcs.2026.115844_bib0031","first-page":"433","article-title":"One pebble does not suffice to search plane labyrinths","volume":"117","author":"Hoffmann","year":"1981","journal-title":"Fund. Computat. Theory (FCT)"},{"key":"10.1016\/j.tcs.2026.115844_bib0032","series-title":"27th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"25","article-title":"Undirected graph exploration with \u0398(log\u2009log\u2009n) pebbles","author":"Disser","year":"2016"},{"key":"10.1016\/j.tcs.2026.115844_bib0033","first-page":"17","article-title":"A tight lower bound for semi-synchronous collaborative grid exploration","volume":"13","author":"Brandt","year":"2018","journal-title":"32nd International Symposium on Distributed Computing (DISC)"},{"key":"10.1016\/j.tcs.2026.115844_bib0034","series-title":"28th Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"207","article-title":"Exploring an infinite space with finite memory scouts","author":"Cohen","year":"2017"},{"key":"10.1016\/j.tcs.2026.115844_bib0035","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.tcs.2015.05.054","article-title":"How many ants does it take to find the food?","volume":"608","author":"Emek","year":"2015","journal-title":"Theor. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001039?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T21:46:41Z","timestamp":1778536001000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":35,"alternative-id":["S0304397526001039"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115844","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exploration of convex terrains by a deterministic automaton with pebbles","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115844","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115844"}}