Information Technology Reference
In-Depth Information
19.
Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from
symmetric configurations without global multiplicity detection. In: Proceedings of the 37th
International Symposium on Mathematical Foundations of Computer Science (MFCS), vol.
7464, pp. 542-553. Springer-Verlag (2012)
20.
Kempkes, B., Meyer auf der Heide, F.: Continuous local strategies for robotic formation prob-
lems. In: Proceedings of the 11th International Symposium on Experimental Algorithms
(SEA),
Lecture Notes in Computer Science
, vol. 7276, pp. 9-17. Springer-Verlag (2012)
21.
Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: Gathering of many
asynchronous oblivious robots on a ring.
Theoretical Computer Science
411
, 3235-3246
(2010)
22.
Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring.
Theoretical Computer Science
390
, 27-39 (2008)
23.
Koren, M.: Gathering small number of mobile asynchronous robots on ring. Zeszyty Naukowe
Wydzialu ETI Politechniki Gdanskiej. Technologie Informacyjne
18
, 325-331 (2010)
24.
Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring.
Morgan & Claypool (2010)
25.
Kranakis, E., Krizanc, D., Rajsbaum, S.: Mobile agent rendezvous: a survey. In: Proceedings
of the 13th International Colloquium on Structural Information and Communication Com-
plexity (SIROCCO),
Lecture Notes in Computer Science
, vol. 4056, pp. 1-9. Springer-Verlag
(2006)
26.
Pelc, A.: Deterministic rendezvous in networks: A comprehensive survey.
Networks
59
(3),
331-347 (2012)
27.
Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoretical
Computer Science
384
, 222-231 (2007)
28.
Santoro, N.: Design and Analysis of Distributed Algorithms. John Wiley & Sons (2007)
29.
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric pat-
terns. SIAM J. Comput.
28
(4), 1347-1363 (1999)
Search WWH ::
Custom Search