Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots

Oblivious Mobile Robots have been studied both in continuous Euclidean spaces, and discrete spaces (that is, graphs). However the obtained literature forms distinct sets of results for the two settings. In this paper, we explore the possibility of transforming results obtained in one model into results for the other one. Our approach focuses on certified results using the COQ proof assistant.

Domains

Distributed, Parallel, and Cluster Computing [cs.DC] Computational Geometry [cs.CG] Data Structures and Algorithms [cs.DS] Ubiquitous Computing Mobile Computing Robotics [cs.RO]

Fichier principal

main_tr.pdf (224.23 Ko)

Origin	Files produced by the author(s)

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

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

Submitted on : Tuesday, April 10, 2018-3:24:52 PM

Last modification on : Thursday, November 28, 2024-4:28:03 PM

Dates and versions

hal-01762962 , version 1 (10-04-2018)

Identifiers

HAL Id : hal-01762962 , version 1

Cite

Thibaut Balabonski, Pierre Courtieu, Robin Pelle, Lionel Rieg, Sébastien Tixeuil, et al.. Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots. [Research Report] Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France. 2018, pp.1-12. ⟨hal-01762962⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA UNIV-LYON1 UNIV-LYON2 INSA-LYON EC-LYON CNAM LIRIS UMR8623 LIP6 CENTRALESUPELEC LRI-VALS LARA UNIV-PARIS-SACLAY INSA-GROUPE SORBONNE-UNIVERSITE CEDRIC-CNAM SU-SCIENCES UDL SPRES HESAM

624 View

394 Download