From Uncertainty Data to Robust Policies for Temporal Logic Planning

Abstract

We consider the problem of synthesizing robust disturbance feedback policies for systems performing complex tasks. We formulate the tasks as linear temporal logic specifications and encode them into an optimization framework via mixed-integer constraints. Both the system dynamics and the specifications are known but affected by uncertainty. The distribution of the uncertainty is unknown, however realizations can be obtained. We introduce a data-driven approach where the constraints are fulfilled for a set of realizations and provide probabilistic generalization guarantees as a function of the number of considered realizations. We use separate chance constraints for the satisfaction of the specification and operational constraints. This allows us to quantify their violation probabilities independently. We compute disturbance feedback policies as solutions of mixed-integer linear or quadratic optimization problems. By using feedback we can exploit information of past realizations and provide feasibility for a wider range of situations compared to static input sequences. We demonstrate the proposed method on two robust motion-planning case studies for autonomous driving.

References in corpus (3)

• On the Sample Size of Random Convex Programs with Structured Dependence on the Uncertainty (Extended Version)
• Exploiting structure of chance constrained programs via submodularity
• Robust Control Policies given Formal Specifications in Uncertain Environments

Cited by in corpus (5)

• Trajectory Planning Under Environmental Uncertainty With Finite-Sample Safety Guarantees
• Safe Motion Planning against Multimodal Distributions based on a Scenario Approach
• Using Uncertainty Data in Chance-Constrained Trajectory Planning
• Temporal Logic Trees for Model Checking and Control Synthesis of Uncertain Discrete-time Systems
• Temporal Logic Planning for Minimum-Time Positioning of Multiple Threat-Seduction Decoys