S. Albers and M. R. Henzinger, Exploring Unknown Environments, SIAM Journal on Computing, vol.29, issue.4, pp.1164-1188, 2000.
DOI : 10.1137/S009753979732428X

S. Albers, Online algorithms: a survey, Mathematical Programming, vol.97, issue.1, pp.3-26, 2003.
DOI : 10.1007/s10107-003-0436-0

S. Albers and S. Schmelzer, Online Algorithms - What Is It Worth to Know the Future?, pp.361-366, 2011.
DOI : 10.1007/978-3-642-15328-0_37

S. Alpern and S. Gal, The theory of search games and rendezvous, 2002.

R. A. Baeza-yates, J. C. Culberson, and G. J. Rawlins, Searching in the Plane, Information and Computation, vol.106, issue.2, pp.234-234, 1993.
DOI : 10.1006/inco.1993.1054

J. Beauquier, J. Burman, J. Clement, and S. Kutten, On utilizing speed in networks of mobile agents, Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, PODC '10, pp.305-314, 2010.
DOI : 10.1145/1835698.1835775
URL : https://hal.archives-ouvertes.fr/inria-00531438

A. Beck, On the linear search problem, Israel Journal of Mathematics, vol.2, issue.4, pp.221-228, 1964.
DOI : 10.1007/BF02759737

R. Bellman, An optimal search problem, Bull. Am. Math. Soc. p, p.270, 1963.

P. Berman, On-line searching and navigation Online Algorithms The State of the Art, pp.232-241, 1998.

J. Chalopin, P. Flocchini, B. Mans, and N. Santoro, Network Exploration by Silent and Oblivious Robots, Graph-Theoretic Concepts in Computer Science, WG 2010, pp.208-219, 2010.
DOI : 10.1137/S009753979628292X
URL : https://hal.archives-ouvertes.fr/hal-01198880

J. Czyzowicz, L. Gasieniec, K. Georgiou, E. Kranakis, and F. Macquarrie, The Beachcombers' Problem: Walking and searching with mobile robots, Structural Information and Communication Complexity, SIROCCO 2014, pp.23-36, 2014.
DOI : 10.1016/j.tcs.2015.09.011

J. Czyzowicz, L. Gasieniec, K. Georgiou, E. Kranakis, and F. Macquarrie, The Multi-source Beachcombers??? Problem, LNCS, vol.8847, pp.3-21, 2014.
DOI : 10.1007/978-3-662-46018-4_1

J. Czyzowicz, L. Gasieniec, A. Kosowski, and E. Kranakis, Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds, Algorithms LNCS, vol.6942, pp.701-712, 2011.
DOI : 10.1007/978-3-642-23719-5_59
URL : https://hal.archives-ouvertes.fr/hal-00646910

J. Czyzowicz, D. Ilcinkas, A. Labourel, and A. Pelc, Worst-case optimal exploration of terrains with obstacles, Information and Computation, vol.225, pp.16-28, 2013.
DOI : 10.1016/j.ic.2013.02.001
URL : https://hal.archives-ouvertes.fr/hal-00863496

S. Das, P. Flocchini, S. Kutten, A. Nayak, and N. Santoro, Map construction of unknown graphs by multiple agents, Theoretical Computer Science, vol.385, issue.1-3, pp.1-3, 2007.
DOI : 10.1016/j.tcs.2007.05.011

E. D. Demaine, S. P. Fekete, and S. Gal, Online searching with turn cost, Theoretical Computer Science, vol.361, issue.2-3, pp.342-355, 2006.
DOI : 10.1016/j.tcs.2006.05.018

X. Deng and C. H. Papadimitriou, Exploring an unknown graph, In: Foundations of Computer Science IEEE, pp.355-361, 1990.

X. Deng, T. Kameda, and C. H. Papadimitriou, How to learn an unknown environment (extended abstract) In: Foundations of Computer Science, FOCS IEEE, pp.298-303, 1991.

D. Dereniowski, Y. Disser, A. Kosowski, D. Pajak, and P. Uznanski, Fast collaborative graph exploration, Automata, Languages, and Programming, ICALP 2013, pp.520-532, 2013.
DOI : 10.1016/j.ic.2014.12.005
URL : https://hal.archives-ouvertes.fr/hal-01251826

R. Fleischer, T. Kamphans, R. Klein, E. Langetepe, and G. Trippen, Competitive Online Approximation of the Optimal Search Ratio, SIAM Journal on Computing, vol.38, issue.3, pp.881-898, 2008.
DOI : 10.1137/060662204

F. V. Fomin and D. M. Thilikos, An annotated bibliography on guaranteed graph searching, Theoretical Computer Science, vol.399, issue.3, pp.236-245, 2008.
DOI : 10.1016/j.tcs.2008.02.040

P. Fraigniaud, L. Gasieniec, D. R. Kowalski, and A. Pelc, Collective tree exploration, Networks, vol.36, issue.3, pp.166-177, 2006.
DOI : 10.1002/net.20127

Y. Higashikawa, N. Katoh, S. Langerman, and S. Tanigawa, Online graph exploration algorithms for cycles and trees by multiple searchers, Journal of Combinatorial Optimization, vol.33, issue.2, 2012.
DOI : 10.1007/s10878-012-9571-y

A. Kawamura and Y. Kobayashi, Fence patrolling by mobile agents with distinct speeds, Algorithms and Computation, ISAAC 2012, pp.598-608, 2012.

G. Wang, M. J. Irwin, H. Fu, P. Berman, W. Zhang et al., Optimizing sensor movement planning for energy efficiency, ACM Transactions on Sensor Networks, vol.7, issue.4, p.33, 2011.