Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space.
Xavier DéfagoAdam HeribanSébastien TixeuilKoichi WadaPublished in: Robotics Auton. Syst. (2023)
Keyphrases
- model checking
- euclidean space
- verification method
- temporal logic
- reachability analysis
- deterministic finite automaton
- low dimensional
- formal specification
- formal verification
- symbolic model checking
- vector space
- feature space
- pattern recognition
- finite state
- data structure
- pairwise distances
- computer vision
- machine learning