Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots
Abstract
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]
Origin : Files produced by the author(s)
Loading...