Author:
Sinha Maitry,Mukhopadhyaya Srabani
Reference14 articles.
1. D’Angelo, G., Di Stefano, G., Navarra, A.: Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model. HAL (2012). In: Alpern, S., et al. (eds.) Search Theory: A Game Theoretic Perspective. Springer, New York (2013)
2. Floccihni, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1–3), 147–168 (2005)
3. Floccihni, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Morgan and Claypool publisher (2012)
4. Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: A distributed memory less point convergence algorithm for mobile robots with limited visibility. IEEE Trans. Robot. Autom. 15(5), 818–828 (1999)
5. Balamohan, B., Dobrev, S., Flocchini, P., Santoro, N.: Asynchronous exploration of an unknown anonymous dangerous graph with o(1) pebbles. In: Structural Information and Communication Complexity, pp. 279–290. Springer (2012)