Optimally Gathering Two Robots - Sorbonne Université
Conference Papers Year : 2018

Optimally Gathering Two Robots

Domains

Distributed, Parallel, and Cluster Computing [cs.DC] Computational Geometry [cs.CG] Discrete Mathematics [cs.DM] Data Structures and Algorithms [cs.DS] Embedded Systems Mobile Computing Networking and Internet Architecture [cs.NI] Robotics [cs.RO]

Sébastien Tixeuil  : Connect in order to contact the contributor

https://hal.sorbonne-universite.fr/hal-01753431

Submitted on : Thursday, March 29, 2018-4:28:57 PM

Last modification on : Wednesday, October 30, 2024-1:33:34 PM

Consult the full text

Dates and versions

hal-01753431 , version 1 (29-03-2018)

Identifiers

Cite

Adam Heriban, Xavier Défago, Sébastien Tixeuil. Optimally Gathering Two Robots. The 19th International Conference on Distributed Computing and Networking, Jan 2018, Varanasi, India. pp.3, ⟨10.1145/3154273.3154323⟩. ⟨hal-01753431⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA LIP6 TDS-MACS SORBONNE-UNIVERSITE SU-SCIENCES SPRES
281 View
0 Download

Altmetric

Share

More