Feasibility Restoration under Conflicting STL Specifications with Pareto-Optimal Refinement

• URL: http://arxiv.org/abs/2603.06947v1
• Date: Fri, 06 Mar 2026 23:41:01 GMT
• Title: Feasibility Restoration under Conflicting STL Specifications with Pareto-Optimal Refinement
• Abstract summary: Signal Temporal Logic (STL) is expressive language that specifies expressive requirements in robotics.<n>STL specifications may become conflicting in real-world applications, where safety rules, traffic regulations, task and objectives can be cannot be satisfied together.<n>We propose a unified two-stage framework that first restores feasibility via minimal relaxation, then refine the feasible solution by formulating it as a value-aware multi-objective optimization problem.
• Score: 18.383508411056944
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Signal Temporal Logic (STL) is expressive formal language that specifies spatio-temporal requirements in robotics. Its quantitative robustness semantics can be easily integrated with optimization-based control frameworks. However, STL specifications may become conflicting in real-world applications, where safety rules, traffic regulations, and task objectives can be cannot be satisfied together. In these situations, traditional STL-constrained Model Predictive Control (MPC) becomes infeasible and default to conservative behaviors such as freezing, which can largely increase risks in safety-critical scenarios. In this paper, we proposes a unified two-stage framework that first restores feasibility via minimal relaxation, then refine the feasible solution by formulating it as a value-aware multi-objective optimization problem. Using $\varepsilon$-constraint method, we approximate the Pareto front of the multi-objective optimization, which allows analysis of tradeoffs among competing objectives and counterfactual analysis of alternative actions. We demonstrate that the proposed approach avoids deadlock under conflicting STL specifications and enables interpretable decision-making in safety-critical applications by conducting a case study in autonomous driving.

Related papers

• STAIF: A Stage-wise Optimization for Complex Instruction Following [50.48101504556211]
  STAIF is a stage-wise optimization framework that decouples the alignment of subjective (soft) constraints from the optimization of objectively verifiable (hard) constraints.<n>To support this method, we construct STAINSTRUCT, a high-quality bilingual (English, Chinese) dataset of approximately 31,000 complex multi-constraint instructions.
  arXiv  Detail & Related papers  (2026-06-26T06:14:07Z)
• Lexicographic Minimum-Violation Motion Planning using Signal Temporal Logic [9.646103797793614]
  Motion planning for autonomous vehicles often requires satisfying multiple conditionally conflicting specifications.<n>Signal temporal logic provides a formal language for rigorously defining these specifications.<n>A total ordering of specifications yields a lexicographic optimization problem.<n>We address this problem by transforming the multi-objective lexicographic optimization problem into a single-objective scalar optimization problem.
  arXiv  Detail & Related papers  (2026-04-22T10:49:09Z)
• Subspace Control: Turning Constrained Model Steering into Controllable Spectral Optimization [27.280175507074322]
  We propose a subspace control framework for constrained model training.<n>SIFT (spectral interference-free training) consistently achieves substantial and robust performance improvements across all tasks.
  arXiv  Detail & Related papers  (2026-04-05T19:27:24Z)
• Response-Aware Risk-Constrained Control Barrier Function With Application to Vehicles [0.0]
  This paper proposes a unified control framework based on Response-Aware Risk-Constrained Control Barrier Function for dynamic safety boundary control of vehicles.<n>The framework fuses nominal dynamics priors with direct vehicle body responses to provide a baseline direction for control gradients.<n>It also reformulates traditional deterministic safety constraints into probabilistic constraints on the tail risk of barrier function derivatives.
  arXiv  Detail & Related papers  (2026-03-13T02:38:17Z)
• BarrierSteer: LLM Safety via Learning Barrier Steering [83.12893815611052]
  BarrierSteer is a novel framework that formalizes safety by embedding learned non-linear safety constraints directly into the model's latent representation space.<n>We show that BarrierSteer substantially reduces adversarial success rates, decreases unsafe generations, and outperforms existing methods.
  arXiv  Detail & Related papers  (2026-02-23T18:19:46Z)
