Minimum-Violation Planning for Autonomous Systems: Theoretical and Practical Considerations
Not on the map. Why?
Abstract (arXiv)
This paper considers the problem of computing an optimal trajectory for an autonomous system that is subject to a set of potentially conflicting rules. First, we introduce the concept of prioritized safety specifications, where each rule is expressed as a temporal logic formula with its associated weight and priority. The optimality is defined based on the violation of such prioritized safety specifications. We then introduce a class of temporal logic formulas called textrmsi-FLTL_mathsfGX and develop an efficient, incremental sampling-based approach to solve this minimum-violation planning problem with guarantees on asymptotic optimality. We illustrate the application of the proposed approach in autonomous vehicles, showing that textrmsi-FLTL_mathsfGX formulas are sufficiently expressive to describe many traffic rules. Finally, we discuss practical considerations and present simulation results for a vehicle overtaking scenario.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Sep 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 1; 2024: 2; 2025: 1.
7 papers.
- 2022Learning Minimally-Violating Continuous Control for Infeasible Linear Temporal Logic Specificationscited by 5
- 2022Probabilistic Planning with Partially Ordered Preferences over Temporal Goalscited by 3
- 2023Probabilistic Planning with Prioritized Preferences over Temporal Logic Objectivescited by 2
- 2022Opportunistic Qualitative Planning in Stochastic Systems with Incomplete Preferences over Reachability Objectivescited by 1
- 2024Preference-Based Planning in Stochastic Environments: From Partially-Ordered Temporal Goals to Most Preferred Policiescited by 0
- 2024Incorporating System-level Safety Requirements in Perception Models via Reinforcement Learningcited by 0
- 2025Automata Learning of Preferences over Temporal Logic Formulas from Pairwise Comparisonscited by 0
- 2025Automata Learning of Preferences over Temporal Logic Formulas from Pairwise Comparisons23 May 2025
- 2024Incorporating System-level Safety Requirements in Perception Models via Reinforcement Learning4 Dec 2024
- 2024Preference-Based Planning in Stochastic Environments: From Partially-Ordered Temporal Goals to Most Preferred Policies27 Mar 2024
- 2023Probabilistic Planning with Prioritized Preferences over Temporal Logic Objectives23 Apr 2023
- 2022Opportunistic Qualitative Planning in Stochastic Systems with Incomplete Preferences over Reachability Objectives4 Oct 2022
- 2022Learning Minimally-Violating Continuous Control for Infeasible Linear Temporal Logic Specifications3 Oct 2022
- 2022Probabilistic Planning with Partially Ordered Preferences over Temporal Goals25 Sep 2022