Competitive comparison of optimal designs of experiments for sampling-based sensitivity analysis

被引:19
|
作者
Janouchova, Eliska [1 ]
Kucerova, Anna [1 ]
机构
[1] Czech Tech Univ, Fac Civil Engn, Dept Mech, Prague 16629 6, Czech Republic
关键词
Design of experiments; Space-filling; Orthogonality; Latin Hypercube Sampling; Sampling-based sensitivity analysis; LATIN HYPERCUBE DESIGN; COMPUTER EXPERIMENTS; GENETIC ALGORITHMS; OPTIMIZATION; EFFICIENT; UNCERTAINTY;
D O I
10.1016/j.compstruc.2013.04.009
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
A widely used strategy to explore the sensitivity of the model to its inputs is based on a finite set of simulations. These are usually performed for a chosen set of points in a parameter space. An estimate of the sensitivity can be then obtained by computing correlations between the model inputs and outputs. The accuracy of the sensitivity prediction depends on a quality of the points distribution in the parameter space, so-called the design of experiments. The aim of the presented paper is to review and compare available criteria determining an optimal design of experiments for sampling-based sensitivity analysis. (C) 2013 Elsevier Ltd. All rights reserved.
引用
收藏
页码:47 / 60
页数:14
相关论文
共 50 条
  • [41] Optimal sampling-based neural networks for uncertainty quantification and stochastic optimization
    Gupta, Subham
    Paudel, Achyut
    Thapa, Mishal
    Mulani, Sameer B.
    Walters, Robert W.
    AEROSPACE SCIENCE AND TECHNOLOGY, 2023, 133
  • [42] Comparison of sampling-based algorithms for multisensor distributed target tracking
    Nguyen, TM
    Jilkov, VP
    Li, XR
    FUSION 2003: PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE OF INFORMATION FUSION, VOLS 1 AND 2, 2003, : 114 - 121
  • [43] SOL: Sampling-based Optimal Linear bounding of arbitrary scalar functions
    Biktairov, Yuriy
    Deshmukh, Jyotirmoy
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [44] Sampling-based Algorithms for Optimal Motion Planning with Deterministic μ-Calculus Specifications
    Karaman, Sertac
    Frazzoli, Emilio
    2012 AMERICAN CONTROL CONFERENCE (ACC), 2012, : 735 - 742
  • [45] Maintaining Visibility of a Landmark using Optimal Sampling-based Path Planning
    Lopez-Padilla, Rigoberto
    Murrieta-Cid, Rafael
    COMPUTACION Y SISTEMAS, 2019, 23 (04): : 1357 - 1373
  • [46] Optimal Path Planning in Complex Cost Spaces With Sampling-Based Algorithms
    Devaurs, Didier
    Simeon, Thierry
    Cortes, Juan
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2016, 13 (02) : 415 - 424
  • [47] Adaptive Lazy Collision Checking for Optimal Sampling-based Motion Planning
    Kim, Donghyuk
    Kwon, Youngsun
    Yoon, Sung-eui
    2018 15TH INTERNATIONAL CONFERENCE ON UBIQUITOUS ROBOTS (UR), 2018, : 320 - 327
  • [48] Optimal Kinodynamic Motion Planning using Incremental Sampling-based Methods
    Karaman, Sertac
    Frazzoli, Emilio
    49TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2010, : 7681 - 7687
  • [49] Sampling-based Approximate Optimal Control Under Temporal Logic Constraints
    Fu, Jie
    Papusha, Ivan
    Topcu, Ufuk
    PROCEEDINGS OF THE 20TH INTERNATIONAL CONFERENCE ON HYBRID SYSTEMS: COMPUTATION AND CONTROL (PART OF CPS WEEK) (HSCC' 17), 2017, : 227 - 235
  • [50] Optimal Sampling-Based Planning for Linear-Quadratic Kinodynamic Systems
    Goretkin, Gustavo
    Perez, Alejandro
    Platt, Robert, Jr.
    Konidaris, George
    2013 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2013, : 2429 - 2436