• MAESTRO: Meta-learning Adaptive Estimation of Scalarization Trade-offs for Reward Optimization [56.074760766965085]
  Group-Relative Policy Optimization has emerged as an efficient paradigm for aligning Large Language Models (LLMs)<n>We propose MAESTRO, which treats reward scalarization as a dynamic latent policy, leveraging the model's terminal hidden states as a semantic bottleneck.<n>We formulate this as a contextual bandit problem within a bi-level optimization framework, where a lightweight Conductor network co-evolves with the policy by utilizing group-relative advantages as a meta-reward signal.
  arXiv  Detail & Related papers  (2026-01-12T05:02:48Z)
• Learning Robust and Correct Controllers Guided by Feasibility-Aware Signal Temporal Logic via BarrierNet [5.174839530270601]
  Control Barrier Functions (CBFs) have emerged as a powerful tool for enforcing safety in optimization-based controllers.<n>We propose a feasibility-aware learning framework that embeds CBFs into a differentiable Quadratic Program (dQP)
  arXiv  Detail & Related papers  (2025-12-07T19:52:27Z)
• Certifiable Safe RLHF: Fixed-Penalty Constraint Optimization for Safer Language Models [7.422627253922975]
  We introduce Certifiable Safe-RLHF, a cost model trained on a large-scale corpus to assign semantically grounded safety scores.<n>With an appropriately scaled penalty, feasibility of the safety constraints can be guaranteed, eliminating the need for dual-variable updates.<n> Empirical evaluation demonstrates that CS-RLHF outperforms state-of-the-art model responses rendering at-least 5 times efficient against nominal and jail-breaking prompts.
  arXiv  Detail & Related papers  (2025-10-03T21:24:41Z)
• Steerable Adversarial Scenario Generation through Test-Time Preference Alignment [58.37104890690234]
  Adversarial scenario generation is a cost-effective approach for safety assessment of autonomous driving systems.<n>We introduce a new framework named textbfSteerable textbfAdversarial scenario textbfGEnerator (SAGE)<n>SAGE enables fine-grained test-time control over the trade-off between adversariality and realism without any retraining.
  arXiv  Detail & Related papers  (2025-09-24T13:27:35Z)
• Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems [53.03951222945921]
  We analyze smoothed (perturbed) policies, adding controlled random perturbations to the direction used by the linear oracle.<n>Our main contribution is a generalization bound that decomposes the excess risk into perturbation bias, statistical estimation error, and optimization error.<n>We illustrate the scope of the results on applications such as vehicle scheduling, highlighting how smoothing enables both tractable training and controlled generalization.
  arXiv  Detail & Related papers  (2024-07-24T12:00:30Z)
• One-Shot Safety Alignment for Large Language Models via Optimal Dualization [64.52223677468861]
  This paper presents a perspective of dualization that reduces constrained alignment to an equivalent unconstrained alignment problem. We do so by pre-optimizing a smooth and convex dual function that has a closed form. Our strategy leads to two practical algorithms in model-based and preference-based settings.
  arXiv  Detail & Related papers  (2024-05-29T22:12:52Z)
• Double Duality: Variational Primal-Dual Policy Optimization for Constrained Reinforcement Learning [132.7040981721302]
  We study the Constrained Convex Decision Process (MDP), where the goal is to minimize a convex functional of the visitation measure. Design algorithms for a constrained convex MDP faces several challenges, including handling the large state space.
  arXiv  Detail & Related papers  (2024-02-16T16:35:18Z)
• Risk-Awareness in Learning Neural Controllers for Temporal Logic Objectives [2.047329787828792]
  We consider the problem of a controller in the presence of uncertainty such that the resulting closed-loop system satisfies certain hard constraints. We utilize the framework of control barrier functions (CBFs) and algorithmically obtain CBFs for STL objectives. We demonstrate the efficacy of our approach on well-known difficult examples for nonlinear control such as a quad-rotor and a unicycle.
  arXiv  Detail & Related papers  (2022-10-14T00:49:08Z)
• Policy Optimization with Linear Temporal Logic Constraints [37.27882290236194]
  We study the problem of policy optimization with linear temporal logic constraints. We develop a model-based approach that enjoys a sample complexity analysis for guaranteeing both task satisfaction and cost optimality.
  arXiv  Detail & Related papers  (2022-06-20T02:58:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.