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

Computer Science [cs] Distributed, Parallel, and Cluster Computing [cs.DC] Computer Science [cs] Computational Geometry [cs.CG] Computer Science [cs] Data Structures and Algorithms [cs.DS] Computer Science [cs] Ubiquitous Computing Computer Science [cs] Mobile Computing Computer Science [cs] 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 : Friday, March 24, 2023-2:53:07 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 TEI Dublin Core DC Terms EndNote Datacite

Collections

INSTITUT-TELECOM 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 GS-COMPUTER-SCIENCE SPRES

505 View

278 Download