Formal Verification of Station Keeping Maneuvers for a Planar Autonomous Hybrid System
Résumé
In this case study paper, we investigate the formal verification of a hybrid control law designed to perform a station keeping maneuver for a planar vehicle. Such maneuver requires that the vehicle reaches a neighborhood of its station in finite time and remains in it while waiting for further commands. We model the dynamics as well as the control law as a hybrid program and formally verify the reachability and safety properties involved. We highlight in particular the automated generation of invariant regions which turns out to be crucial in performing such verification. We use the hybrid system theorem prover KeymaeraX to formally check the parts of the proof that can be automatized in the current state of the tool.
Domaines
Théorie et langage formel [cs.FL]Origine | Fichiers produits par l'(les) auteur(s) |
---|