arXiv subjects

Andreas Dotzler

Publications and source records attributed to Andreas Dotzler.

3 recordsLinked to original sources

arXiv2026

Approaching Safety-Argumentation-by-Design: A Requirement-based Safety Argumentation Life Cycle for Automated Vehicles

Despite the growing number of automated vehicles on public roads, operating such systems in open contexts inevitably involves incidents. Developing a defensible case that the residual risk is reduced to a reasonable (societally acceptable) level is hence a prerequisite to be prepared for potential liability cases. A "safety argumentation" is a common means to represent this case. In this paper, we contribute to the state of the art in terms of process guidance on argumentation creation and maintenance - aiming to promote a safety-argumentation-by-design paradigm, which mandates co-developing both the system and argumentation from the earliest stages. Initially, we extend a systematic design model for automated driving functions with an argumentation layer to address prevailing misconceptions regarding the development of safety arguments in a process context. Identified limitations of this extension motivate our complementary design of a dedicated argumentation life cycle that serves as an additional process viewpoint. Correspondingly, we define literature- and expert-based process requirements. To illustrate the safety argumentation life cycle that we propose as a result of implementing these consolidated requirements, we demonstrate principles of the introduced process phases (baselining, evolution, continuous maintenance) by an argumentation example on an operational design domain exit response.

eess.SY↗

arXiv2025

Toward a Harmonized Approach -- Requirement-based Structuring of a Safety Assurance Argumentation for Automated Vehicles

Despite the increasing testing operations of automated vehicles on public roads, media reports on incidents show that safety issues caused by automated driving systems persist to this day. Manufacturers face high development uncertainty when aiming to deploy these systems in an open context. In particular, one challenge is establishing a valid argument at design time that the vehicles will exhibit reasonable residual risk when operating in its intended operational design domain. While there is extensive literature on assurance cases for safety-critical systems in general, the domain of automated driving lacks explicit requirements regarding the creation of safety assurance argumentations for automated vehicles. In this paper, we aim to narrow this gap by elaborating a requirement-based approach. We identify structural requirements for an argumentation based on published literature and supplement these with structural requirements derived from stakeholder concerns. We apply these requirements to obtain a proposal for a generic argumentation structure. The resulting "safety arguments" address the developed product (product argument), the underlying process (process argument) including its conformance/compliance to standards/laws (conformance/compliance argument), as well as an argumentation's context (context argument) and soundness (soundness argument). Finally, we outline argumentation principles in accordance with domain-specific needs and concepts.

eess.SY↗

arXiv2015

Optimal Joint User Association and Resource Allocation in Heterogeneous Networks via Sparsity Pursuit

This paper studies the joint user association and resource allocation in heterogeneous networks (HetNets) from a novel perspective, motivated by and generalizing the idea of fractional frequency reuse. By treating the multi-cell multi-user resource allocation as resource partitioning among multiple reuse patterns, we propose a unified framework to analyze and compare a wide range of user association and resource allocation strategies for HetNets, and provide an optimal benchmark for network performance. The enabling mechanisms are a novel formulation to consider all possible interference patterns or any pre-defined subset of patterns, and efficient sparsity-pursuit algorithms to find the solution. A notable feature of this formulation is that the patterns remain fixed during the resource optimization process. This creates a favorable opportunity for convex formulations while still considering interference coupling. More importantly, in view of the fact that multi-cell resource allocation is very computational demanding, our framework provides a systematic way to trade off performance for the reduction of computational complexity by restricting the candidate patterns to a small number of feature patterns. Relying on the sparsity-pursuit capability of the proposed algorithms, we develop a practical guideline to identify the feature patterns. Numerical results show that the identified feature patterns can significantly improve the existing strategies, and jointly optimizing the user association and resource allocation indeed brings considerable gain.

cs.NI↗