Worst-Case Analysis of Automotive Collision Avoidance Systems

被引:33
|
作者
Nilsson, Jonas [1 ]
Odblom, Anders C. E. [2 ]
Fredriksson, Jonas [3 ]
机构
[1] Volvo Car Corp, Dept Strategy & Concepts, S-40531 Gothenburg, Sweden
[2] Volvo Car Corp, Vehicle Dynam & Act Safety Ctr, S-40531 Gothenburg, Sweden
[3] Chalmers Univ Technol, Dept Signals & Syst, S-41296 Gothenburg, Sweden
关键词
Collision avoidance; intelligent vehicles; mechatronics; vehicle safety; THREAT ASSESSMENT;
D O I
10.1109/TVT.2015.2419196
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Automotive collision avoidance (CA) systems help drivers to avoid collisions through autonomous interventions by braking or steering. If the decision to intervene is made too early, the intervention can become a nuisance to the driver, and if the decision is made too late, the safety benefits of the intervention will be reduced. The decision to intervene is commonly based on a threat function. The dimensionality of the input state space for the threat function is, in general, very large, making exhaustive evaluation in real vehicles intractable. This paper presents a method for efficient estimation of a conservative bound on CA system performance, i.e., the worst-case performance. Closed-form expressions are derived for the worst-case performance, in terms of early or unnecessary interventions, with regard to longitudinal or lateral prediction and measurement errors. In addition, we derive closed-form expressions for robust avoidance scenarios, in which no unnecessary intervention will occur. For a system example, numerical results show how decision timing and robustness depend on scenario and system parameters. The method can be used for defining system requirements, system verification, system tuning, or system sensitivity analysis with regard to scenario variations and sensor measurement errors.
引用
收藏
页码:1899 / 1911
页数:13
相关论文
共 50 条
  • [41] WORST-CASE ANALYSIS OF SET UNION ALGORITHMS
    TARJAN, RE
    VANLEEUWEN, J
    JOURNAL OF THE ACM, 1984, 31 (02) : 245 - 281
  • [42] The worst-case analysis of the Garey–Johnson algorithm
    Claire Hanen
    Yakov Zinder
    Journal of Scheduling, 2009, 12 : 389 - 400
  • [43] The worst-case scenario
    Schneider, Stephen
    NATURE, 2009, 458 (7242) : 1104 - 1105
  • [44] Worst-case scenarios
    Wilkinson, T. M.
    RES PUBLICA-A JOURNAL OF MORAL LEGAL AND POLITICAL PHILOSOPHY, 2009, 15 (02): : 203 - 211
  • [45] WORST-CASE ANALYSIS OF AN ALGORITHM FOR CELLULAR MANUFACTURING
    NG, SM
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 69 (03) : 384 - 398
  • [46] Worst-case distribution analysis of stochastic programs
    Alexander Shapiro
    Mathematical Programming, 2006, 107 : 91 - 96
  • [47] Ties in Worst-Case Analysis of the Euclidean Algorithm
    Hopkins, Brian
    Tangboonduangjit, Aram
    MATHEMATICAL COMMUNICATIONS, 2021, 26 (01) : 9 - 20
  • [48] Worst-case scenarios
    Durodie, Bill
    INTERNATIONAL AFFAIRS, 2008, 84 (03) : 567 - 568
  • [49] Worst-case equilibria
    Koutsoupias, E
    Papadimitriou, C
    STACS'99 - 16TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1999, 1563 : 404 - 413
  • [50] WORST-CASE ANALYSIS OF A GENERALIZED HEAPSORT ALGORITHM
    PAULIK, A
    INFORMATION PROCESSING LETTERS, 1990, 36 (03) : 159 - 165