R. A. Baezayates, J. C. Culberson, and G. J. Rawlins, Searching in the Plane, Information and Computation, vol.106, issue.2, pp.234-252, 1993.
DOI : 10.1006/inco.1993.1054
URL : http://doi.org/10.1006/inco.1993.1054

G. Das, P. J. Heffernan, and G. Narasimhan, LR-visibility in polygons, Computational Geometry, vol.7, issue.1-2, pp.37-57, 1997.
DOI : 10.1016/0925-7721(95)00042-9
URL : http://doi.org/10.1016/0925-7721(95)00042-9

B. Gfeller, M. Mihalak, S. Suri, E. Vicari, and P. Widmayer, Counting Targets with Mobile Sensors in an Unknown Environment, Algorithmic Aspects of Wireless Sensor Networks, pp.32-45, 2008.
DOI : 10.1007/978-3-540-77871-4_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.9989

S. K. Ghosh, Visibility algorithms in the plane, 2007.
DOI : 10.1017/CBO9780511543340

C. Icking, R. Klein, and E. Langetepe, An optimal competitive strategy for walking in streets, STACS 99, pp.110-120, 1999.

R. Klein, Walking an unknown street with bounded detour, Proceedings., 32nd Annual Symposium on, pp.304-313, 1991.
DOI : 10.1109/sfcs.1991.185383
URL : http://dx.doi.org/10.1016/0925-7721(92)90010-p

J. M. Kleinbergt, On-line search in a simple polygon, Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, 1994.

A. Lopez-ortiz, On-line target searching in bounded and unbounded domains, 1996.

A. Lopez-ortiz and S. Schuierer, Simple, efficient and robust strategies to traverse streets, Proc. 7th Canad. Conf. on Computational Geometry, 1995.

J. S. Mitchell, Geometric shortest paths and network optimization. Handbook of computational geometry, pp.633-702, 2000.
DOI : 10.1016/b978-044482537-7/50016-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.2239

S. Suri, E. Vicari, and P. Widmayer, Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry, The International Journal of Robotics Research, vol.438, issue.1, pp.1055-1067, 2008.
DOI : 10.1177/0278364908095833
URL : http://e-collection.ethbib.ethz.ch/show?type=incoll&nr=2527

B. Tovar, R. Murrieta-cid, and S. M. Lavalle, Distance-Optimal Navigation in an Unknown Environment Without Sensing Distances, IEEE Transactions on Robotics, vol.23, issue.3, pp.506-518, 2007.
DOI : 10.1109/TRO.2007.898962
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.3365

B. Tovar, S. M. Lavalle, and R. Murrieta, Optimal navigation and object finding without geometric maps or localization, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422), pp.464-470, 2003.
DOI : 10.1109/ROBOT.2003.1241638

A. Tabatabaei and M. Ghodsi, Optimal Strategy for Walking in Streets with Minimum Number of Turns for a Simple Robot, Combinatorial Optimization and Applications, pp.101-112, 2014.
DOI : 10.1007/978-3-319-12691-3_9

M. Hammar, B. J. Nilsson, and M. Persson, Competitive exploration of rectilinear polygons, Fundamentals of Computation Theory, pp.234-245, 2003.

J. Yu and S. M. Lavalle, Planning optimal paths for multiple robots on graphs, 2013 IEEE International Conference on Robotics and Automation, pp.3612-3617, 2013.
DOI : 10.1109/ICRA.2013.6631084

J. Yu and S. M. Lavalle, Structure and Intractability of Optimal Multi-Robot Path Planning on Graphs, 2013.

J. Yu and S. M. Lavalle, Multi-agent Path Planning and Network Flow, Algorithmic Foundations of Robotics X, pp.157-173, 2013.
DOI : 10.1007/978-3-642-36279-8_10

M. Erdmann and T. Lozano-perez, On multiple moving objects, Algorithmica, vol.19, issue.4, pp.477-521, 1987.
DOI : 10.1007/BF01840371
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.5597

R. Luna and K. E. Bekris, Push and swap: Fast cooperative path-finding with completeness guarantees, IJCAI, pp.294-300, 2011.

M. R. Ryan, Exploiting subgraph structure in multi-robot path planning, Journal of Artificial Intelligence Research, pp.497-542, 2008.

D. Silver, Cooperative Pathfinding, AIIDE, pp.117-122, 2005.

A. Tabatabaei and M. Ghodsi, Walking in Streets with Minimal Sensing, Journal of Combinatorial Optimization, 2014.
DOI : 10.1007/s10878-014-9791-4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.476.2345