Corpus ID: 1578873

Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots

@article{Courtieu2016CertifiedUG,
  title={Certified Universal Gathering in \$R^2\$ for Oblivious Mobile Robots},
  author={Pierre Courtieu and Lionel Rieg and S. Tixeuil and X. Urbain},
  journal={ArXiv},
  year={2016},
  volume={abs/1602.08361}
}
We present a unified formal framework for expressing mobile robots models, protocols, and proofs, and devise a protocol design/proof methodology dedicated to mobile robots that takes advantage of this formal framework. As a case study, we present the first formally certified protocol for oblivious mobile robots evolving in a two-dimensional Euclidean space. In more details, we provide a new algorithm for the problem of universal gathering mobile oblivious robots (that is, starting from any… Expand
Model Checking of Robot Gathering
Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space
Unreliable Sensors for Reliable Efficient Robots
Synchronous Gathering without Multiplicity Detection: a Certified Algorithm
On the Encoding and Solving of Partial Information Games
A Framework for Certified Self-Stabilization
Formal foundations of 3D geometry to model robot manipulators
On asynchronous rendezvous in general graphs
An Environment for Specifying and Model Checking Mobile Ring Robot Algorithms

References

SHOWING 1-10 OF 31 REFERENCES
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots
Formal verification of mobile robot protocols
Feasibility of Polynomial-Time Randomized Gathering for Oblivious Mobile Robots
Wait-Free Gathering Without Chirality
Impossibility of gathering, a certification
Gathering of Mobile Robots Tolerating Multiple Crash Faults
Distributed Computing by Oblivious Mobile Robots
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
Formal Methods for Mobile Robots: Current Results and Open Problems
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
...
1
2
3
4
...