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.

Domaines

Calcul parallèle, distribué et partagé [cs.DC] Géométrie algorithmique [cs.CG] Algorithme et structure de données [cs.DS] Informatique ubiquitaire Informatique mobile Robotique [cs.RO]

Fichier principal

main_tr.pdf (224.23 Ko)

Origine	Fichiers produits par l'(les) auteur(s)

Sébastien Tixeuil : Connectez-vous pour contacter le contributeur

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

Soumis le : mardi 10 avril 2018-15:24:52

Dernière modification le : jeudi 28 novembre 2024-16:28:03

Dates et versions

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

Identifiants

HAL Id : hal-01762962 , version 1

Citer

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⟩

Exporter

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

633 Consultations

400 Téléchargements