Minimum-violation LTL Planning with Conflicting Specifications

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

TŮMOVÁ Jana REYES CASTRO Luis KARAMAN Sertac FRAZZOLI Emilio RUS Daniela

Year of publication 2013
Type Article in Proceedings
Conference Proceedings of the American Control Conference
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1109/ACC.2013.6579837
Field Informatics
Keywords formal methods; robotics; linear temporal logic; control strategy synthesis
Description We consider the problem of automatic generation of control strategies for robotic vehicles given a set of high-level mission specifications, such as "Vehicle x must eventually visit a target region and then return to a base," "Regions A and B must be periodically surveyed," or " None of the vehicles can enter an unsafe region." We focus on instances when all of the given specifications cannot be reached simultaneously due to their incompatibility and/or environmental constraints. We aim to find the least-violating control strategy while considering different priorities of satisfying different parts of the mission. Formally, we consider the missions given in the form of linear temporal logic formulas, each of which is assigned a reward that is earned when the formula is satisfied. Leveraging ideas from the automata-based model checking, we propose an algorithm for finding an optimal control strategy that maximizes the sum of rewards earned if this control strategy is applied. We demonstrate the proposed algorithm on an illustrative case study.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.